./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:19:50,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:19:50,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:19:50,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:19:50,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:19:50,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:19:50,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:19:50,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:19:50,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:19:50,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:19:50,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:19:50,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:19:50,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:19:50,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:19:50,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:19:50,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:19:50,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:19:50,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:19:50,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:19:50,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:19:50,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:19:50,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:19:50,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:19:50,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:19:50,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:19:50,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:19:50,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:19:50,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:19:50,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:19:50,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:19:50,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:19:50,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:19:50,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:19:50,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:19:50,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:19:50,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:19:50,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:19:50,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:19:50,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:19:50,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:19:50,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:19:50,985 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:19:51,021 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:19:51,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:19:51,022 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:19:51,022 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:19:51,023 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:19:51,023 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:19:51,024 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:19:51,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:19:51,024 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:19:51,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:19:51,026 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:19:51,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:19:51,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:19:51,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:19:51,027 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:19:51,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:19:51,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:19:51,027 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:19:51,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:19:51,028 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:19:51,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:19:51,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:19:51,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:19:51,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:19:51,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:19:51,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:19:51,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:19:51,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:19:51,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:19:51,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:19:51,032 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:19:51,032 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:19:51,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:19:51,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 [2022-11-02 20:19:51,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:19:51,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:19:51,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:19:51,335 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:19:51,336 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:19:51,337 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-02 20:19:51,410 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/data/43c6b2973/bbf81dcb05a44e949aedd2504649c93f/FLAG275cc320f [2022-11-02 20:19:52,030 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:19:52,031 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-02 20:19:52,047 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/data/43c6b2973/bbf81dcb05a44e949aedd2504649c93f/FLAG275cc320f [2022-11-02 20:19:52,298 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/data/43c6b2973/bbf81dcb05a44e949aedd2504649c93f [2022-11-02 20:19:52,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:19:52,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:19:52,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:19:52,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:19:52,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:19:52,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:19:52" (1/1) ... [2022-11-02 20:19:52,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1049aa52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:52, skipping insertion in model container [2022-11-02 20:19:52,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:19:52" (1/1) ... [2022-11-02 20:19:52,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:19:52,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:19:52,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-02 20:19:52,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:19:52,908 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:19:52,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-02 20:19:53,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:19:53,040 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:19:53,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:53 WrapperNode [2022-11-02 20:19:53,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:19:53,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:19:53,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:19:53,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:19:53,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:53" (1/1) ... [2022-11-02 20:19:53,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:53" (1/1) ... [2022-11-02 20:19:53,094 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 297 [2022-11-02 20:19:53,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:19:53,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:19:53,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:19:53,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:19:53,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:53" (1/1) ... [2022-11-02 20:19:53,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:53" (1/1) ... [2022-11-02 20:19:53,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:53" (1/1) ... [2022-11-02 20:19:53,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:53" (1/1) ... [2022-11-02 20:19:53,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:53" (1/1) ... [2022-11-02 20:19:53,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:53" (1/1) ... [2022-11-02 20:19:53,123 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:53" (1/1) ... [2022-11-02 20:19:53,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:53" (1/1) ... [2022-11-02 20:19:53,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:19:53,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:19:53,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:19:53,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:19:53,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:53" (1/1) ... [2022-11-02 20:19:53,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:19:53,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:53,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:19:53,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:19:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:19:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:19:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:19:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:19:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:19:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-02 20:19:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-02 20:19:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-02 20:19:53,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-02 20:19:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-02 20:19:53,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-02 20:19:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-02 20:19:53,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-02 20:19:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:19:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:19:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:19:53,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:19:53,234 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:19:53,408 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:19:53,424 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:19:54,146 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:19:54,609 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:19:54,609 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:19:54,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:19:54 BoogieIcfgContainer [2022-11-02 20:19:54,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:19:54,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:19:54,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:19:54,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:19:54,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:19:52" (1/3) ... [2022-11-02 20:19:54,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343d7bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:19:54, skipping insertion in model container [2022-11-02 20:19:54,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:53" (2/3) ... [2022-11-02 20:19:54,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343d7bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:19:54, skipping insertion in model container [2022-11-02 20:19:54,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:19:54" (3/3) ... [2022-11-02 20:19:54,625 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-02 20:19:54,634 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:19:54,644 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:19:54,644 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:19:54,644 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:19:54,730 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:19:54,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-11-02 20:19:54,892 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-02 20:19:54,893 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:19:54,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-02 20:19:54,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-11-02 20:19:54,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-11-02 20:19:54,930 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:19:54,940 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5da63694, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:19:54,941 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-02 20:19:54,983 INFO L130 PetriNetUnfolder]: 0/91 cut-off events. [2022-11-02 20:19:54,984 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:19:54,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:54,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:54,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:19:54,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:54,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2132212955, now seen corresponding path program 1 times [2022-11-02 20:19:55,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:55,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505205020] [2022-11-02 20:19:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:55,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:55,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505205020] [2022-11-02 20:19:55,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505205020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:55,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:55,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:19:55,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929633186] [2022-11-02 20:19:55,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:55,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:55,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:55,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:55,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:55,810 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 136 [2022-11-02 20:19:55,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:55,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:55,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 136 [2022-11-02 20:19:55,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:55,972 INFO L130 PetriNetUnfolder]: 17/214 cut-off events. [2022-11-02 20:19:55,972 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 20:19:55,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 214 events. 17/214 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 507 event pairs, 3 based on Foata normal form. 9/216 useless extension candidates. Maximal degree in co-relation 213. Up to 27 conditions per place. [2022-11-02 20:19:55,976 INFO L137 encePairwiseOnDemand]: 131/136 looper letters, 11 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2022-11-02 20:19:55,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 131 transitions, 300 flow [2022-11-02 20:19:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:19:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2022-11-02 20:19:56,000 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2022-11-02 20:19:56,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2022-11-02 20:19:56,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2022-11-02 20:19:56,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:56,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2022-11-02 20:19:56,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:56,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:56,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:56,021 INFO L175 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 384 transitions. [2022-11-02 20:19:56,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 131 transitions, 300 flow [2022-11-02 20:19:56,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 131 transitions, 296 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:19:56,030 INFO L231 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2022-11-02 20:19:56,032 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-11-02 20:19:56,036 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-11-02 20:19:56,037 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2022-11-02 20:19:56,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:56,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:56,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:56,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:19:56,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:19:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:56,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1153384263, now seen corresponding path program 1 times [2022-11-02 20:19:56,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:56,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940827831] [2022-11-02 20:19:56,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:56,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:56,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:56,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940827831] [2022-11-02 20:19:56,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940827831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:56,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:56,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:19:56,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920739356] [2022-11-02 20:19:56,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:56,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:19:56,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:56,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:19:56,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:19:56,503 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 136 [2022-11-02 20:19:56,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:56,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:56,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 136 [2022-11-02 20:19:56,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:56,839 INFO L130 PetriNetUnfolder]: 84/443 cut-off events. [2022-11-02 20:19:56,839 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-02 20:19:56,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 443 events. 84/443 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2069 event pairs, 20 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 585. Up to 65 conditions per place. [2022-11-02 20:19:56,844 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 16 selfloop transitions, 2 changer transitions 38/154 dead transitions. [2022-11-02 20:19:56,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 154 transitions, 412 flow [2022-11-02 20:19:56,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:19:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:19:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1080 transitions. [2022-11-02 20:19:56,848 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2022-11-02 20:19:56,848 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1080 transitions. [2022-11-02 20:19:56,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1080 transitions. [2022-11-02 20:19:56,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:56,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1080 transitions. [2022-11-02 20:19:56,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:56,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:56,859 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:56,859 INFO L175 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 9 states and 1080 transitions. [2022-11-02 20:19:56,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 154 transitions, 412 flow [2022-11-02 20:19:56,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 154 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:19:56,866 INFO L231 Difference]: Finished difference. Result has 152 places, 114 transitions, 256 flow [2022-11-02 20:19:56,866 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=256, PETRI_PLACES=152, PETRI_TRANSITIONS=114} [2022-11-02 20:19:56,867 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 9 predicate places. [2022-11-02 20:19:56,868 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 114 transitions, 256 flow [2022-11-02 20:19:56,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:56,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:56,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:56,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:19:56,870 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:19:56,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:56,870 INFO L85 PathProgramCache]: Analyzing trace with hash -38168854, now seen corresponding path program 1 times [2022-11-02 20:19:56,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:56,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964943924] [2022-11-02 20:19:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:56,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:57,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:57,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964943924] [2022-11-02 20:19:57,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964943924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:57,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:57,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:19:57,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265992571] [2022-11-02 20:19:57,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:57,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:19:57,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:57,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:19:57,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:19:57,635 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-11-02 20:19:57,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 114 transitions, 256 flow. Second operand has 11 states, 11 states have (on average 110.54545454545455) internal successors, (1216), 11 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:57,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:57,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-11-02 20:19:57,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:58,571 INFO L130 PetriNetUnfolder]: 318/785 cut-off events. [2022-11-02 20:19:58,571 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2022-11-02 20:19:58,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 785 events. 318/785 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4106 event pairs, 127 based on Foata normal form. 18/781 useless extension candidates. Maximal degree in co-relation 1487. Up to 320 conditions per place. [2022-11-02 20:19:58,579 INFO L137 encePairwiseOnDemand]: 123/136 looper letters, 24 selfloop transitions, 16 changer transitions 54/186 dead transitions. [2022-11-02 20:19:58,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 186 transitions, 630 flow [2022-11-02 20:19:58,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:19:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-02 20:19:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2278 transitions. [2022-11-02 20:19:58,585 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8375 [2022-11-02 20:19:58,586 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2278 transitions. [2022-11-02 20:19:58,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2278 transitions. [2022-11-02 20:19:58,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:58,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2278 transitions. [2022-11-02 20:19:58,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 113.9) internal successors, (2278), 20 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:58,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 136.0) internal successors, (2856), 21 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:58,600 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 136.0) internal successors, (2856), 21 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:58,600 INFO L175 Difference]: Start difference. First operand has 152 places, 114 transitions, 256 flow. Second operand 20 states and 2278 transitions. [2022-11-02 20:19:58,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 186 transitions, 630 flow [2022-11-02 20:19:58,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 186 transitions, 582 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-11-02 20:19:58,611 INFO L231 Difference]: Finished difference. Result has 159 places, 126 transitions, 371 flow [2022-11-02 20:19:58,611 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=371, PETRI_PLACES=159, PETRI_TRANSITIONS=126} [2022-11-02 20:19:58,613 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 16 predicate places. [2022-11-02 20:19:58,614 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 126 transitions, 371 flow [2022-11-02 20:19:58,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 110.54545454545455) internal successors, (1216), 11 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:58,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:58,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:58,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:19:58,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:19:58,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1776172829, now seen corresponding path program 1 times [2022-11-02 20:19:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:58,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422078267] [2022-11-02 20:19:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:58,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:59,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:59,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422078267] [2022-11-02 20:19:59,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422078267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:59,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:59,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:19:59,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912113650] [2022-11-02 20:19:59,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:59,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:19:59,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:59,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:19:59,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:19:59,116 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2022-11-02 20:19:59,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 126 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:59,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:59,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2022-11-02 20:19:59,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:59,755 INFO L130 PetriNetUnfolder]: 518/1338 cut-off events. [2022-11-02 20:19:59,755 INFO L131 PetriNetUnfolder]: For 4762/5062 co-relation queries the response was YES. [2022-11-02 20:19:59,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3977 conditions, 1338 events. 518/1338 cut-off events. For 4762/5062 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8611 event pairs, 216 based on Foata normal form. 17/1299 useless extension candidates. Maximal degree in co-relation 3900. Up to 579 conditions per place. [2022-11-02 20:19:59,774 INFO L137 encePairwiseOnDemand]: 129/136 looper letters, 31 selfloop transitions, 3 changer transitions 31/169 dead transitions. [2022-11-02 20:19:59,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 169 transitions, 763 flow [2022-11-02 20:19:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:19:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:19:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1085 transitions. [2022-11-02 20:19:59,779 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.886437908496732 [2022-11-02 20:19:59,779 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1085 transitions. [2022-11-02 20:19:59,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1085 transitions. [2022-11-02 20:19:59,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:59,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1085 transitions. [2022-11-02 20:19:59,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.55555555555556) internal successors, (1085), 9 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:59,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:59,790 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:59,791 INFO L175 Difference]: Start difference. First operand has 159 places, 126 transitions, 371 flow. Second operand 9 states and 1085 transitions. [2022-11-02 20:19:59,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 169 transitions, 763 flow [2022-11-02 20:19:59,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 169 transitions, 669 flow, removed 45 selfloop flow, removed 11 redundant places. [2022-11-02 20:19:59,809 INFO L231 Difference]: Finished difference. Result has 151 places, 128 transitions, 386 flow [2022-11-02 20:19:59,815 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=386, PETRI_PLACES=151, PETRI_TRANSITIONS=128} [2022-11-02 20:19:59,817 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 8 predicate places. [2022-11-02 20:19:59,817 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 128 transitions, 386 flow [2022-11-02 20:19:59,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:59,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:59,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:59,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:19:59,819 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:19:59,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash -731545563, now seen corresponding path program 1 times [2022-11-02 20:19:59,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:59,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347412346] [2022-11-02 20:19:59,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:59,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:00,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:00,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347412346] [2022-11-02 20:20:00,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347412346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:00,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:00,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:20:00,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942027764] [2022-11-02 20:20:00,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:00,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:20:00,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:00,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:20:00,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:20:00,228 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2022-11-02 20:20:00,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 128 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:00,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:20:00,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2022-11-02 20:20:00,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:20:00,880 INFO L130 PetriNetUnfolder]: 434/1274 cut-off events. [2022-11-02 20:20:00,880 INFO L131 PetriNetUnfolder]: For 3303/3643 co-relation queries the response was YES. [2022-11-02 20:20:00,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3782 conditions, 1274 events. 434/1274 cut-off events. For 3303/3643 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8792 event pairs, 138 based on Foata normal form. 26/1238 useless extension candidates. Maximal degree in co-relation 3707. Up to 290 conditions per place. [2022-11-02 20:20:00,898 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 33 selfloop transitions, 6 changer transitions 22/160 dead transitions. [2022-11-02 20:20:00,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 160 transitions, 710 flow [2022-11-02 20:20:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:20:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:20:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1078 transitions. [2022-11-02 20:20:00,902 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.880718954248366 [2022-11-02 20:20:00,902 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1078 transitions. [2022-11-02 20:20:00,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1078 transitions. [2022-11-02 20:20:00,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:20:00,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1078 transitions. [2022-11-02 20:20:00,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:00,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:00,909 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:00,909 INFO L175 Difference]: Start difference. First operand has 151 places, 128 transitions, 386 flow. Second operand 9 states and 1078 transitions. [2022-11-02 20:20:00,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 160 transitions, 710 flow [2022-11-02 20:20:00,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 160 transitions, 687 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-11-02 20:20:00,919 INFO L231 Difference]: Finished difference. Result has 156 places, 128 transitions, 409 flow [2022-11-02 20:20:00,920 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=409, PETRI_PLACES=156, PETRI_TRANSITIONS=128} [2022-11-02 20:20:00,922 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 13 predicate places. [2022-11-02 20:20:00,923 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 128 transitions, 409 flow [2022-11-02 20:20:00,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:00,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:20:00,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:00,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:20:00,924 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:20:00,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:00,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1201305692, now seen corresponding path program 1 times [2022-11-02 20:20:00,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:00,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199324738] [2022-11-02 20:20:00,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:00,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:01,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:01,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199324738] [2022-11-02 20:20:01,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199324738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:01,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:01,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:01,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030906231] [2022-11-02 20:20:01,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:01,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:20:01,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:01,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:20:01,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:20:01,850 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 136 [2022-11-02 20:20:01,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 128 transitions, 409 flow. Second operand has 8 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:01,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:20:01,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 136 [2022-11-02 20:20:01,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:20:02,416 INFO L130 PetriNetUnfolder]: 382/1201 cut-off events. [2022-11-02 20:20:02,416 INFO L131 PetriNetUnfolder]: For 4081/4227 co-relation queries the response was YES. [2022-11-02 20:20:02,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3796 conditions, 1201 events. 382/1201 cut-off events. For 4081/4227 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8218 event pairs, 152 based on Foata normal form. 33/1171 useless extension candidates. Maximal degree in co-relation 3715. Up to 350 conditions per place. [2022-11-02 20:20:02,434 INFO L137 encePairwiseOnDemand]: 127/136 looper letters, 21 selfloop transitions, 7 changer transitions 22/155 dead transitions. [2022-11-02 20:20:02,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 155 transitions, 685 flow [2022-11-02 20:20:02,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:20:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:20:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1290 transitions. [2022-11-02 20:20:02,439 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8622994652406417 [2022-11-02 20:20:02,439 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1290 transitions. [2022-11-02 20:20:02,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1290 transitions. [2022-11-02 20:20:02,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:20:02,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1290 transitions. [2022-11-02 20:20:02,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 117.27272727272727) internal successors, (1290), 11 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:02,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:02,476 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:02,477 INFO L175 Difference]: Start difference. First operand has 156 places, 128 transitions, 409 flow. Second operand 11 states and 1290 transitions. [2022-11-02 20:20:02,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 155 transitions, 685 flow [2022-11-02 20:20:02,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 155 transitions, 651 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-11-02 20:20:02,490 INFO L231 Difference]: Finished difference. Result has 160 places, 130 transitions, 454 flow [2022-11-02 20:20:02,491 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=454, PETRI_PLACES=160, PETRI_TRANSITIONS=130} [2022-11-02 20:20:02,491 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 17 predicate places. [2022-11-02 20:20:02,492 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 130 transitions, 454 flow [2022-11-02 20:20:02,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:02,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:20:02,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:02,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:20:02,493 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:20:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2093644030, now seen corresponding path program 1 times [2022-11-02 20:20:02,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:02,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432090338] [2022-11-02 20:20:02,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:02,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:03,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:03,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432090338] [2022-11-02 20:20:03,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432090338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:03,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:03,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:20:03,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424456424] [2022-11-02 20:20:03,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:03,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:20:03,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:03,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:20:03,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:20:03,500 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-02 20:20:03,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 130 transitions, 454 flow. Second operand has 11 states, 11 states have (on average 112.63636363636364) internal successors, (1239), 11 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:03,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:20:03,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-02 20:20:03,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:20:04,172 INFO L130 PetriNetUnfolder]: 340/1098 cut-off events. [2022-11-02 20:20:04,173 INFO L131 PetriNetUnfolder]: For 6085/6456 co-relation queries the response was YES. [2022-11-02 20:20:04,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4045 conditions, 1098 events. 340/1098 cut-off events. For 6085/6456 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7440 event pairs, 61 based on Foata normal form. 27/1077 useless extension candidates. Maximal degree in co-relation 3958. Up to 341 conditions per place. [2022-11-02 20:20:04,190 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 26 selfloop transitions, 10 changer transitions 19/158 dead transitions. [2022-11-02 20:20:04,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 158 transitions, 811 flow [2022-11-02 20:20:04,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:20:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:20:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1493 transitions. [2022-11-02 20:20:04,194 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8444570135746606 [2022-11-02 20:20:04,195 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1493 transitions. [2022-11-02 20:20:04,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1493 transitions. [2022-11-02 20:20:04,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:20:04,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1493 transitions. [2022-11-02 20:20:04,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.84615384615384) internal successors, (1493), 13 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:04,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:04,204 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:04,204 INFO L175 Difference]: Start difference. First operand has 160 places, 130 transitions, 454 flow. Second operand 13 states and 1493 transitions. [2022-11-02 20:20:04,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 158 transitions, 811 flow [2022-11-02 20:20:04,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 158 transitions, 761 flow, removed 20 selfloop flow, removed 6 redundant places. [2022-11-02 20:20:04,219 INFO L231 Difference]: Finished difference. Result has 168 places, 135 transitions, 513 flow [2022-11-02 20:20:04,219 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=513, PETRI_PLACES=168, PETRI_TRANSITIONS=135} [2022-11-02 20:20:04,220 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 25 predicate places. [2022-11-02 20:20:04,220 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 135 transitions, 513 flow [2022-11-02 20:20:04,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 112.63636363636364) internal successors, (1239), 11 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:04,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:20:04,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:04,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:20:04,222 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:20:04,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:04,222 INFO L85 PathProgramCache]: Analyzing trace with hash -636176886, now seen corresponding path program 2 times [2022-11-02 20:20:04,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:04,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245551891] [2022-11-02 20:20:04,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:04,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:04,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:04,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245551891] [2022-11-02 20:20:04,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245551891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:04,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:04,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:20:04,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830731307] [2022-11-02 20:20:04,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:04,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:04,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:04,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:04,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:04,945 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-11-02 20:20:04,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 135 transitions, 513 flow. Second operand has 9 states, 9 states have (on average 113.88888888888889) internal successors, (1025), 9 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:04,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:20:04,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-11-02 20:20:04,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:20:05,514 INFO L130 PetriNetUnfolder]: 374/1179 cut-off events. [2022-11-02 20:20:05,514 INFO L131 PetriNetUnfolder]: For 9344/9748 co-relation queries the response was YES. [2022-11-02 20:20:05,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4893 conditions, 1179 events. 374/1179 cut-off events. For 9344/9748 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8183 event pairs, 71 based on Foata normal form. 39/1163 useless extension candidates. Maximal degree in co-relation 4801. Up to 348 conditions per place. [2022-11-02 20:20:05,563 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 29 selfloop transitions, 10 changer transitions 10/153 dead transitions. [2022-11-02 20:20:05,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 153 transitions, 823 flow [2022-11-02 20:20:05,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:20:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:20:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1048 transitions. [2022-11-02 20:20:05,566 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8562091503267973 [2022-11-02 20:20:05,566 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1048 transitions. [2022-11-02 20:20:05,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1048 transitions. [2022-11-02 20:20:05,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:20:05,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1048 transitions. [2022-11-02 20:20:05,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.44444444444444) internal successors, (1048), 9 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:05,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:05,572 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:05,572 INFO L175 Difference]: Start difference. First operand has 168 places, 135 transitions, 513 flow. Second operand 9 states and 1048 transitions. [2022-11-02 20:20:05,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 153 transitions, 823 flow [2022-11-02 20:20:05,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 153 transitions, 698 flow, removed 61 selfloop flow, removed 11 redundant places. [2022-11-02 20:20:05,593 INFO L231 Difference]: Finished difference. Result has 163 places, 138 transitions, 529 flow [2022-11-02 20:20:05,594 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=529, PETRI_PLACES=163, PETRI_TRANSITIONS=138} [2022-11-02 20:20:05,596 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 20 predicate places. [2022-11-02 20:20:05,596 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 138 transitions, 529 flow [2022-11-02 20:20:05,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.88888888888889) internal successors, (1025), 9 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:05,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:20:05,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:05,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:20:05,598 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:20:05,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:05,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1361029464, now seen corresponding path program 3 times [2022-11-02 20:20:05,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:05,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340741763] [2022-11-02 20:20:05,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:05,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:06,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:06,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340741763] [2022-11-02 20:20:06,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340741763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:06,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:06,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:20:06,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867476924] [2022-11-02 20:20:06,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:06,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:06,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:06,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:06,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:06,458 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-02 20:20:06,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 138 transitions, 529 flow. Second operand has 10 states, 10 states have (on average 112.8) internal successors, (1128), 10 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:06,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:20:06,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-02 20:20:06,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:20:07,128 INFO L130 PetriNetUnfolder]: 336/1124 cut-off events. [2022-11-02 20:20:07,129 INFO L131 PetriNetUnfolder]: For 4868/5466 co-relation queries the response was YES. [2022-11-02 20:20:07,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4111 conditions, 1124 events. 336/1124 cut-off events. For 4868/5466 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7797 event pairs, 66 based on Foata normal form. 60/1133 useless extension candidates. Maximal degree in co-relation 4022. Up to 279 conditions per place. [2022-11-02 20:20:07,149 INFO L137 encePairwiseOnDemand]: 126/136 looper letters, 31 selfloop transitions, 11 changer transitions 19/164 dead transitions. [2022-11-02 20:20:07,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 164 transitions, 893 flow [2022-11-02 20:20:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:20:07,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-02 20:20:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1383 transitions. [2022-11-02 20:20:07,153 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8474264705882353 [2022-11-02 20:20:07,154 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1383 transitions. [2022-11-02 20:20:07,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1383 transitions. [2022-11-02 20:20:07,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:20:07,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1383 transitions. [2022-11-02 20:20:07,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 115.25) internal successors, (1383), 12 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:07,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:07,162 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:07,162 INFO L175 Difference]: Start difference. First operand has 163 places, 138 transitions, 529 flow. Second operand 12 states and 1383 transitions. [2022-11-02 20:20:07,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 164 transitions, 893 flow [2022-11-02 20:20:07,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 164 transitions, 847 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-11-02 20:20:07,176 INFO L231 Difference]: Finished difference. Result has 171 places, 140 transitions, 577 flow [2022-11-02 20:20:07,177 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=577, PETRI_PLACES=171, PETRI_TRANSITIONS=140} [2022-11-02 20:20:07,177 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 28 predicate places. [2022-11-02 20:20:07,178 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 140 transitions, 577 flow [2022-11-02 20:20:07,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 112.8) internal successors, (1128), 10 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:07,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:20:07,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:07,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:20:07,179 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:20:07,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:07,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1703482013, now seen corresponding path program 1 times [2022-11-02 20:20:07,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:07,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709714776] [2022-11-02 20:20:07,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:07,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:08,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:08,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709714776] [2022-11-02 20:20:08,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709714776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:08,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:08,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:20:08,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264945453] [2022-11-02 20:20:08,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:08,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:20:08,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:08,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:20:08,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:20:08,284 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-11-02 20:20:08,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 140 transitions, 577 flow. Second operand has 13 states, 13 states have (on average 110.61538461538461) internal successors, (1438), 13 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:08,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:20:08,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-11-02 20:20:08,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:20:08,854 INFO L130 PetriNetUnfolder]: 272/987 cut-off events. [2022-11-02 20:20:08,854 INFO L131 PetriNetUnfolder]: For 7391/7979 co-relation queries the response was YES. [2022-11-02 20:20:08,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4059 conditions, 987 events. 272/987 cut-off events. For 7391/7979 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6610 event pairs, 67 based on Foata normal form. 32/967 useless extension candidates. Maximal degree in co-relation 3965. Up to 350 conditions per place. [2022-11-02 20:20:08,877 INFO L137 encePairwiseOnDemand]: 123/136 looper letters, 34 selfloop transitions, 15 changer transitions 7/157 dead transitions. [2022-11-02 20:20:08,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 157 transitions, 890 flow [2022-11-02 20:20:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:20:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-02 20:20:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1348 transitions. [2022-11-02 20:20:08,884 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8259803921568627 [2022-11-02 20:20:08,884 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1348 transitions. [2022-11-02 20:20:08,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1348 transitions. [2022-11-02 20:20:08,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:20:08,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1348 transitions. [2022-11-02 20:20:08,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 112.33333333333333) internal successors, (1348), 12 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:08,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:08,895 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:08,895 INFO L175 Difference]: Start difference. First operand has 171 places, 140 transitions, 577 flow. Second operand 12 states and 1348 transitions. [2022-11-02 20:20:08,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 157 transitions, 890 flow [2022-11-02 20:20:08,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 157 transitions, 853 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-11-02 20:20:08,911 INFO L231 Difference]: Finished difference. Result has 174 places, 146 transitions, 665 flow [2022-11-02 20:20:08,912 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=665, PETRI_PLACES=174, PETRI_TRANSITIONS=146} [2022-11-02 20:20:08,913 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 31 predicate places. [2022-11-02 20:20:08,913 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 146 transitions, 665 flow [2022-11-02 20:20:08,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 110.61538461538461) internal successors, (1438), 13 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:08,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:20:08,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:08,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:20:08,915 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:20:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:08,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1566478717, now seen corresponding path program 2 times [2022-11-02 20:20:08,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:08,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402787817] [2022-11-02 20:20:08,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:08,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:10,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:10,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402787817] [2022-11-02 20:20:10,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402787817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:10,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:10,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:20:10,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044559509] [2022-11-02 20:20:10,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:10,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:20:10,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:10,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:20:10,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:20:10,167 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-02 20:20:10,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 146 transitions, 665 flow. Second operand has 12 states, 12 states have (on average 112.58333333333333) internal successors, (1351), 12 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:10,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:20:10,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-02 20:20:10,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:20:10,747 INFO L130 PetriNetUnfolder]: 250/1041 cut-off events. [2022-11-02 20:20:10,748 INFO L131 PetriNetUnfolder]: For 6791/7352 co-relation queries the response was YES. [2022-11-02 20:20:10,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4063 conditions, 1041 events. 250/1041 cut-off events. For 6791/7352 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7308 event pairs, 60 based on Foata normal form. 65/1055 useless extension candidates. Maximal degree in co-relation 3966. Up to 196 conditions per place. [2022-11-02 20:20:10,772 INFO L137 encePairwiseOnDemand]: 126/136 looper letters, 37 selfloop transitions, 13 changer transitions 10/163 dead transitions. [2022-11-02 20:20:10,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 163 transitions, 986 flow [2022-11-02 20:20:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:20:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:20:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1484 transitions. [2022-11-02 20:20:10,781 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8393665158371041 [2022-11-02 20:20:10,781 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1484 transitions. [2022-11-02 20:20:10,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1484 transitions. [2022-11-02 20:20:10,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:20:10,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1484 transitions. [2022-11-02 20:20:10,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.15384615384616) internal successors, (1484), 13 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:10,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:10,795 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:10,795 INFO L175 Difference]: Start difference. First operand has 174 places, 146 transitions, 665 flow. Second operand 13 states and 1484 transitions. [2022-11-02 20:20:10,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 163 transitions, 986 flow [2022-11-02 20:20:10,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 163 transitions, 892 flow, removed 39 selfloop flow, removed 8 redundant places. [2022-11-02 20:20:10,845 INFO L231 Difference]: Finished difference. Result has 182 places, 146 transitions, 647 flow [2022-11-02 20:20:10,846 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=647, PETRI_PLACES=182, PETRI_TRANSITIONS=146} [2022-11-02 20:20:10,846 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 39 predicate places. [2022-11-02 20:20:10,846 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 146 transitions, 647 flow [2022-11-02 20:20:10,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 112.58333333333333) internal successors, (1351), 12 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:10,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:20:10,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:10,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:20:10,848 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:20:10,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2026941571, now seen corresponding path program 1 times [2022-11-02 20:20:10,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:10,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789744483] [2022-11-02 20:20:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:10,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:11,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:11,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789744483] [2022-11-02 20:20:11,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789744483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:11,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:11,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:20:11,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406801825] [2022-11-02 20:20:11,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:11,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:20:11,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:11,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:20:11,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:20:11,104 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-02 20:20:11,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 146 transitions, 647 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:11,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:20:11,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-02 20:20:11,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:20:14,242 INFO L130 PetriNetUnfolder]: 6948/12781 cut-off events. [2022-11-02 20:20:14,242 INFO L131 PetriNetUnfolder]: For 61009/62416 co-relation queries the response was YES. [2022-11-02 20:20:14,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40566 conditions, 12781 events. 6948/12781 cut-off events. For 61009/62416 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 111815 event pairs, 318 based on Foata normal form. 1046/13136 useless extension candidates. Maximal degree in co-relation 40469. Up to 4743 conditions per place. [2022-11-02 20:20:14,425 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 167 selfloop transitions, 20 changer transitions 0/291 dead transitions. [2022-11-02 20:20:14,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 291 transitions, 2143 flow [2022-11-02 20:20:14,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:20:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:20:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1194 transitions. [2022-11-02 20:20:14,433 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8779411764705882 [2022-11-02 20:20:14,433 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1194 transitions. [2022-11-02 20:20:14,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1194 transitions. [2022-11-02 20:20:14,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:20:14,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1194 transitions. [2022-11-02 20:20:14,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.4) internal successors, (1194), 10 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:14,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:14,444 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:14,444 INFO L175 Difference]: Start difference. First operand has 182 places, 146 transitions, 647 flow. Second operand 10 states and 1194 transitions. [2022-11-02 20:20:14,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 291 transitions, 2143 flow [2022-11-02 20:20:14,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 291 transitions, 1964 flow, removed 67 selfloop flow, removed 11 redundant places. [2022-11-02 20:20:14,599 INFO L231 Difference]: Finished difference. Result has 180 places, 164 transitions, 737 flow [2022-11-02 20:20:14,600 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=737, PETRI_PLACES=180, PETRI_TRANSITIONS=164} [2022-11-02 20:20:14,601 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 37 predicate places. [2022-11-02 20:20:14,601 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 164 transitions, 737 flow [2022-11-02 20:20:14,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:14,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:20:14,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:14,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:20:14,602 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:20:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:14,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2086799603, now seen corresponding path program 1 times [2022-11-02 20:20:14,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:14,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11817685] [2022-11-02 20:20:14,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:14,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:14,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:14,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11817685] [2022-11-02 20:20:14,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11817685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:14,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:14,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:14,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549785622] [2022-11-02 20:20:14,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:14,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:20:14,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:14,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:20:14,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:20:14,949 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-02 20:20:14,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 164 transitions, 737 flow. Second operand has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:14,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:20:14,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-02 20:20:14,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:20:18,278 INFO L130 PetriNetUnfolder]: 6739/13039 cut-off events. [2022-11-02 20:20:18,278 INFO L131 PetriNetUnfolder]: For 56680/58086 co-relation queries the response was YES. [2022-11-02 20:20:18,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52320 conditions, 13039 events. 6739/13039 cut-off events. For 56680/58086 co-relation queries the response was YES. Maximal size of possible extension queue 1069. Compared 122213 event pairs, 167 based on Foata normal form. 1336/13994 useless extension candidates. Maximal degree in co-relation 52225. Up to 4306 conditions per place. [2022-11-02 20:20:18,426 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 185 selfloop transitions, 38 changer transitions 23/350 dead transitions. [2022-11-02 20:20:18,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 350 transitions, 2733 flow [2022-11-02 20:20:18,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:20:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:20:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1555 transitions. [2022-11-02 20:20:18,430 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.879524886877828 [2022-11-02 20:20:18,430 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1555 transitions. [2022-11-02 20:20:18,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1555 transitions. [2022-11-02 20:20:18,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:20:18,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1555 transitions. [2022-11-02 20:20:18,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.61538461538461) internal successors, (1555), 13 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:18,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:18,439 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:18,439 INFO L175 Difference]: Start difference. First operand has 180 places, 164 transitions, 737 flow. Second operand 13 states and 1555 transitions. [2022-11-02 20:20:18,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 350 transitions, 2733 flow [2022-11-02 20:20:18,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 350 transitions, 2731 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:20:18,584 INFO L231 Difference]: Finished difference. Result has 197 places, 183 transitions, 1022 flow [2022-11-02 20:20:18,585 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1022, PETRI_PLACES=197, PETRI_TRANSITIONS=183} [2022-11-02 20:20:18,585 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 54 predicate places. [2022-11-02 20:20:18,585 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 183 transitions, 1022 flow [2022-11-02 20:20:18,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:18,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:20:18,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:18,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:20:18,587 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:20:18,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:18,587 INFO L85 PathProgramCache]: Analyzing trace with hash -784019810, now seen corresponding path program 1 times [2022-11-02 20:20:18,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:18,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133127253] [2022-11-02 20:20:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:18,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:19,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:19,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133127253] [2022-11-02 20:20:19,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133127253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:19,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:19,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:19,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087562253] [2022-11-02 20:20:19,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:19,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:20:19,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:19,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:20:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:20:19,189 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 136 [2022-11-02 20:20:19,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 183 transitions, 1022 flow. Second operand has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:19,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:20:19,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 136 [2022-11-02 20:20:19,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:20:21,273 INFO L130 PetriNetUnfolder]: 2731/9331 cut-off events. [2022-11-02 20:20:21,273 INFO L131 PetriNetUnfolder]: For 39604/52340 co-relation queries the response was YES. [2022-11-02 20:20:21,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36376 conditions, 9331 events. 2731/9331 cut-off events. For 39604/52340 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 116815 event pairs, 251 based on Foata normal form. 273/8781 useless extension candidates. Maximal degree in co-relation 36272. Up to 2965 conditions per place. [2022-11-02 20:20:21,410 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 55 selfloop transitions, 1 changer transitions 38/239 dead transitions. [2022-11-02 20:20:21,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 239 transitions, 1676 flow [2022-11-02 20:20:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:20:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:20:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 833 transitions. [2022-11-02 20:20:21,413 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.875 [2022-11-02 20:20:21,413 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 833 transitions. [2022-11-02 20:20:21,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 833 transitions. [2022-11-02 20:20:21,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:20:21,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 833 transitions. [2022-11-02 20:20:21,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:21,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:21,420 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:21,420 INFO L175 Difference]: Start difference. First operand has 197 places, 183 transitions, 1022 flow. Second operand 7 states and 833 transitions. [2022-11-02 20:20:21,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 239 transitions, 1676 flow [2022-11-02 20:20:22,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 239 transitions, 1581 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-11-02 20:20:22,198 INFO L231 Difference]: Finished difference. Result has 204 places, 182 transitions, 933 flow [2022-11-02 20:20:22,199 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=933, PETRI_PLACES=204, PETRI_TRANSITIONS=182} [2022-11-02 20:20:22,199 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 61 predicate places. [2022-11-02 20:20:22,199 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 182 transitions, 933 flow [2022-11-02 20:20:22,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:22,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:20:22,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:22,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:20:22,201 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:20:22,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:22,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1992302444, now seen corresponding path program 2 times [2022-11-02 20:20:22,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:22,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283618230] [2022-11-02 20:20:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:22,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:22,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283618230] [2022-11-02 20:20:22,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283618230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:22,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:22,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:20:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124629486] [2022-11-02 20:20:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:22,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:20:22,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:22,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:20:22,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:20:22,508 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2022-11-02 20:20:22,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 182 transitions, 933 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:22,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:20:22,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2022-11-02 20:20:22,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:20:24,738 INFO L130 PetriNetUnfolder]: 2930/10444 cut-off events. [2022-11-02 20:20:24,739 INFO L131 PetriNetUnfolder]: For 36147/39207 co-relation queries the response was YES. [2022-11-02 20:20:24,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34823 conditions, 10444 events. 2930/10444 cut-off events. For 36147/39207 co-relation queries the response was YES. Maximal size of possible extension queue 1171. Compared 134892 event pairs, 245 based on Foata normal form. 229/9894 useless extension candidates. Maximal degree in co-relation 34716. Up to 2225 conditions per place. [2022-11-02 20:20:24,887 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 72 selfloop transitions, 11 changer transitions 7/234 dead transitions. [2022-11-02 20:20:24,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 234 transitions, 1566 flow [2022-11-02 20:20:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:20:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:20:24,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1073 transitions. [2022-11-02 20:20:24,890 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8766339869281046 [2022-11-02 20:20:24,890 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1073 transitions. [2022-11-02 20:20:24,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1073 transitions. [2022-11-02 20:20:24,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:20:24,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1073 transitions. [2022-11-02 20:20:24,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.22222222222223) internal successors, (1073), 9 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:24,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:24,895 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:24,896 INFO L175 Difference]: Start difference. First operand has 204 places, 182 transitions, 933 flow. Second operand 9 states and 1073 transitions. [2022-11-02 20:20:24,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 234 transitions, 1566 flow [2022-11-02 20:20:25,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 234 transitions, 1533 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-11-02 20:20:25,413 INFO L231 Difference]: Finished difference. Result has 210 places, 189 transitions, 1046 flow [2022-11-02 20:20:25,414 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1046, PETRI_PLACES=210, PETRI_TRANSITIONS=189} [2022-11-02 20:20:25,414 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 67 predicate places. [2022-11-02 20:20:25,414 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 189 transitions, 1046 flow [2022-11-02 20:20:25,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:25,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:20:25,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:25,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:20:25,415 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:20:25,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:25,416 INFO L85 PathProgramCache]: Analyzing trace with hash 409564936, now seen corresponding path program 1 times [2022-11-02 20:20:25,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:25,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409175469] [2022-11-02 20:20:25,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:25,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:25,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:25,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409175469] [2022-11-02 20:20:25,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409175469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:25,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:25,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:25,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932795832] [2022-11-02 20:20:25,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:25,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:20:25,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:25,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:20:25,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:20:25,727 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-02 20:20:25,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 189 transitions, 1046 flow. Second operand has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:25,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:20:25,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-02 20:20:25,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:20:30,690 INFO L130 PetriNetUnfolder]: 10778/21162 cut-off events. [2022-11-02 20:20:30,690 INFO L131 PetriNetUnfolder]: For 131452/140363 co-relation queries the response was YES. [2022-11-02 20:20:31,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94481 conditions, 21162 events. 10778/21162 cut-off events. For 131452/140363 co-relation queries the response was YES. Maximal size of possible extension queue 1968. Compared 221229 event pairs, 45 based on Foata normal form. 2930/23164 useless extension candidates. Maximal degree in co-relation 94371. Up to 5196 conditions per place. [2022-11-02 20:20:31,138 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 77 selfloop transitions, 27 changer transitions 173/381 dead transitions. [2022-11-02 20:20:31,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 381 transitions, 3348 flow [2022-11-02 20:20:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:20:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:20:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1915 transitions. [2022-11-02 20:20:31,144 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8800551470588235 [2022-11-02 20:20:31,144 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1915 transitions. [2022-11-02 20:20:31,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1915 transitions. [2022-11-02 20:20:31,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:20:31,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1915 transitions. [2022-11-02 20:20:31,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 119.6875) internal successors, (1915), 16 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:31,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:31,156 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:31,157 INFO L175 Difference]: Start difference. First operand has 210 places, 189 transitions, 1046 flow. Second operand 16 states and 1915 transitions. [2022-11-02 20:20:31,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 381 transitions, 3348 flow [2022-11-02 20:20:32,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 381 transitions, 3263 flow, removed 36 selfloop flow, removed 2 redundant places. [2022-11-02 20:20:32,629 INFO L231 Difference]: Finished difference. Result has 230 places, 165 transitions, 962 flow [2022-11-02 20:20:32,629 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=962, PETRI_PLACES=230, PETRI_TRANSITIONS=165} [2022-11-02 20:20:32,630 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 87 predicate places. [2022-11-02 20:20:32,630 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 165 transitions, 962 flow [2022-11-02 20:20:32,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:32,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:20:32,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:32,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:20:32,634 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:20:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1035210571, now seen corresponding path program 1 times [2022-11-02 20:20:32,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:32,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367554205] [2022-11-02 20:20:32,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:32,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:33,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:33,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:33,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367554205] [2022-11-02 20:20:33,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367554205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:33,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:33,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:20:33,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368691701] [2022-11-02 20:20:33,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:33,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:33,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:33,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:33,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:33,061 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-02 20:20:33,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 165 transitions, 962 flow. Second operand has 9 states, 9 states have (on average 113.11111111111111) internal successors, (1018), 9 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:33,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:20:33,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-02 20:20:33,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:20:35,912 INFO L130 PetriNetUnfolder]: 4636/11324 cut-off events. [2022-11-02 20:20:35,912 INFO L131 PetriNetUnfolder]: For 82853/87056 co-relation queries the response was YES. [2022-11-02 20:20:35,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51758 conditions, 11324 events. 4636/11324 cut-off events. For 82853/87056 co-relation queries the response was YES. Maximal size of possible extension queue 1164. Compared 127568 event pairs, 104 based on Foata normal form. 1162/12018 useless extension candidates. Maximal degree in co-relation 51699. Up to 2088 conditions per place. [2022-11-02 20:20:36,002 INFO L137 encePairwiseOnDemand]: 126/136 looper letters, 25 selfloop transitions, 19 changer transitions 151/288 dead transitions. [2022-11-02 20:20:36,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 288 transitions, 2436 flow [2022-11-02 20:20:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:20:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:20:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1875 transitions. [2022-11-02 20:20:36,006 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8616727941176471 [2022-11-02 20:20:36,006 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1875 transitions. [2022-11-02 20:20:36,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1875 transitions. [2022-11-02 20:20:36,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:20:36,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1875 transitions. [2022-11-02 20:20:36,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 117.1875) internal successors, (1875), 16 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:36,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:36,015 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:36,015 INFO L175 Difference]: Start difference. First operand has 230 places, 165 transitions, 962 flow. Second operand 16 states and 1875 transitions. [2022-11-02 20:20:36,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 288 transitions, 2436 flow [2022-11-02 20:20:36,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 288 transitions, 2056 flow, removed 141 selfloop flow, removed 32 redundant places. [2022-11-02 20:20:36,968 INFO L231 Difference]: Finished difference. Result has 204 places, 127 transitions, 550 flow [2022-11-02 20:20:36,969 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=550, PETRI_PLACES=204, PETRI_TRANSITIONS=127} [2022-11-02 20:20:36,969 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 61 predicate places. [2022-11-02 20:20:36,969 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 127 transitions, 550 flow [2022-11-02 20:20:36,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.11111111111111) internal successors, (1018), 9 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:36,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:20:36,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:36,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:20:36,970 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:20:36,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:36,971 INFO L85 PathProgramCache]: Analyzing trace with hash -404290325, now seen corresponding path program 1 times [2022-11-02 20:20:36,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:36,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684549116] [2022-11-02 20:20:36,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:36,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:20:37,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:20:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:20:37,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:20:37,138 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:20:37,139 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-02 20:20:37,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-02 20:20:37,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-02 20:20:37,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-02 20:20:37,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-02 20:20:37,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-02 20:20:37,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-02 20:20:37,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:20:37,144 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:37,151 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:20:37,151 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:20:37,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:20:37 BasicIcfg [2022-11-02 20:20:37,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:20:37,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:20:37,337 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:20:37,337 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:20:37,337 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:19:54" (3/4) ... [2022-11-02 20:20:37,339 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:20:37,533 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:20:37,533 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:20:37,534 INFO L158 Benchmark]: Toolchain (without parser) took 45232.35ms. Allocated memory was 111.1MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 67.4MB in the beginning and 8.2GB in the end (delta: -8.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2022-11-02 20:20:37,534 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 111.1MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:20:37,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 737.55ms. Allocated memory is still 111.1MB. Free memory was 67.2MB in the beginning and 72.2MB in the end (delta: -5.0MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2022-11-02 20:20:37,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.97ms. Allocated memory is still 111.1MB. Free memory was 72.2MB in the beginning and 69.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:20:37,535 INFO L158 Benchmark]: Boogie Preprocessor took 34.22ms. Allocated memory is still 111.1MB. Free memory was 69.2MB in the beginning and 66.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:20:37,536 INFO L158 Benchmark]: RCFGBuilder took 1481.88ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 66.6MB in the beginning and 74.6MB in the end (delta: -8.0MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2022-11-02 20:20:37,536 INFO L158 Benchmark]: TraceAbstraction took 42719.72ms. Allocated memory was 134.2MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 74.6MB in the beginning and 8.3GB in the end (delta: -8.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2022-11-02 20:20:37,537 INFO L158 Benchmark]: Witness Printer took 197.02ms. Allocated memory is still 9.6GB. Free memory was 8.3GB in the beginning and 8.2GB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-02 20:20:37,539 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 111.1MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 737.55ms. Allocated memory is still 111.1MB. Free memory was 67.2MB in the beginning and 72.2MB in the end (delta: -5.0MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.97ms. Allocated memory is still 111.1MB. Free memory was 72.2MB in the beginning and 69.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.22ms. Allocated memory is still 111.1MB. Free memory was 69.2MB in the beginning and 66.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1481.88ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 66.6MB in the beginning and 74.6MB in the end (delta: -8.0MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * TraceAbstraction took 42719.72ms. Allocated memory was 134.2MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 74.6MB in the beginning and 8.3GB in the end (delta: -8.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 197.02ms. Allocated memory is still 9.6GB. Free memory was 8.3GB in the beginning and 8.2GB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L718] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L728] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L729] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L730] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L731] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L732] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L733] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L740] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L741] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L742] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L743] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L744] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 pthread_t t1253; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1253, ((void *)0), P0, ((void *)0))=-3, t1253={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1254; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1254, ((void *)0), P1, ((void *)0))=-2, t1253={5:0}, t1254={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1255; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1255, ((void *)0), P2, ((void *)0))=-1, t1253={5:0}, t1254={6:0}, t1255={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1256; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1256, ((void *)0), P3, ((void *)0))=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 42.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 30.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 913 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 913 mSDsluCounter, 773 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1343 mSDsCounter, 276 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2199 IncrementalHoareTripleChecker+Invalid, 2475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 276 mSolverCounterUnsat, 155 mSDtfsCounter, 2199 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1046occurred in iteration=15, InterpolantAutomatonStates: 191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 1683 NumberOfCodeBlocks, 1683 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1561 ConstructedInterpolants, 0 QuantifiedInterpolants, 7596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-02 20:20:37,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7876002-eaed-4c46-855f-0c8aa86224e5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE