./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe004_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe004_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 17:55:31,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:55:31,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:55:31,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:55:31,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:55:31,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:55:31,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:55:31,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:55:31,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:55:31,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:55:31,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:55:31,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:55:31,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:55:31,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:55:31,421 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:55:31,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:55:31,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:55:31,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:55:31,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:55:31,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:55:31,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:55:31,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:55:31,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:55:31,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:55:31,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:55:31,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:55:31,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:55:31,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:55:31,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:55:31,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:55:31,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:55:31,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:55:31,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:55:31,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:55:31,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:55:31,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:55:31,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:55:31,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:55:31,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:55:31,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:55:31,427 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:55:31,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:55:31,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:55:31,428 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 17:55:31,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:55:31,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:55:31,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:55:31,656 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:55:31,656 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:55:31,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-06-04 17:55:32,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:55:33,019 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:55:33,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-06-04 17:55:33,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a3ee17b1/20b359f1111e4bf8b8422bf1c7d99e7d/FLAG7d9992166 [2024-06-04 17:55:33,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a3ee17b1/20b359f1111e4bf8b8422bf1c7d99e7d [2024-06-04 17:55:33,047 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:55:33,047 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:55:33,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/safe004_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-04 17:55:33,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:55:33,168 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:55:33,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:55:33,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:55:33,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:55:33,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:55:33" (1/2) ... [2024-06-04 17:55:33,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd3f16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:55:33, skipping insertion in model container [2024-06-04 17:55:33,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:55:33" (1/2) ... [2024-06-04 17:55:33,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@30f92572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:55:33, skipping insertion in model container [2024-06-04 17:55:33,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:55:33" (2/2) ... [2024-06-04 17:55:33,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd3f16f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33, skipping insertion in model container [2024-06-04 17:55:33,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:55:33" (2/2) ... [2024-06-04 17:55:33,176 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:55:33,236 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:55:33,238 INFO L97 edCorrectnessWitness]: Location invariant before [L850-L850] (((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2))) [2024-06-04 17:55:33,238 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] (((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2))) [2024-06-04 17:55:33,239 INFO L97 edCorrectnessWitness]: Location invariant before [L847-L847] (((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2))) [2024-06-04 17:55:33,239 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:55:33,239 INFO L106 edCorrectnessWitness]: ghost_update [L845-L845] multithreaded = 1; [2024-06-04 17:55:33,277 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:55:33,575 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:55:33,591 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:55:33,855 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:55:33,889 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:55:33,889 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33 WrapperNode [2024-06-04 17:55:33,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:55:33,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:55:33,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:55:33,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:55:33,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33" (1/1) ... [2024-06-04 17:55:33,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33" (1/1) ... [2024-06-04 17:55:34,039 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143 [2024-06-04 17:55:34,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:55:34,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:55:34,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:55:34,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:55:34,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33" (1/1) ... [2024-06-04 17:55:34,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33" (1/1) ... [2024-06-04 17:55:34,071 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33" (1/1) ... [2024-06-04 17:55:34,108 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 17:55:34,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33" (1/1) ... [2024-06-04 17:55:34,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33" (1/1) ... [2024-06-04 17:55:34,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33" (1/1) ... [2024-06-04 17:55:34,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33" (1/1) ... [2024-06-04 17:55:34,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33" (1/1) ... [2024-06-04 17:55:34,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33" (1/1) ... [2024-06-04 17:55:34,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:55:34,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:55:34,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:55:34,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:55:34,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33" (1/1) ... [2024-06-04 17:55:34,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:55:34,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:55:34,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 17:55:34,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 17:55:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:55:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:55:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:55:34,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:55:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:55:34,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:55:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 17:55:34,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 17:55:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:55:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:55:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:55:34,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:55:34,339 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 17:55:34,480 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:55:34,482 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:55:35,358 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:55:35,359 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:55:35,638 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:55:35,638 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:55:35,639 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:55:35 BoogieIcfgContainer [2024-06-04 17:55:35,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:55:35,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:55:35,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:55:35,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:55:35,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:55:33" (1/4) ... [2024-06-04 17:55:35,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6330e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:55:35, skipping insertion in model container [2024-06-04 17:55:35,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:55:33" (2/4) ... [2024-06-04 17:55:35,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6330e14 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:55:35, skipping insertion in model container [2024-06-04 17:55:35,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:33" (3/4) ... [2024-06-04 17:55:35,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6330e14 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:55:35, skipping insertion in model container [2024-06-04 17:55:35,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:55:35" (4/4) ... [2024-06-04 17:55:35,646 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-06-04 17:55:35,660 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:55:35,660 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 17:55:35,660 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:55:35,766 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:55:35,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 17:55:35,834 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-04 17:55:35,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:55:35,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 17:55:35,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 17:55:35,881 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-04 17:55:35,890 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:55:35,909 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1916655e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:55:35,910 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 17:55:35,917 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:55:35,917 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 17:55:35,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:55:35,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:35,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:55:35,926 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:55:35,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:35,945 INFO L85 PathProgramCache]: Analyzing trace with hash 768558868, now seen corresponding path program 1 times [2024-06-04 17:55:35,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:35,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359766284] [2024-06-04 17:55:35,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:35,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:40,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:40,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359766284] [2024-06-04 17:55:40,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359766284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:40,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:40,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:55:40,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193304272] [2024-06-04 17:55:40,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:40,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:55:40,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:40,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:55:40,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:55:40,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:55:40,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2024-06-04 17:55:40,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:40,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:55:40,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:41,317 INFO L124 PetriNetUnfolderBase]: 1650/2466 cut-off events. [2024-06-04 17:55:41,317 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-06-04 17:55:41,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5020 conditions, 2466 events. 1650/2466 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11597 event pairs, 881 based on Foata normal form. 4/2429 useless extension candidates. Maximal degree in co-relation 5005. Up to 2444 conditions per place. [2024-06-04 17:55:41,335 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 38 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-04 17:55:41,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 189 flow [2024-06-04 17:55:41,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:55:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:55:41,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-06-04 17:55:41,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2024-06-04 17:55:41,345 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 69 transitions. [2024-06-04 17:55:41,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 189 flow [2024-06-04 17:55:41,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 17:55:41,353 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-04 17:55:41,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-04 17:55:41,357 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-04 17:55:41,357 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-04 17:55:41,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2024-06-04 17:55:41,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:41,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:41,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:55:41,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:55:41,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash -149255181, now seen corresponding path program 1 times [2024-06-04 17:55:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:41,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574656342] [2024-06-04 17:55:41,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:41,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:44,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:44,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574656342] [2024-06-04 17:55:44,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574656342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:44,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:44,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:55:44,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843870575] [2024-06-04 17:55:44,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:44,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:55:44,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:44,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:55:44,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:55:44,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:55:44,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2024-06-04 17:55:44,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:44,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:55:44,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:45,449 INFO L124 PetriNetUnfolderBase]: 1659/2478 cut-off events. [2024-06-04 17:55:45,450 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2024-06-04 17:55:45,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5690 conditions, 2478 events. 1659/2478 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11335 event pairs, 955 based on Foata normal form. 6/2483 useless extension candidates. Maximal degree in co-relation 5675. Up to 2441 conditions per place. [2024-06-04 17:55:45,460 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 48 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2024-06-04 17:55:45,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 274 flow [2024-06-04 17:55:45,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:55:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:55:45,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-06-04 17:55:45,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304878048780488 [2024-06-04 17:55:45,464 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 87 transitions. [2024-06-04 17:55:45,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 274 flow [2024-06-04 17:55:45,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:55:45,468 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 156 flow [2024-06-04 17:55:45,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-06-04 17:55:45,469 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2024-06-04 17:55:45,469 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 156 flow [2024-06-04 17:55:45,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2024-06-04 17:55:45,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:45,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:45,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:55:45,472 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:55:45,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:45,479 INFO L85 PathProgramCache]: Analyzing trace with hash -331941767, now seen corresponding path program 1 times [2024-06-04 17:55:45,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:45,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873904807] [2024-06-04 17:55:45,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:48,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:48,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873904807] [2024-06-04 17:55:48,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873904807] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:48,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:48,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:55:48,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552718820] [2024-06-04 17:55:48,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:48,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:55:48,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:48,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:55:48,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:55:48,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:55:48,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) [2024-06-04 17:55:48,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:48,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:55:48,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:49,272 INFO L124 PetriNetUnfolderBase]: 1751/2608 cut-off events. [2024-06-04 17:55:49,273 INFO L125 PetriNetUnfolderBase]: For 1276/1276 co-relation queries the response was YES. [2024-06-04 17:55:49,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6762 conditions, 2608 events. 1751/2608 cut-off events. For 1276/1276 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12092 event pairs, 770 based on Foata normal form. 11/2618 useless extension candidates. Maximal degree in co-relation 6744. Up to 2426 conditions per place. [2024-06-04 17:55:49,282 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 64 selfloop transitions, 16 changer transitions 0/83 dead transitions. [2024-06-04 17:55:49,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 83 transitions, 450 flow [2024-06-04 17:55:49,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:55:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:55:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-04 17:55:49,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5658536585365853 [2024-06-04 17:55:49,284 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 156 flow. Second operand 5 states and 116 transitions. [2024-06-04 17:55:49,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 83 transitions, 450 flow [2024-06-04 17:55:49,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 83 transitions, 440 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-04 17:55:49,287 INFO L231 Difference]: Finished difference. Result has 52 places, 52 transitions, 259 flow [2024-06-04 17:55:49,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=52, PETRI_TRANSITIONS=52} [2024-06-04 17:55:49,288 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2024-06-04 17:55:49,288 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 259 flow [2024-06-04 17:55:49,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) [2024-06-04 17:55:49,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:49,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:49,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:55:49,288 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:55:49,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1700258606, now seen corresponding path program 1 times [2024-06-04 17:55:49,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:49,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835819173] [2024-06-04 17:55:49,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:52,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:52,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835819173] [2024-06-04 17:55:52,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835819173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:52,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:52,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:55:52,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251349940] [2024-06-04 17:55:52,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:52,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:55:52,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:52,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:55:52,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:55:52,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:55:52,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) [2024-06-04 17:55:52,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:52,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:55:52,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:53,818 INFO L124 PetriNetUnfolderBase]: 1819/2709 cut-off events. [2024-06-04 17:55:53,818 INFO L125 PetriNetUnfolderBase]: For 3454/3454 co-relation queries the response was YES. [2024-06-04 17:55:53,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8344 conditions, 2709 events. 1819/2709 cut-off events. For 3454/3454 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12468 event pairs, 572 based on Foata normal form. 9/2716 useless extension candidates. Maximal degree in co-relation 8322. Up to 2426 conditions per place. [2024-06-04 17:55:53,832 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 85 selfloop transitions, 25 changer transitions 0/113 dead transitions. [2024-06-04 17:55:53,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 113 transitions, 723 flow [2024-06-04 17:55:53,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:55:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:55:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-06-04 17:55:53,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5650406504065041 [2024-06-04 17:55:53,838 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 259 flow. Second operand 6 states and 139 transitions. [2024-06-04 17:55:53,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 113 transitions, 723 flow [2024-06-04 17:55:53,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 113 transitions, 711 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-04 17:55:53,846 INFO L231 Difference]: Finished difference. Result has 61 places, 72 transitions, 465 flow [2024-06-04 17:55:53,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=61, PETRI_TRANSITIONS=72} [2024-06-04 17:55:53,847 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2024-06-04 17:55:53,847 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 72 transitions, 465 flow [2024-06-04 17:55:53,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) [2024-06-04 17:55:53,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:53,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:53,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:55:53,848 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:55:53,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:53,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1168407624, now seen corresponding path program 1 times [2024-06-04 17:55:53,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:53,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86768519] [2024-06-04 17:55:53,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:53,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:57,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:57,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86768519] [2024-06-04 17:55:57,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86768519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:57,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:57,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:55:57,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611048959] [2024-06-04 17:55:57,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:57,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:55:57,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:57,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:55:57,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:55:57,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:55:57,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 72 transitions, 465 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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) [2024-06-04 17:55:57,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:57,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:55:57,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:58,859 INFO L124 PetriNetUnfolderBase]: 1990/2972 cut-off events. [2024-06-04 17:55:58,860 INFO L125 PetriNetUnfolderBase]: For 6904/6906 co-relation queries the response was YES. [2024-06-04 17:55:58,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10773 conditions, 2972 events. 1990/2972 cut-off events. For 6904/6906 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13996 event pairs, 523 based on Foata normal form. 46/3017 useless extension candidates. Maximal degree in co-relation 10745. Up to 2548 conditions per place. [2024-06-04 17:55:58,877 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 94 selfloop transitions, 34 changer transitions 0/131 dead transitions. [2024-06-04 17:55:58,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 131 transitions, 955 flow [2024-06-04 17:55:58,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:55:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:55:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-06-04 17:55:58,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5574912891986062 [2024-06-04 17:55:58,879 INFO L175 Difference]: Start difference. First operand has 61 places, 72 transitions, 465 flow. Second operand 7 states and 160 transitions. [2024-06-04 17:55:58,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 131 transitions, 955 flow [2024-06-04 17:55:58,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 131 transitions, 923 flow, removed 16 selfloop flow, removed 0 redundant places. [2024-06-04 17:55:58,887 INFO L231 Difference]: Finished difference. Result has 68 places, 82 transitions, 612 flow [2024-06-04 17:55:58,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=612, PETRI_PLACES=68, PETRI_TRANSITIONS=82} [2024-06-04 17:55:58,888 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2024-06-04 17:55:58,888 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 82 transitions, 612 flow [2024-06-04 17:55:58,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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) [2024-06-04 17:55:58,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:58,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:58,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:55:58,889 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:55:58,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:58,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2123205461, now seen corresponding path program 1 times [2024-06-04 17:55:58,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:58,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671395227] [2024-06-04 17:55:58,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:58,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:05,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:05,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671395227] [2024-06-04 17:56:05,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671395227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:05,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:05,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:56:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639089133] [2024-06-04 17:56:05,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:05,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:56:05,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:56:05,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:56:05,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:56:05,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 82 transitions, 612 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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) [2024-06-04 17:56:05,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:05,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:56:05,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:06,795 INFO L124 PetriNetUnfolderBase]: 1976/2952 cut-off events. [2024-06-04 17:56:06,795 INFO L125 PetriNetUnfolderBase]: For 10214/10214 co-relation queries the response was YES. [2024-06-04 17:56:06,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12329 conditions, 2952 events. 1976/2952 cut-off events. For 10214/10214 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13794 event pairs, 706 based on Foata normal form. 5/2956 useless extension candidates. Maximal degree in co-relation 12297. Up to 2906 conditions per place. [2024-06-04 17:56:06,811 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 85 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2024-06-04 17:56:06,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 876 flow [2024-06-04 17:56:06,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:56:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:56:06,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2024-06-04 17:56:06,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292682926829268 [2024-06-04 17:56:06,813 INFO L175 Difference]: Start difference. First operand has 68 places, 82 transitions, 612 flow. Second operand 5 states and 88 transitions. [2024-06-04 17:56:06,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 876 flow [2024-06-04 17:56:06,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 827 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-04 17:56:06,823 INFO L231 Difference]: Finished difference. Result has 70 places, 85 transitions, 630 flow [2024-06-04 17:56:06,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=630, PETRI_PLACES=70, PETRI_TRANSITIONS=85} [2024-06-04 17:56:06,824 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2024-06-04 17:56:06,824 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 85 transitions, 630 flow [2024-06-04 17:56:06,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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) [2024-06-04 17:56:06,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:06,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:06,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:56:06,825 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:56:06,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:06,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1395089477, now seen corresponding path program 1 times [2024-06-04 17:56:06,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:06,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638330663] [2024-06-04 17:56:06,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:06,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:11,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:11,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638330663] [2024-06-04 17:56:11,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638330663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:11,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:11,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:56:11,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182338670] [2024-06-04 17:56:11,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:11,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:56:11,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:11,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:56:11,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:56:11,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:56:11,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 85 transitions, 630 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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) [2024-06-04 17:56:11,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:11,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:56:11,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:12,697 INFO L124 PetriNetUnfolderBase]: 1996/2980 cut-off events. [2024-06-04 17:56:12,698 INFO L125 PetriNetUnfolderBase]: For 11981/11981 co-relation queries the response was YES. [2024-06-04 17:56:12,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12879 conditions, 2980 events. 1996/2980 cut-off events. For 11981/11981 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13896 event pairs, 692 based on Foata normal form. 10/2989 useless extension candidates. Maximal degree in co-relation 12844. Up to 2894 conditions per place. [2024-06-04 17:56:12,713 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 88 selfloop transitions, 19 changer transitions 0/110 dead transitions. [2024-06-04 17:56:12,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 110 transitions, 934 flow [2024-06-04 17:56:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:56:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:56:12,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-04 17:56:12,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-04 17:56:12,715 INFO L175 Difference]: Start difference. First operand has 70 places, 85 transitions, 630 flow. Second operand 6 states and 106 transitions. [2024-06-04 17:56:12,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 110 transitions, 934 flow [2024-06-04 17:56:12,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 110 transitions, 907 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-04 17:56:12,723 INFO L231 Difference]: Finished difference. Result has 73 places, 89 transitions, 694 flow [2024-06-04 17:56:12,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=73, PETRI_TRANSITIONS=89} [2024-06-04 17:56:12,724 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2024-06-04 17:56:12,724 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 89 transitions, 694 flow [2024-06-04 17:56:12,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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) [2024-06-04 17:56:12,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:12,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:12,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:56:12,725 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:56:12,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash -497761048, now seen corresponding path program 1 times [2024-06-04 17:56:12,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:12,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873375769] [2024-06-04 17:56:12,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:12,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:17,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:17,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873375769] [2024-06-04 17:56:17,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873375769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:17,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:17,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:56:17,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011558734] [2024-06-04 17:56:17,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:17,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:56:17,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:17,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:56:17,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:56:17,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:56:17,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 89 transitions, 694 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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) [2024-06-04 17:56:17,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:17,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:56:17,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:18,504 INFO L124 PetriNetUnfolderBase]: 2008/2999 cut-off events. [2024-06-04 17:56:18,504 INFO L125 PetriNetUnfolderBase]: For 14055/14057 co-relation queries the response was YES. [2024-06-04 17:56:18,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13681 conditions, 2999 events. 2008/2999 cut-off events. For 14055/14057 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14075 event pairs, 668 based on Foata normal form. 12/3010 useless extension candidates. Maximal degree in co-relation 13645. Up to 2805 conditions per place. [2024-06-04 17:56:18,519 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 94 selfloop transitions, 23 changer transitions 0/120 dead transitions. [2024-06-04 17:56:18,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 120 transitions, 1081 flow [2024-06-04 17:56:18,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:56:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:56:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-06-04 17:56:18,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-04 17:56:18,537 INFO L175 Difference]: Start difference. First operand has 73 places, 89 transitions, 694 flow. Second operand 6 states and 111 transitions. [2024-06-04 17:56:18,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 120 transitions, 1081 flow [2024-06-04 17:56:18,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 120 transitions, 1024 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-04 17:56:18,550 INFO L231 Difference]: Finished difference. Result has 75 places, 93 transitions, 738 flow [2024-06-04 17:56:18,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=738, PETRI_PLACES=75, PETRI_TRANSITIONS=93} [2024-06-04 17:56:18,553 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2024-06-04 17:56:18,553 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 93 transitions, 738 flow [2024-06-04 17:56:18,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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) [2024-06-04 17:56:18,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:18,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:18,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:56:18,554 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:56:18,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:18,554 INFO L85 PathProgramCache]: Analyzing trace with hash -290957878, now seen corresponding path program 2 times [2024-06-04 17:56:18,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:18,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131848886] [2024-06-04 17:56:18,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:24,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:24,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131848886] [2024-06-04 17:56:24,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131848886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:24,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:24,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:56:24,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307170132] [2024-06-04 17:56:24,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:24,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:56:24,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:24,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:56:24,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:56:24,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:56:24,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 93 transitions, 738 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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) [2024-06-04 17:56:24,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:24,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:56:24,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:25,286 INFO L124 PetriNetUnfolderBase]: 1953/2910 cut-off events. [2024-06-04 17:56:25,287 INFO L125 PetriNetUnfolderBase]: For 15274/15274 co-relation queries the response was YES. [2024-06-04 17:56:25,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13487 conditions, 2910 events. 1953/2910 cut-off events. For 15274/15274 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13535 event pairs, 691 based on Foata normal form. 5/2914 useless extension candidates. Maximal degree in co-relation 13450. Up to 2870 conditions per place. [2024-06-04 17:56:25,301 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 96 selfloop transitions, 12 changer transitions 0/111 dead transitions. [2024-06-04 17:56:25,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 111 transitions, 1007 flow [2024-06-04 17:56:25,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:56:25,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:56:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-04 17:56:25,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-04 17:56:25,303 INFO L175 Difference]: Start difference. First operand has 75 places, 93 transitions, 738 flow. Second operand 6 states and 99 transitions. [2024-06-04 17:56:25,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 111 transitions, 1007 flow [2024-06-04 17:56:25,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 111 transitions, 974 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-04 17:56:25,318 INFO L231 Difference]: Finished difference. Result has 78 places, 93 transitions, 738 flow [2024-06-04 17:56:25,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=738, PETRI_PLACES=78, PETRI_TRANSITIONS=93} [2024-06-04 17:56:25,319 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2024-06-04 17:56:25,319 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 738 flow [2024-06-04 17:56:25,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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) [2024-06-04 17:56:25,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:25,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:25,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:56:25,320 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:56:25,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:25,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1749277710, now seen corresponding path program 1 times [2024-06-04 17:56:25,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:25,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295207909] [2024-06-04 17:56:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:31,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:31,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295207909] [2024-06-04 17:56:31,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295207909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:31,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:31,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:56:31,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636145257] [2024-06-04 17:56:31,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:31,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:56:31,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:31,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:56:31,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:56:31,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:56:31,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 93 transitions, 738 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 17:56:31,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:31,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:56:31,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:32,589 INFO L124 PetriNetUnfolderBase]: 2025/3017 cut-off events. [2024-06-04 17:56:32,589 INFO L125 PetriNetUnfolderBase]: For 17866/17868 co-relation queries the response was YES. [2024-06-04 17:56:32,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14064 conditions, 3017 events. 2025/3017 cut-off events. For 17866/17868 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14080 event pairs, 550 based on Foata normal form. 14/3030 useless extension candidates. Maximal degree in co-relation 14026. Up to 2643 conditions per place. [2024-06-04 17:56:32,604 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 103 selfloop transitions, 39 changer transitions 0/145 dead transitions. [2024-06-04 17:56:32,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 145 transitions, 1313 flow [2024-06-04 17:56:32,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:56:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:56:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-04 17:56:32,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-04 17:56:32,622 INFO L175 Difference]: Start difference. First operand has 78 places, 93 transitions, 738 flow. Second operand 8 states and 145 transitions. [2024-06-04 17:56:32,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 145 transitions, 1313 flow [2024-06-04 17:56:32,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 145 transitions, 1243 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 17:56:32,636 INFO L231 Difference]: Finished difference. Result has 82 places, 109 transitions, 924 flow [2024-06-04 17:56:32,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=924, PETRI_PLACES=82, PETRI_TRANSITIONS=109} [2024-06-04 17:56:32,636 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2024-06-04 17:56:32,636 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 109 transitions, 924 flow [2024-06-04 17:56:32,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 17:56:32,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:32,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:32,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:56:32,637 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:56:32,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:32,638 INFO L85 PathProgramCache]: Analyzing trace with hash -429521462, now seen corresponding path program 2 times [2024-06-04 17:56:32,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:32,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534614019] [2024-06-04 17:56:32,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:32,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:38,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534614019] [2024-06-04 17:56:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534614019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:38,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:38,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:56:38,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289182830] [2024-06-04 17:56:38,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:38,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:56:38,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:38,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:56:38,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:56:38,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:56:38,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 109 transitions, 924 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 17:56:38,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:38,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:56:38,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:39,615 INFO L124 PetriNetUnfolderBase]: 2047/3048 cut-off events. [2024-06-04 17:56:39,616 INFO L125 PetriNetUnfolderBase]: For 20808/20808 co-relation queries the response was YES. [2024-06-04 17:56:39,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15266 conditions, 3048 events. 2047/3048 cut-off events. For 20808/20808 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14227 event pairs, 610 based on Foata normal form. 4/3051 useless extension candidates. Maximal degree in co-relation 15226. Up to 2990 conditions per place. [2024-06-04 17:56:39,629 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 119 selfloop transitions, 17 changer transitions 0/139 dead transitions. [2024-06-04 17:56:39,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 139 transitions, 1306 flow [2024-06-04 17:56:39,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:56:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:56:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-04 17:56:39,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38109756097560976 [2024-06-04 17:56:39,630 INFO L175 Difference]: Start difference. First operand has 82 places, 109 transitions, 924 flow. Second operand 8 states and 125 transitions. [2024-06-04 17:56:39,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 139 transitions, 1306 flow [2024-06-04 17:56:39,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 139 transitions, 1262 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-04 17:56:39,647 INFO L231 Difference]: Finished difference. Result has 88 places, 115 transitions, 984 flow [2024-06-04 17:56:39,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=984, PETRI_PLACES=88, PETRI_TRANSITIONS=115} [2024-06-04 17:56:39,648 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2024-06-04 17:56:39,648 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 115 transitions, 984 flow [2024-06-04 17:56:39,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 17:56:39,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:39,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:39,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:56:39,649 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:56:39,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:39,649 INFO L85 PathProgramCache]: Analyzing trace with hash -651403652, now seen corresponding path program 3 times [2024-06-04 17:56:39,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:39,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398901763] [2024-06-04 17:56:39,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:39,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:45,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:45,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398901763] [2024-06-04 17:56:45,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398901763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:45,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:45,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:56:45,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417197325] [2024-06-04 17:56:45,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:45,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:56:45,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:45,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:56:45,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:56:45,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:56:45,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 115 transitions, 984 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 17:56:45,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:45,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:56:45,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:46,463 INFO L124 PetriNetUnfolderBase]: 2053/3057 cut-off events. [2024-06-04 17:56:46,463 INFO L125 PetriNetUnfolderBase]: For 22910/22910 co-relation queries the response was YES. [2024-06-04 17:56:46,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15725 conditions, 3057 events. 2053/3057 cut-off events. For 22910/22910 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14262 event pairs, 608 based on Foata normal form. 4/3060 useless extension candidates. Maximal degree in co-relation 15683. Up to 2961 conditions per place. [2024-06-04 17:56:46,482 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 120 selfloop transitions, 24 changer transitions 0/147 dead transitions. [2024-06-04 17:56:46,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 147 transitions, 1439 flow [2024-06-04 17:56:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:56:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:56:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-04 17:56:46,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2024-06-04 17:56:46,484 INFO L175 Difference]: Start difference. First operand has 88 places, 115 transitions, 984 flow. Second operand 8 states and 130 transitions. [2024-06-04 17:56:46,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 147 transitions, 1439 flow [2024-06-04 17:56:46,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 147 transitions, 1405 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 17:56:46,505 INFO L231 Difference]: Finished difference. Result has 92 places, 120 transitions, 1072 flow [2024-06-04 17:56:46,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1072, PETRI_PLACES=92, PETRI_TRANSITIONS=120} [2024-06-04 17:56:46,506 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places. [2024-06-04 17:56:46,506 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 120 transitions, 1072 flow [2024-06-04 17:56:46,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 17:56:46,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:46,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:46,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:56:46,507 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:56:46,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:46,507 INFO L85 PathProgramCache]: Analyzing trace with hash -651157574, now seen corresponding path program 1 times [2024-06-04 17:56:46,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:46,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985362616] [2024-06-04 17:56:46,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:46,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:54,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:54,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985362616] [2024-06-04 17:56:54,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985362616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:54,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:54,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:56:54,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780143450] [2024-06-04 17:56:54,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:54,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:56:54,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:54,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:56:54,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:56:54,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:56:54,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 120 transitions, 1072 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 17:56:54,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:54,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:56:54,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:55,775 INFO L124 PetriNetUnfolderBase]: 2097/3125 cut-off events. [2024-06-04 17:56:55,775 INFO L125 PetriNetUnfolderBase]: For 26583/26583 co-relation queries the response was YES. [2024-06-04 17:56:55,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16299 conditions, 3125 events. 2097/3125 cut-off events. For 26583/26583 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14558 event pairs, 576 based on Foata normal form. 18/3142 useless extension candidates. Maximal degree in co-relation 16255. Up to 2963 conditions per place. [2024-06-04 17:56:55,804 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 127 selfloop transitions, 24 changer transitions 0/154 dead transitions. [2024-06-04 17:56:55,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 154 transitions, 1512 flow [2024-06-04 17:56:55,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:56:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:56:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-04 17:56:55,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 17:56:55,806 INFO L175 Difference]: Start difference. First operand has 92 places, 120 transitions, 1072 flow. Second operand 7 states and 126 transitions. [2024-06-04 17:56:55,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 154 transitions, 1512 flow [2024-06-04 17:56:55,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 154 transitions, 1484 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 17:56:55,832 INFO L231 Difference]: Finished difference. Result has 95 places, 123 transitions, 1140 flow [2024-06-04 17:56:55,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1140, PETRI_PLACES=95, PETRI_TRANSITIONS=123} [2024-06-04 17:56:55,833 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places. [2024-06-04 17:56:55,833 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 123 transitions, 1140 flow [2024-06-04 17:56:55,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 17:56:55,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:55,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:55,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:56:55,833 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:56:55,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:55,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1610780025, now seen corresponding path program 1 times [2024-06-04 17:56:55,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:55,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667702453] [2024-06-04 17:56:55,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:55,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:02,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:02,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667702453] [2024-06-04 17:57:02,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667702453] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:02,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:02,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:57:02,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573530427] [2024-06-04 17:57:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:02,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:57:02,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:02,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:57:02,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:57:02,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:57:02,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 123 transitions, 1140 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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) [2024-06-04 17:57:02,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:02,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:57:02,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:03,676 INFO L124 PetriNetUnfolderBase]: 2147/3196 cut-off events. [2024-06-04 17:57:03,677 INFO L125 PetriNetUnfolderBase]: For 29049/29051 co-relation queries the response was YES. [2024-06-04 17:57:03,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17303 conditions, 3196 events. 2147/3196 cut-off events. For 29049/29051 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14978 event pairs, 607 based on Foata normal form. 7/3202 useless extension candidates. Maximal degree in co-relation 17257. Up to 2926 conditions per place. [2024-06-04 17:57:03,693 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 123 selfloop transitions, 43 changer transitions 0/169 dead transitions. [2024-06-04 17:57:03,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 169 transitions, 1769 flow [2024-06-04 17:57:03,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:57:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:57:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-04 17:57:03,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4564459930313589 [2024-06-04 17:57:03,694 INFO L175 Difference]: Start difference. First operand has 95 places, 123 transitions, 1140 flow. Second operand 7 states and 131 transitions. [2024-06-04 17:57:03,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 169 transitions, 1769 flow [2024-06-04 17:57:03,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 169 transitions, 1715 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 17:57:03,718 INFO L231 Difference]: Finished difference. Result has 98 places, 136 transitions, 1357 flow [2024-06-04 17:57:03,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1357, PETRI_PLACES=98, PETRI_TRANSITIONS=136} [2024-06-04 17:57:03,719 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-06-04 17:57:03,719 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 136 transitions, 1357 flow [2024-06-04 17:57:03,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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) [2024-06-04 17:57:03,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:03,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:03,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:57:03,720 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:57:03,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1551690341, now seen corresponding path program 2 times [2024-06-04 17:57:03,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:03,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616561676] [2024-06-04 17:57:03,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:10,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:10,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616561676] [2024-06-04 17:57:10,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616561676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:10,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:10,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:57:10,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11381440] [2024-06-04 17:57:10,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:10,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:57:10,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:10,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:57:10,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:57:10,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:57:10,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 136 transitions, 1357 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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) [2024-06-04 17:57:10,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:10,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:57:10,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:11,960 INFO L124 PetriNetUnfolderBase]: 2127/3167 cut-off events. [2024-06-04 17:57:11,961 INFO L125 PetriNetUnfolderBase]: For 33085/33087 co-relation queries the response was YES. [2024-06-04 17:57:11,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18020 conditions, 3167 events. 2127/3167 cut-off events. For 33085/33087 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14822 event pairs, 609 based on Foata normal form. 7/3173 useless extension candidates. Maximal degree in co-relation 17972. Up to 2969 conditions per place. [2024-06-04 17:57:11,980 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 129 selfloop transitions, 33 changer transitions 0/165 dead transitions. [2024-06-04 17:57:11,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 165 transitions, 1792 flow [2024-06-04 17:57:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:57:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:57:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-04 17:57:11,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 17:57:11,985 INFO L175 Difference]: Start difference. First operand has 98 places, 136 transitions, 1357 flow. Second operand 7 states and 126 transitions. [2024-06-04 17:57:11,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 165 transitions, 1792 flow [2024-06-04 17:57:12,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 165 transitions, 1695 flow, removed 37 selfloop flow, removed 3 redundant places. [2024-06-04 17:57:12,018 INFO L231 Difference]: Finished difference. Result has 102 places, 136 transitions, 1339 flow [2024-06-04 17:57:12,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1339, PETRI_PLACES=102, PETRI_TRANSITIONS=136} [2024-06-04 17:57:12,019 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places. [2024-06-04 17:57:12,019 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 136 transitions, 1339 flow [2024-06-04 17:57:12,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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) [2024-06-04 17:57:12,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:12,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:12,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:57:12,020 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:57:12,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:12,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1547965536, now seen corresponding path program 1 times [2024-06-04 17:57:12,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:12,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537752297] [2024-06-04 17:57:12,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:12,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:17,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:17,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537752297] [2024-06-04 17:57:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537752297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:17,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:17,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:57:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459128456] [2024-06-04 17:57:17,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:17,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:57:17,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:17,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:57:17,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:57:17,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:57:17,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 136 transitions, 1339 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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) [2024-06-04 17:57:17,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:17,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:57:17,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:18,537 INFO L124 PetriNetUnfolderBase]: 2181/3245 cut-off events. [2024-06-04 17:57:18,538 INFO L125 PetriNetUnfolderBase]: For 36595/36597 co-relation queries the response was YES. [2024-06-04 17:57:18,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18700 conditions, 3245 events. 2181/3245 cut-off events. For 36595/36597 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15230 event pairs, 562 based on Foata normal form. 6/3250 useless extension candidates. Maximal degree in co-relation 18650. Up to 2786 conditions per place. [2024-06-04 17:57:18,559 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 116 selfloop transitions, 57 changer transitions 0/176 dead transitions. [2024-06-04 17:57:18,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 176 transitions, 1952 flow [2024-06-04 17:57:18,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:57:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:57:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-04 17:57:18,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-04 17:57:18,562 INFO L175 Difference]: Start difference. First operand has 102 places, 136 transitions, 1339 flow. Second operand 8 states and 142 transitions. [2024-06-04 17:57:18,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 176 transitions, 1952 flow [2024-06-04 17:57:18,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 176 transitions, 1851 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-04 17:57:18,636 INFO L231 Difference]: Finished difference. Result has 105 places, 143 transitions, 1455 flow [2024-06-04 17:57:18,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1455, PETRI_PLACES=105, PETRI_TRANSITIONS=143} [2024-06-04 17:57:18,637 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2024-06-04 17:57:18,637 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 143 transitions, 1455 flow [2024-06-04 17:57:18,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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) [2024-06-04 17:57:18,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:18,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:18,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:57:18,638 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:57:18,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1606970590, now seen corresponding path program 2 times [2024-06-04 17:57:18,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:18,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279540649] [2024-06-04 17:57:18,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:18,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:23,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279540649] [2024-06-04 17:57:23,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279540649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:23,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:23,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:57:23,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122448440] [2024-06-04 17:57:23,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:23,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:57:23,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:23,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:57:23,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:57:23,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:57:23,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 143 transitions, 1455 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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) [2024-06-04 17:57:23,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:23,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:57:23,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:24,995 INFO L124 PetriNetUnfolderBase]: 2161/3218 cut-off events. [2024-06-04 17:57:24,995 INFO L125 PetriNetUnfolderBase]: For 40034/40036 co-relation queries the response was YES. [2024-06-04 17:57:25,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18966 conditions, 3218 events. 2161/3218 cut-off events. For 40034/40036 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15117 event pairs, 566 based on Foata normal form. 8/3225 useless extension candidates. Maximal degree in co-relation 18914. Up to 2774 conditions per place. [2024-06-04 17:57:25,012 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 116 selfloop transitions, 56 changer transitions 0/175 dead transitions. [2024-06-04 17:57:25,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 175 transitions, 2015 flow [2024-06-04 17:57:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:57:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:57:25,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-06-04 17:57:25,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.540650406504065 [2024-06-04 17:57:25,017 INFO L175 Difference]: Start difference. First operand has 105 places, 143 transitions, 1455 flow. Second operand 6 states and 133 transitions. [2024-06-04 17:57:25,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 175 transitions, 2015 flow [2024-06-04 17:57:25,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 175 transitions, 1949 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 17:57:25,060 INFO L231 Difference]: Finished difference. Result has 107 places, 143 transitions, 1513 flow [2024-06-04 17:57:25,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1513, PETRI_PLACES=107, PETRI_TRANSITIONS=143} [2024-06-04 17:57:25,060 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2024-06-04 17:57:25,060 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 143 transitions, 1513 flow [2024-06-04 17:57:25,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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) [2024-06-04 17:57:25,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:25,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:25,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:57:25,061 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:57:25,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:25,061 INFO L85 PathProgramCache]: Analyzing trace with hash -430262606, now seen corresponding path program 3 times [2024-06-04 17:57:25,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:25,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249703523] [2024-06-04 17:57:25,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:25,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:30,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:30,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249703523] [2024-06-04 17:57:30,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249703523] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:30,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:30,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:57:30,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980571239] [2024-06-04 17:57:30,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:30,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:57:30,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:30,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:57:30,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:57:30,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:57:30,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 143 transitions, 1513 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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) [2024-06-04 17:57:30,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:30,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:57:30,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:31,179 INFO L124 PetriNetUnfolderBase]: 2164/3222 cut-off events. [2024-06-04 17:57:31,180 INFO L125 PetriNetUnfolderBase]: For 43234/43236 co-relation queries the response was YES. [2024-06-04 17:57:31,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19272 conditions, 3222 events. 2164/3222 cut-off events. For 43234/43236 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15111 event pairs, 619 based on Foata normal form. 6/3227 useless extension candidates. Maximal degree in co-relation 19220. Up to 3139 conditions per place. [2024-06-04 17:57:31,199 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 146 selfloop transitions, 18 changer transitions 0/167 dead transitions. [2024-06-04 17:57:31,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 167 transitions, 1931 flow [2024-06-04 17:57:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:57:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:57:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-04 17:57:31,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45934959349593496 [2024-06-04 17:57:31,201 INFO L175 Difference]: Start difference. First operand has 107 places, 143 transitions, 1513 flow. Second operand 6 states and 113 transitions. [2024-06-04 17:57:31,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 167 transitions, 1931 flow [2024-06-04 17:57:31,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 167 transitions, 1824 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-04 17:57:31,239 INFO L231 Difference]: Finished difference. Result has 109 places, 146 transitions, 1490 flow [2024-06-04 17:57:31,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1490, PETRI_PLACES=109, PETRI_TRANSITIONS=146} [2024-06-04 17:57:31,240 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 67 predicate places. [2024-06-04 17:57:31,240 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 146 transitions, 1490 flow [2024-06-04 17:57:31,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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) [2024-06-04 17:57:31,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:31,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:31,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:57:31,241 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:57:31,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:31,241 INFO L85 PathProgramCache]: Analyzing trace with hash -429995479, now seen corresponding path program 1 times [2024-06-04 17:57:31,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:31,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353996543] [2024-06-04 17:57:31,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:31,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:37,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:37,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353996543] [2024-06-04 17:57:37,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353996543] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:37,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:37,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:57:37,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789265051] [2024-06-04 17:57:37,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:37,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:57:37,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:37,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:57:37,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:57:37,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:57:37,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 146 transitions, 1490 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 17:57:37,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:37,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:57:37,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:38,913 INFO L124 PetriNetUnfolderBase]: 2159/3213 cut-off events. [2024-06-04 17:57:38,914 INFO L125 PetriNetUnfolderBase]: For 45533/45533 co-relation queries the response was YES. [2024-06-04 17:57:38,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19220 conditions, 3213 events. 2159/3213 cut-off events. For 45533/45533 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15042 event pairs, 609 based on Foata normal form. 2/3214 useless extension candidates. Maximal degree in co-relation 19167. Up to 3146 conditions per place. [2024-06-04 17:57:38,935 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 145 selfloop transitions, 19 changer transitions 0/167 dead transitions. [2024-06-04 17:57:38,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 167 transitions, 1885 flow [2024-06-04 17:57:38,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:57:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:57:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-04 17:57:38,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 17:57:38,946 INFO L175 Difference]: Start difference. First operand has 109 places, 146 transitions, 1490 flow. Second operand 7 states and 112 transitions. [2024-06-04 17:57:38,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 167 transitions, 1885 flow [2024-06-04 17:57:38,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 167 transitions, 1845 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 17:57:39,000 INFO L231 Difference]: Finished difference. Result has 112 places, 147 transitions, 1517 flow [2024-06-04 17:57:39,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1517, PETRI_PLACES=112, PETRI_TRANSITIONS=147} [2024-06-04 17:57:39,001 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 70 predicate places. [2024-06-04 17:57:39,001 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 147 transitions, 1517 flow [2024-06-04 17:57:39,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 17:57:39,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:39,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:39,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:57:39,003 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:57:39,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:39,016 INFO L85 PathProgramCache]: Analyzing trace with hash -860616385, now seen corresponding path program 1 times [2024-06-04 17:57:39,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:39,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171354708] [2024-06-04 17:57:39,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:39,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:45,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:45,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171354708] [2024-06-04 17:57:45,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171354708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:45,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:45,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:57:45,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092648807] [2024-06-04 17:57:45,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:45,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:57:45,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:45,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:57:45,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:57:45,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:57:45,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 147 transitions, 1517 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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) [2024-06-04 17:57:45,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:45,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:57:45,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:47,090 INFO L124 PetriNetUnfolderBase]: 2287/3423 cut-off events. [2024-06-04 17:57:47,090 INFO L125 PetriNetUnfolderBase]: For 54441/54443 co-relation queries the response was YES. [2024-06-04 17:57:47,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20648 conditions, 3423 events. 2287/3423 cut-off events. For 54441/54443 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16449 event pairs, 453 based on Foata normal form. 4/3426 useless extension candidates. Maximal degree in co-relation 20593. Up to 2732 conditions per place. [2024-06-04 17:57:47,109 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 134 selfloop transitions, 59 changer transitions 0/196 dead transitions. [2024-06-04 17:57:47,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 196 transitions, 2335 flow [2024-06-04 17:57:47,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:57:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:57:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-04 17:57:47,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2024-06-04 17:57:47,112 INFO L175 Difference]: Start difference. First operand has 112 places, 147 transitions, 1517 flow. Second operand 8 states and 151 transitions. [2024-06-04 17:57:47,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 196 transitions, 2335 flow [2024-06-04 17:57:47,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 196 transitions, 2303 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-04 17:57:47,168 INFO L231 Difference]: Finished difference. Result has 116 places, 153 transitions, 1706 flow [2024-06-04 17:57:47,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1485, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1706, PETRI_PLACES=116, PETRI_TRANSITIONS=153} [2024-06-04 17:57:47,168 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 74 predicate places. [2024-06-04 17:57:47,168 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 153 transitions, 1706 flow [2024-06-04 17:57:47,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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) [2024-06-04 17:57:47,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:47,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:47,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:57:47,169 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:57:47,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:47,169 INFO L85 PathProgramCache]: Analyzing trace with hash -860555935, now seen corresponding path program 2 times [2024-06-04 17:57:47,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:47,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051010075] [2024-06-04 17:57:47,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:47,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:54,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:54,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051010075] [2024-06-04 17:57:54,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051010075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:54,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:54,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:57:54,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63045108] [2024-06-04 17:57:54,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:54,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:57:54,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:54,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:57:54,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:57:54,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:57:54,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 153 transitions, 1706 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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) [2024-06-04 17:57:54,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:54,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:57:54,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:55,742 INFO L124 PetriNetUnfolderBase]: 2504/3740 cut-off events. [2024-06-04 17:57:55,742 INFO L125 PetriNetUnfolderBase]: For 70563/70565 co-relation queries the response was YES. [2024-06-04 17:57:55,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23477 conditions, 3740 events. 2504/3740 cut-off events. For 70563/70565 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 18251 event pairs, 606 based on Foata normal form. 31/3770 useless extension candidates. Maximal degree in co-relation 23420. Up to 3150 conditions per place. [2024-06-04 17:57:55,764 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 152 selfloop transitions, 74 changer transitions 0/229 dead transitions. [2024-06-04 17:57:55,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 229 transitions, 2750 flow [2024-06-04 17:57:55,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:57:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:57:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-04 17:57:55,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-04 17:57:55,768 INFO L175 Difference]: Start difference. First operand has 116 places, 153 transitions, 1706 flow. Second operand 9 states and 174 transitions. [2024-06-04 17:57:55,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 229 transitions, 2750 flow [2024-06-04 17:57:55,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 229 transitions, 2669 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-04 17:57:55,837 INFO L231 Difference]: Finished difference. Result has 127 places, 179 transitions, 2239 flow [2024-06-04 17:57:55,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2239, PETRI_PLACES=127, PETRI_TRANSITIONS=179} [2024-06-04 17:57:55,837 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places. [2024-06-04 17:57:55,837 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 179 transitions, 2239 flow [2024-06-04 17:57:55,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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) [2024-06-04 17:57:55,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:55,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:55,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:57:55,838 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:57:55,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:55,839 INFO L85 PathProgramCache]: Analyzing trace with hash -857754651, now seen corresponding path program 1 times [2024-06-04 17:57:55,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:55,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459747974] [2024-06-04 17:57:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:55,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:02,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:02,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459747974] [2024-06-04 17:58:02,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459747974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:02,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:02,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:58:02,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146804541] [2024-06-04 17:58:02,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:02,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:58:02,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:02,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:58:02,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:58:02,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:58:02,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 179 transitions, 2239 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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) [2024-06-04 17:58:02,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:02,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:58:02,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:03,669 INFO L124 PetriNetUnfolderBase]: 2494/3726 cut-off events. [2024-06-04 17:58:03,670 INFO L125 PetriNetUnfolderBase]: For 83753/83755 co-relation queries the response was YES. [2024-06-04 17:58:03,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26342 conditions, 3726 events. 2494/3726 cut-off events. For 83753/83755 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18170 event pairs, 599 based on Foata normal form. 6/3731 useless extension candidates. Maximal degree in co-relation 26278. Up to 3416 conditions per place. [2024-06-04 17:58:03,694 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 159 selfloop transitions, 48 changer transitions 0/210 dead transitions. [2024-06-04 17:58:03,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 210 transitions, 2825 flow [2024-06-04 17:58:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:58:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:58:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-04 17:58:03,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-04 17:58:03,696 INFO L175 Difference]: Start difference. First operand has 127 places, 179 transitions, 2239 flow. Second operand 8 states and 140 transitions. [2024-06-04 17:58:03,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 210 transitions, 2825 flow [2024-06-04 17:58:03,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 210 transitions, 2725 flow, removed 49 selfloop flow, removed 1 redundant places. [2024-06-04 17:58:03,798 INFO L231 Difference]: Finished difference. Result has 134 places, 179 transitions, 2247 flow [2024-06-04 17:58:03,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2139, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2247, PETRI_PLACES=134, PETRI_TRANSITIONS=179} [2024-06-04 17:58:03,799 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places. [2024-06-04 17:58:03,799 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 179 transitions, 2247 flow [2024-06-04 17:58:03,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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) [2024-06-04 17:58:03,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:03,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:03,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:58:03,799 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:58:03,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:03,807 INFO L85 PathProgramCache]: Analyzing trace with hash -742283557, now seen corresponding path program 1 times [2024-06-04 17:58:03,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:03,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657838642] [2024-06-04 17:58:03,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:03,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:10,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:10,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657838642] [2024-06-04 17:58:10,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657838642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:10,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:10,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:58:10,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556885178] [2024-06-04 17:58:10,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:10,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:58:10,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:10,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:58:10,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:58:10,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:58:10,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 179 transitions, 2247 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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) [2024-06-04 17:58:10,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:10,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:58:10,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:12,075 INFO L124 PetriNetUnfolderBase]: 2603/3905 cut-off events. [2024-06-04 17:58:12,076 INFO L125 PetriNetUnfolderBase]: For 95623/95625 co-relation queries the response was YES. [2024-06-04 17:58:12,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27174 conditions, 3905 events. 2603/3905 cut-off events. For 95623/95625 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 19427 event pairs, 583 based on Foata normal form. 30/3934 useless extension candidates. Maximal degree in co-relation 27107. Up to 3315 conditions per place. [2024-06-04 17:58:12,104 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 158 selfloop transitions, 61 changer transitions 0/222 dead transitions. [2024-06-04 17:58:12,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 222 transitions, 2939 flow [2024-06-04 17:58:12,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:58:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:58:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-04 17:58:12,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 17:58:12,107 INFO L175 Difference]: Start difference. First operand has 134 places, 179 transitions, 2247 flow. Second operand 9 states and 162 transitions. [2024-06-04 17:58:12,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 222 transitions, 2939 flow [2024-06-04 17:58:12,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 222 transitions, 2852 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-04 17:58:12,203 INFO L231 Difference]: Finished difference. Result has 138 places, 182 transitions, 2336 flow [2024-06-04 17:58:12,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2160, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2336, PETRI_PLACES=138, PETRI_TRANSITIONS=182} [2024-06-04 17:58:12,204 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places. [2024-06-04 17:58:12,204 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 182 transitions, 2336 flow [2024-06-04 17:58:12,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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) [2024-06-04 17:58:12,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:12,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:12,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:58:12,205 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:58:12,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash -681132245, now seen corresponding path program 2 times [2024-06-04 17:58:12,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:12,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431196336] [2024-06-04 17:58:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:12,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:19,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:19,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431196336] [2024-06-04 17:58:19,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431196336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:19,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:19,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:58:19,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969599500] [2024-06-04 17:58:19,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:19,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:58:19,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:19,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:58:19,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:58:19,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:58:19,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 182 transitions, 2336 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 17:58:19,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:19,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:58:19,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:20,804 INFO L124 PetriNetUnfolderBase]: 2620/3931 cut-off events. [2024-06-04 17:58:20,804 INFO L125 PetriNetUnfolderBase]: For 95261/95261 co-relation queries the response was YES. [2024-06-04 17:58:20,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27979 conditions, 3931 events. 2620/3931 cut-off events. For 95261/95261 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 19571 event pairs, 664 based on Foata normal form. 4/3934 useless extension candidates. Maximal degree in co-relation 27911. Up to 3819 conditions per place. [2024-06-04 17:58:20,835 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 184 selfloop transitions, 27 changer transitions 0/214 dead transitions. [2024-06-04 17:58:20,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 214 transitions, 2868 flow [2024-06-04 17:58:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:58:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:58:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-04 17:58:20,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38482384823848237 [2024-06-04 17:58:20,838 INFO L175 Difference]: Start difference. First operand has 138 places, 182 transitions, 2336 flow. Second operand 9 states and 142 transitions. [2024-06-04 17:58:20,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 214 transitions, 2868 flow [2024-06-04 17:58:20,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 214 transitions, 2726 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-04 17:58:20,939 INFO L231 Difference]: Finished difference. Result has 140 places, 184 transitions, 2291 flow [2024-06-04 17:58:20,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2194, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2291, PETRI_PLACES=140, PETRI_TRANSITIONS=184} [2024-06-04 17:58:20,941 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places. [2024-06-04 17:58:20,941 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 184 transitions, 2291 flow [2024-06-04 17:58:20,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 17:58:20,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:20,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:20,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:58:20,941 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:58:20,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1294250265, now seen corresponding path program 3 times [2024-06-04 17:58:20,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:20,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83410932] [2024-06-04 17:58:20,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:20,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:27,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:27,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83410932] [2024-06-04 17:58:27,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83410932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:27,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:27,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:58:27,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937403730] [2024-06-04 17:58:27,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:27,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:58:27,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:27,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:58:27,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:58:27,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:58:27,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 184 transitions, 2291 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 17:58:27,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:27,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:58:27,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:29,223 INFO L124 PetriNetUnfolderBase]: 2637/3958 cut-off events. [2024-06-04 17:58:29,223 INFO L125 PetriNetUnfolderBase]: For 101067/101067 co-relation queries the response was YES. [2024-06-04 17:58:29,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28118 conditions, 3958 events. 2637/3958 cut-off events. For 101067/101067 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19724 event pairs, 664 based on Foata normal form. 4/3961 useless extension candidates. Maximal degree in co-relation 28049. Up to 3882 conditions per place. [2024-06-04 17:58:29,249 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 193 selfloop transitions, 19 changer transitions 0/215 dead transitions. [2024-06-04 17:58:29,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 215 transitions, 2825 flow [2024-06-04 17:58:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:58:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:58:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2024-06-04 17:58:29,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37669376693766937 [2024-06-04 17:58:29,252 INFO L175 Difference]: Start difference. First operand has 140 places, 184 transitions, 2291 flow. Second operand 9 states and 139 transitions. [2024-06-04 17:58:29,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 215 transitions, 2825 flow [2024-06-04 17:58:29,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 215 transitions, 2746 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 17:58:29,358 INFO L231 Difference]: Finished difference. Result has 142 places, 186 transitions, 2297 flow [2024-06-04 17:58:29,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2212, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2297, PETRI_PLACES=142, PETRI_TRANSITIONS=186} [2024-06-04 17:58:29,358 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 100 predicate places. [2024-06-04 17:58:29,358 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 186 transitions, 2297 flow [2024-06-04 17:58:29,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 17:58:29,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:29,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:29,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:58:29,359 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:58:29,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:29,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1302524475, now seen corresponding path program 4 times [2024-06-04 17:58:29,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:29,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106310368] [2024-06-04 17:58:29,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:29,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:35,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:35,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106310368] [2024-06-04 17:58:35,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106310368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:35,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:35,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:58:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586556846] [2024-06-04 17:58:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:35,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:58:35,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:35,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:58:35,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:58:36,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:58:36,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 186 transitions, 2297 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 17:58:36,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:36,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:58:36,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:37,762 INFO L124 PetriNetUnfolderBase]: 2654/3985 cut-off events. [2024-06-04 17:58:37,762 INFO L125 PetriNetUnfolderBase]: For 107529/107529 co-relation queries the response was YES. [2024-06-04 17:58:37,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28572 conditions, 3985 events. 2654/3985 cut-off events. For 107529/107529 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19876 event pairs, 669 based on Foata normal form. 4/3988 useless extension candidates. Maximal degree in co-relation 28502. Up to 3882 conditions per place. [2024-06-04 17:58:37,786 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 187 selfloop transitions, 23 changer transitions 0/213 dead transitions. [2024-06-04 17:58:37,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 213 transitions, 2821 flow [2024-06-04 17:58:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:58:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:58:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-04 17:58:37,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-04 17:58:37,789 INFO L175 Difference]: Start difference. First operand has 142 places, 186 transitions, 2297 flow. Second operand 8 states and 126 transitions. [2024-06-04 17:58:37,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 213 transitions, 2821 flow [2024-06-04 17:58:37,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 213 transitions, 2754 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 17:58:37,898 INFO L231 Difference]: Finished difference. Result has 143 places, 188 transitions, 2330 flow [2024-06-04 17:58:37,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2230, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2330, PETRI_PLACES=143, PETRI_TRANSITIONS=188} [2024-06-04 17:58:37,898 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2024-06-04 17:58:37,898 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 188 transitions, 2330 flow [2024-06-04 17:58:37,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 17:58:37,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:37,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:37,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:58:37,899 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:58:37,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:37,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1302524227, now seen corresponding path program 1 times [2024-06-04 17:58:37,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:37,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162362678] [2024-06-04 17:58:37,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:37,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:44,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:44,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162362678] [2024-06-04 17:58:44,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162362678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:44,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:44,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:58:44,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809553690] [2024-06-04 17:58:44,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:44,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:58:44,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:44,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:58:44,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:58:44,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:58:44,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 188 transitions, 2330 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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) [2024-06-04 17:58:44,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:44,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:58:44,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:45,922 INFO L124 PetriNetUnfolderBase]: 2646/3974 cut-off events. [2024-06-04 17:58:45,923 INFO L125 PetriNetUnfolderBase]: For 112808/112810 co-relation queries the response was YES. [2024-06-04 17:58:45,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28763 conditions, 3974 events. 2646/3974 cut-off events. For 112808/112810 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19810 event pairs, 673 based on Foata normal form. 4/3977 useless extension candidates. Maximal degree in co-relation 28692. Up to 3874 conditions per place. [2024-06-04 17:58:45,956 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 183 selfloop transitions, 24 changer transitions 0/210 dead transitions. [2024-06-04 17:58:45,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 210 transitions, 2814 flow [2024-06-04 17:58:45,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:58:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:58:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-04 17:58:45,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-04 17:58:45,959 INFO L175 Difference]: Start difference. First operand has 143 places, 188 transitions, 2330 flow. Second operand 7 states and 114 transitions. [2024-06-04 17:58:45,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 210 transitions, 2814 flow [2024-06-04 17:58:46,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 210 transitions, 2734 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-04 17:58:46,082 INFO L231 Difference]: Finished difference. Result has 144 places, 189 transitions, 2326 flow [2024-06-04 17:58:46,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2250, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2326, PETRI_PLACES=144, PETRI_TRANSITIONS=189} [2024-06-04 17:58:46,083 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 102 predicate places. [2024-06-04 17:58:46,083 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 189 transitions, 2326 flow [2024-06-04 17:58:46,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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) [2024-06-04 17:58:46,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:46,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:46,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:58:46,084 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:58:46,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash -444660215, now seen corresponding path program 5 times [2024-06-04 17:58:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:46,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918491489] [2024-06-04 17:58:46,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:46,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:52,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:52,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918491489] [2024-06-04 17:58:52,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918491489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:52,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:52,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:58:52,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615324401] [2024-06-04 17:58:52,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:52,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:58:52,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:52,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:58:52,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:58:52,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:58:52,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 189 transitions, 2326 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 17:58:52,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:52,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:58:52,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:53,615 INFO L124 PetriNetUnfolderBase]: 2718/4085 cut-off events. [2024-06-04 17:58:53,615 INFO L125 PetriNetUnfolderBase]: For 116453/116453 co-relation queries the response was YES. [2024-06-04 17:58:53,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29030 conditions, 4085 events. 2718/4085 cut-off events. For 116453/116453 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 20427 event pairs, 639 based on Foata normal form. 18/4102 useless extension candidates. Maximal degree in co-relation 28958. Up to 3832 conditions per place. [2024-06-04 17:58:53,648 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 198 selfloop transitions, 32 changer transitions 0/233 dead transitions. [2024-06-04 17:58:53,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 233 transitions, 3043 flow [2024-06-04 17:58:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:58:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:58:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-04 17:58:53,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-04 17:58:53,650 INFO L175 Difference]: Start difference. First operand has 144 places, 189 transitions, 2326 flow. Second operand 8 states and 146 transitions. [2024-06-04 17:58:53,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 233 transitions, 3043 flow [2024-06-04 17:58:53,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 233 transitions, 2993 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-04 17:58:53,780 INFO L231 Difference]: Finished difference. Result has 148 places, 195 transitions, 2446 flow [2024-06-04 17:58:53,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2276, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2446, PETRI_PLACES=148, PETRI_TRANSITIONS=195} [2024-06-04 17:58:53,781 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 106 predicate places. [2024-06-04 17:58:53,781 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 195 transitions, 2446 flow [2024-06-04 17:58:53,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 17:58:53,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:53,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:53,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:58:53,781 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:58:53,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash 446957159, now seen corresponding path program 1 times [2024-06-04 17:58:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:53,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835090665] [2024-06-04 17:58:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:01,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:01,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835090665] [2024-06-04 17:59:01,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835090665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:01,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:01,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:59:01,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539933179] [2024-06-04 17:59:01,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:01,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:59:01,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:01,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:59:01,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:59:01,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:59:01,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 195 transitions, 2446 flow. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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) [2024-06-04 17:59:01,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:01,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:59:01,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:02,729 INFO L124 PetriNetUnfolderBase]: 2697/4055 cut-off events. [2024-06-04 17:59:02,729 INFO L125 PetriNetUnfolderBase]: For 111078/111078 co-relation queries the response was YES. [2024-06-04 17:59:02,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29515 conditions, 4055 events. 2697/4055 cut-off events. For 111078/111078 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 20357 event pairs, 677 based on Foata normal form. 4/4058 useless extension candidates. Maximal degree in co-relation 29441. Up to 3995 conditions per place. [2024-06-04 17:59:02,756 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 197 selfloop transitions, 18 changer transitions 0/218 dead transitions. [2024-06-04 17:59:02,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 218 transitions, 3054 flow [2024-06-04 17:59:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:59:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:59:02,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-04 17:59:02,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 17:59:02,758 INFO L175 Difference]: Start difference. First operand has 148 places, 195 transitions, 2446 flow. Second operand 5 states and 90 transitions. [2024-06-04 17:59:02,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 218 transitions, 3054 flow [2024-06-04 17:59:02,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 218 transitions, 2954 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-04 17:59:02,887 INFO L231 Difference]: Finished difference. Result has 148 places, 200 transitions, 2494 flow [2024-06-04 17:59:02,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2346, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2494, PETRI_PLACES=148, PETRI_TRANSITIONS=200} [2024-06-04 17:59:02,890 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 106 predicate places. [2024-06-04 17:59:02,890 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 200 transitions, 2494 flow [2024-06-04 17:59:02,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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) [2024-06-04 17:59:02,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:02,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:02,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:59:02,891 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:59:02,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:02,891 INFO L85 PathProgramCache]: Analyzing trace with hash -909303145, now seen corresponding path program 1 times [2024-06-04 17:59:02,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:02,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653582550] [2024-06-04 17:59:02,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:02,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:10,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:10,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653582550] [2024-06-04 17:59:10,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653582550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:10,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:10,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:59:10,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010300712] [2024-06-04 17:59:10,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:10,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:59:10,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:10,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:59:10,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:59:10,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:59:10,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 200 transitions, 2494 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 17:59:10,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:10,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:59:10,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:12,426 INFO L124 PetriNetUnfolderBase]: 4249/6488 cut-off events. [2024-06-04 17:59:12,427 INFO L125 PetriNetUnfolderBase]: For 252970/252972 co-relation queries the response was YES. [2024-06-04 17:59:12,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47519 conditions, 6488 events. 4249/6488 cut-off events. For 252970/252972 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 36258 event pairs, 775 based on Foata normal form. 82/6569 useless extension candidates. Maximal degree in co-relation 47444. Up to 3099 conditions per place. [2024-06-04 17:59:12,475 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 209 selfloop transitions, 81 changer transitions 0/293 dead transitions. [2024-06-04 17:59:12,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 293 transitions, 4076 flow [2024-06-04 17:59:12,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:59:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:59:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2024-06-04 17:59:12,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5203252032520326 [2024-06-04 17:59:12,477 INFO L175 Difference]: Start difference. First operand has 148 places, 200 transitions, 2494 flow. Second operand 9 states and 192 transitions. [2024-06-04 17:59:12,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 293 transitions, 4076 flow [2024-06-04 17:59:12,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 293 transitions, 4025 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-04 17:59:12,642 INFO L231 Difference]: Finished difference. Result has 157 places, 220 transitions, 3101 flow [2024-06-04 17:59:12,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3101, PETRI_PLACES=157, PETRI_TRANSITIONS=220} [2024-06-04 17:59:12,642 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 115 predicate places. [2024-06-04 17:59:12,642 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 220 transitions, 3101 flow [2024-06-04 17:59:12,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 17:59:12,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:12,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:12,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:59:12,643 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:59:12,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:12,643 INFO L85 PathProgramCache]: Analyzing trace with hash -907429195, now seen corresponding path program 2 times [2024-06-04 17:59:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:12,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899833192] [2024-06-04 17:59:12,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:12,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:19,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:19,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899833192] [2024-06-04 17:59:19,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899833192] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:19,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:19,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:59:19,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406632652] [2024-06-04 17:59:19,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:19,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:59:19,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:19,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:59:19,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:59:19,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:59:19,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 220 transitions, 3101 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 17:59:19,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:19,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:59:19,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:22,631 INFO L124 PetriNetUnfolderBase]: 5292/8111 cut-off events. [2024-06-04 17:59:22,631 INFO L125 PetriNetUnfolderBase]: For 357149/357151 co-relation queries the response was YES. [2024-06-04 17:59:22,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63701 conditions, 8111 events. 5292/8111 cut-off events. For 357149/357151 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 47459 event pairs, 1393 based on Foata normal form. 82/8192 useless extension candidates. Maximal degree in co-relation 63622. Up to 5743 conditions per place. [2024-06-04 17:59:22,696 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 208 selfloop transitions, 87 changer transitions 6/304 dead transitions. [2024-06-04 17:59:22,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 304 transitions, 4626 flow [2024-06-04 17:59:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:59:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:59:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 206 transitions. [2024-06-04 17:59:22,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024390243902439 [2024-06-04 17:59:22,698 INFO L175 Difference]: Start difference. First operand has 157 places, 220 transitions, 3101 flow. Second operand 10 states and 206 transitions. [2024-06-04 17:59:22,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 304 transitions, 4626 flow [2024-06-04 17:59:23,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 304 transitions, 4498 flow, removed 60 selfloop flow, removed 2 redundant places. [2024-06-04 17:59:23,042 INFO L231 Difference]: Finished difference. Result has 166 places, 234 transitions, 3528 flow [2024-06-04 17:59:23,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3005, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3528, PETRI_PLACES=166, PETRI_TRANSITIONS=234} [2024-06-04 17:59:23,042 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 124 predicate places. [2024-06-04 17:59:23,042 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 234 transitions, 3528 flow [2024-06-04 17:59:23,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 17:59:23,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:23,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:23,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:59:23,043 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:59:23,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1684509181, now seen corresponding path program 3 times [2024-06-04 17:59:23,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:23,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920023164] [2024-06-04 17:59:23,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:23,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:28,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:28,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920023164] [2024-06-04 17:59:28,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920023164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:28,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:28,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:59:28,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54385978] [2024-06-04 17:59:28,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:28,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:59:28,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:28,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:59:28,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:59:29,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:59:29,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 234 transitions, 3528 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 17:59:29,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:29,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:59:29,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:31,700 INFO L124 PetriNetUnfolderBase]: 5269/8078 cut-off events. [2024-06-04 17:59:31,701 INFO L125 PetriNetUnfolderBase]: For 340012/340014 co-relation queries the response was YES. [2024-06-04 17:59:31,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64188 conditions, 8078 events. 5269/8078 cut-off events. For 340012/340014 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 47402 event pairs, 1873 based on Foata normal form. 22/8099 useless extension candidates. Maximal degree in co-relation 64106. Up to 7632 conditions per place. [2024-06-04 17:59:31,766 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 222 selfloop transitions, 53 changer transitions 0/278 dead transitions. [2024-06-04 17:59:31,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 278 transitions, 4252 flow [2024-06-04 17:59:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:59:31,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:59:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-04 17:59:31,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 17:59:31,769 INFO L175 Difference]: Start difference. First operand has 166 places, 234 transitions, 3528 flow. Second operand 10 states and 170 transitions. [2024-06-04 17:59:31,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 278 transitions, 4252 flow [2024-06-04 17:59:32,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 278 transitions, 4095 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-04 17:59:32,181 INFO L231 Difference]: Finished difference. Result has 171 places, 236 transitions, 3525 flow [2024-06-04 17:59:32,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3371, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3525, PETRI_PLACES=171, PETRI_TRANSITIONS=236} [2024-06-04 17:59:32,181 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places. [2024-06-04 17:59:32,182 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 236 transitions, 3525 flow [2024-06-04 17:59:32,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 17:59:32,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:32,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:32,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:59:32,182 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:59:32,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash 435867703, now seen corresponding path program 4 times [2024-06-04 17:59:32,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:32,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073448310] [2024-06-04 17:59:32,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:32,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:38,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:38,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073448310] [2024-06-04 17:59:38,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073448310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:38,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:38,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:59:38,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331290587] [2024-06-04 17:59:38,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:38,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:59:38,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:38,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:59:38,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:59:38,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:59:38,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 236 transitions, 3525 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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) [2024-06-04 17:59:38,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:38,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:59:38,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:40,924 INFO L124 PetriNetUnfolderBase]: 5499/8461 cut-off events. [2024-06-04 17:59:40,924 INFO L125 PetriNetUnfolderBase]: For 367261/367263 co-relation queries the response was YES. [2024-06-04 17:59:40,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67312 conditions, 8461 events. 5499/8461 cut-off events. For 367261/367263 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 50439 event pairs, 1812 based on Foata normal form. 16/8476 useless extension candidates. Maximal degree in co-relation 67228. Up to 7208 conditions per place. [2024-06-04 17:59:41,004 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 211 selfloop transitions, 68 changer transitions 0/282 dead transitions. [2024-06-04 17:59:41,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 282 transitions, 4445 flow [2024-06-04 17:59:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:59:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:59:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-06-04 17:59:41,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5296167247386759 [2024-06-04 17:59:41,007 INFO L175 Difference]: Start difference. First operand has 171 places, 236 transitions, 3525 flow. Second operand 7 states and 152 transitions. [2024-06-04 17:59:41,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 282 transitions, 4445 flow [2024-06-04 17:59:41,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 282 transitions, 4351 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 17:59:41,479 INFO L231 Difference]: Finished difference. Result has 173 places, 239 transitions, 3671 flow [2024-06-04 17:59:41,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3431, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3671, PETRI_PLACES=173, PETRI_TRANSITIONS=239} [2024-06-04 17:59:41,480 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 131 predicate places. [2024-06-04 17:59:41,480 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 239 transitions, 3671 flow [2024-06-04 17:59:41,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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) [2024-06-04 17:59:41,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:41,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:41,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:59:41,480 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:59:41,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:41,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1889372939, now seen corresponding path program 5 times [2024-06-04 17:59:41,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:41,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962070683] [2024-06-04 17:59:41,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:41,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:46,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:46,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962070683] [2024-06-04 17:59:46,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962070683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:46,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:46,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:59:46,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321378248] [2024-06-04 17:59:46,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:46,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:59:46,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:46,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:59:46,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:59:46,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:59:46,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 239 transitions, 3671 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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) [2024-06-04 17:59:46,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:46,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:59:46,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:49,644 INFO L124 PetriNetUnfolderBase]: 5541/8535 cut-off events. [2024-06-04 17:59:49,645 INFO L125 PetriNetUnfolderBase]: For 388512/388514 co-relation queries the response was YES. [2024-06-04 17:59:49,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68471 conditions, 8535 events. 5541/8535 cut-off events. For 388512/388514 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 51083 event pairs, 1957 based on Foata normal form. 24/8558 useless extension candidates. Maximal degree in co-relation 68386. Up to 7953 conditions per place. [2024-06-04 17:59:49,717 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 209 selfloop transitions, 66 changer transitions 0/278 dead transitions. [2024-06-04 17:59:49,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 278 transitions, 4393 flow [2024-06-04 17:59:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:59:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:59:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-04 17:59:49,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-04 17:59:49,719 INFO L175 Difference]: Start difference. First operand has 173 places, 239 transitions, 3671 flow. Second operand 8 states and 148 transitions. [2024-06-04 17:59:49,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 278 transitions, 4393 flow [2024-06-04 17:59:50,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 278 transitions, 4294 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-04 17:59:50,287 INFO L231 Difference]: Finished difference. Result has 178 places, 241 transitions, 3761 flow [2024-06-04 17:59:50,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3574, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3761, PETRI_PLACES=178, PETRI_TRANSITIONS=241} [2024-06-04 17:59:50,287 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places. [2024-06-04 17:59:50,288 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 241 transitions, 3761 flow [2024-06-04 17:59:50,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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) [2024-06-04 17:59:50,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:50,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:50,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:59:50,288 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:59:50,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:50,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1895087231, now seen corresponding path program 1 times [2024-06-04 17:59:50,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:50,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138873250] [2024-06-04 17:59:50,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:50,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:57,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:57,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138873250] [2024-06-04 17:59:57,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138873250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:57,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:57,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:59:57,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613917711] [2024-06-04 17:59:57,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:57,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:59:57,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:57,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:59:57,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:59:58,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:59:58,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 241 transitions, 3761 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 17:59:58,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:58,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:59:58,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:01,223 INFO L124 PetriNetUnfolderBase]: 5920/9073 cut-off events. [2024-06-04 18:00:01,223 INFO L125 PetriNetUnfolderBase]: For 431528/431530 co-relation queries the response was YES. [2024-06-04 18:00:01,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74303 conditions, 9073 events. 5920/9073 cut-off events. For 431528/431530 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 54558 event pairs, 1956 based on Foata normal form. 26/9098 useless extension candidates. Maximal degree in co-relation 74215. Up to 8329 conditions per place. [2024-06-04 18:00:01,298 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 237 selfloop transitions, 79 changer transitions 0/319 dead transitions. [2024-06-04 18:00:01,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 319 transitions, 5285 flow [2024-06-04 18:00:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:00:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:00:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-04 18:00:01,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742547425474255 [2024-06-04 18:00:01,299 INFO L175 Difference]: Start difference. First operand has 178 places, 241 transitions, 3761 flow. Second operand 9 states and 175 transitions. [2024-06-04 18:00:01,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 319 transitions, 5285 flow [2024-06-04 18:00:01,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 319 transitions, 5132 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 18:00:01,845 INFO L231 Difference]: Finished difference. Result has 184 places, 268 transitions, 4384 flow [2024-06-04 18:00:01,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3608, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4384, PETRI_PLACES=184, PETRI_TRANSITIONS=268} [2024-06-04 18:00:01,846 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 142 predicate places. [2024-06-04 18:00:01,846 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 268 transitions, 4384 flow [2024-06-04 18:00:01,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 18:00:01,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:01,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:01,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 18:00:01,847 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:00:01,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:01,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1536168161, now seen corresponding path program 6 times [2024-06-04 18:00:01,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:01,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256564401] [2024-06-04 18:00:01,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:01,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:09,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:09,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256564401] [2024-06-04 18:00:09,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256564401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:09,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:09,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:00:09,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896477582] [2024-06-04 18:00:09,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:09,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:00:09,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:09,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:00:09,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:00:09,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:00:09,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 268 transitions, 4384 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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) [2024-06-04 18:00:09,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:09,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:00:09,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:13,063 INFO L124 PetriNetUnfolderBase]: 5848/8961 cut-off events. [2024-06-04 18:00:13,063 INFO L125 PetriNetUnfolderBase]: For 463300/463302 co-relation queries the response was YES. [2024-06-04 18:00:13,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75421 conditions, 8961 events. 5848/8961 cut-off events. For 463300/463302 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 53536 event pairs, 1869 based on Foata normal form. 42/9002 useless extension candidates. Maximal degree in co-relation 75329. Up to 8312 conditions per place. [2024-06-04 18:00:13,191 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 247 selfloop transitions, 62 changer transitions 0/312 dead transitions. [2024-06-04 18:00:13,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 312 transitions, 5150 flow [2024-06-04 18:00:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:00:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:00:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-04 18:00:13,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-04 18:00:13,200 INFO L175 Difference]: Start difference. First operand has 184 places, 268 transitions, 4384 flow. Second operand 9 states and 164 transitions. [2024-06-04 18:00:13,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 312 transitions, 5150 flow [2024-06-04 18:00:14,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 312 transitions, 4944 flow, removed 98 selfloop flow, removed 2 redundant places. [2024-06-04 18:00:14,320 INFO L231 Difference]: Finished difference. Result has 191 places, 268 transitions, 4316 flow [2024-06-04 18:00:14,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4178, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4316, PETRI_PLACES=191, PETRI_TRANSITIONS=268} [2024-06-04 18:00:14,321 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 149 predicate places. [2024-06-04 18:00:14,321 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 268 transitions, 4316 flow [2024-06-04 18:00:14,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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) [2024-06-04 18:00:14,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:14,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:14,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 18:00:14,322 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:00:14,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:14,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1895094671, now seen corresponding path program 2 times [2024-06-04 18:00:14,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:14,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306982405] [2024-06-04 18:00:14,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:14,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:24,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:24,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306982405] [2024-06-04 18:00:24,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306982405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:24,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:24,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:00:24,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602658537] [2024-06-04 18:00:24,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:24,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:00:24,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:24,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:00:24,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:00:25,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:00:25,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 268 transitions, 4316 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 18:00:25,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:25,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:00:25,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:28,537 INFO L124 PetriNetUnfolderBase]: 6081/9316 cut-off events. [2024-06-04 18:00:28,537 INFO L125 PetriNetUnfolderBase]: For 491782/491784 co-relation queries the response was YES. [2024-06-04 18:00:28,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78727 conditions, 9316 events. 6081/9316 cut-off events. For 491782/491784 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 56305 event pairs, 1918 based on Foata normal form. 20/9335 useless extension candidates. Maximal degree in co-relation 78633. Up to 8172 conditions per place. [2024-06-04 18:00:28,646 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 242 selfloop transitions, 89 changer transitions 0/334 dead transitions. [2024-06-04 18:00:28,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 334 transitions, 5715 flow [2024-06-04 18:00:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:00:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:00:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-04 18:00:28,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823848238482385 [2024-06-04 18:00:28,648 INFO L175 Difference]: Start difference. First operand has 191 places, 268 transitions, 4316 flow. Second operand 9 states and 178 transitions. [2024-06-04 18:00:28,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 334 transitions, 5715 flow [2024-06-04 18:00:29,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 334 transitions, 5597 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-04 18:00:29,433 INFO L231 Difference]: Finished difference. Result has 194 places, 276 transitions, 4596 flow [2024-06-04 18:00:29,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4198, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4596, PETRI_PLACES=194, PETRI_TRANSITIONS=276} [2024-06-04 18:00:29,434 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places. [2024-06-04 18:00:29,434 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 276 transitions, 4596 flow [2024-06-04 18:00:29,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 18:00:29,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:29,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:29,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 18:00:29,435 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:00:29,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:29,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1331908111, now seen corresponding path program 3 times [2024-06-04 18:00:29,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:29,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590544122] [2024-06-04 18:00:29,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:29,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:36,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:36,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590544122] [2024-06-04 18:00:36,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590544122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:36,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:36,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:00:36,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536922390] [2024-06-04 18:00:36,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:36,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:00:36,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:36,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:00:36,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:00:36,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:00:36,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 276 transitions, 4596 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 18:00:36,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:36,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:00:36,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:40,787 INFO L124 PetriNetUnfolderBase]: 6232/9545 cut-off events. [2024-06-04 18:00:40,787 INFO L125 PetriNetUnfolderBase]: For 533531/533533 co-relation queries the response was YES. [2024-06-04 18:00:40,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82553 conditions, 9545 events. 6232/9545 cut-off events. For 533531/533533 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 57804 event pairs, 2140 based on Foata normal form. 26/9570 useless extension candidates. Maximal degree in co-relation 82457. Up to 9244 conditions per place. [2024-06-04 18:00:40,872 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 284 selfloop transitions, 46 changer transitions 0/333 dead transitions. [2024-06-04 18:00:40,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 333 transitions, 5799 flow [2024-06-04 18:00:40,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:00:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:00:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-04 18:00:40,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44986449864498645 [2024-06-04 18:00:40,874 INFO L175 Difference]: Start difference. First operand has 194 places, 276 transitions, 4596 flow. Second operand 9 states and 166 transitions. [2024-06-04 18:00:40,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 333 transitions, 5799 flow [2024-06-04 18:00:41,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 333 transitions, 5636 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-04 18:00:41,601 INFO L231 Difference]: Finished difference. Result has 201 places, 292 transitions, 4885 flow [2024-06-04 18:00:41,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4444, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4885, PETRI_PLACES=201, PETRI_TRANSITIONS=292} [2024-06-04 18:00:41,602 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places. [2024-06-04 18:00:41,602 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 292 transitions, 4885 flow [2024-06-04 18:00:41,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 18:00:41,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:41,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:41,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 18:00:41,603 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:00:41,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:41,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1165261229, now seen corresponding path program 4 times [2024-06-04 18:00:41,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:41,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831526625] [2024-06-04 18:00:41,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:41,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:50,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:50,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831526625] [2024-06-04 18:00:50,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831526625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:50,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:50,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:00:50,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677919919] [2024-06-04 18:00:50,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:50,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:00:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:00:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:00:50,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:00:50,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 292 transitions, 4885 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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) [2024-06-04 18:00:50,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:50,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:00:50,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:54,768 INFO L124 PetriNetUnfolderBase]: 6249/9572 cut-off events. [2024-06-04 18:00:54,768 INFO L125 PetriNetUnfolderBase]: For 564945/564947 co-relation queries the response was YES. [2024-06-04 18:00:54,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85198 conditions, 9572 events. 6249/9572 cut-off events. For 564945/564947 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 57938 event pairs, 2157 based on Foata normal form. 6/9577 useless extension candidates. Maximal degree in co-relation 85097. Up to 9431 conditions per place. [2024-06-04 18:00:54,863 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 298 selfloop transitions, 24 changer transitions 0/325 dead transitions. [2024-06-04 18:00:54,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 325 transitions, 5686 flow [2024-06-04 18:00:54,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:00:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:00:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-04 18:00:54,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38482384823848237 [2024-06-04 18:00:54,866 INFO L175 Difference]: Start difference. First operand has 201 places, 292 transitions, 4885 flow. Second operand 9 states and 142 transitions. [2024-06-04 18:00:54,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 325 transitions, 5686 flow [2024-06-04 18:00:55,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 325 transitions, 5507 flow, removed 75 selfloop flow, removed 3 redundant places. [2024-06-04 18:00:55,677 INFO L231 Difference]: Finished difference. Result has 208 places, 295 transitions, 4852 flow [2024-06-04 18:00:55,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4722, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4852, PETRI_PLACES=208, PETRI_TRANSITIONS=295} [2024-06-04 18:00:55,677 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 166 predicate places. [2024-06-04 18:00:55,677 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 295 transitions, 4852 flow [2024-06-04 18:00:55,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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) [2024-06-04 18:00:55,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:55,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:55,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 18:00:55,678 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:00:55,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash -908768159, now seen corresponding path program 5 times [2024-06-04 18:00:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:55,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805469785] [2024-06-04 18:00:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:55,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:01:03,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:03,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805469785] [2024-06-04 18:01:03,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805469785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:03,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:03,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:01:03,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917021262] [2024-06-04 18:01:03,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:03,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:01:03,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:03,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:01:03,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:01:03,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:01:03,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 295 transitions, 4852 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 18:01:03,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:03,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:01:03,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:07,629 INFO L124 PetriNetUnfolderBase]: 6308/9669 cut-off events. [2024-06-04 18:01:07,629 INFO L125 PetriNetUnfolderBase]: For 596734/596736 co-relation queries the response was YES. [2024-06-04 18:01:07,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85352 conditions, 9669 events. 6308/9669 cut-off events. For 596734/596736 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 58658 event pairs, 2140 based on Foata normal form. 24/9692 useless extension candidates. Maximal degree in co-relation 85248. Up to 9208 conditions per place. [2024-06-04 18:01:07,736 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 278 selfloop transitions, 60 changer transitions 0/341 dead transitions. [2024-06-04 18:01:07,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 341 transitions, 6027 flow [2024-06-04 18:01:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:01:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:01:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-04 18:01:07,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47560975609756095 [2024-06-04 18:01:07,738 INFO L175 Difference]: Start difference. First operand has 208 places, 295 transitions, 4852 flow. Second operand 8 states and 156 transitions. [2024-06-04 18:01:07,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 341 transitions, 6027 flow [2024-06-04 18:01:08,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 341 transitions, 5930 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-04 18:01:08,581 INFO L231 Difference]: Finished difference. Result has 212 places, 305 transitions, 5203 flow [2024-06-04 18:01:08,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4755, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5203, PETRI_PLACES=212, PETRI_TRANSITIONS=305} [2024-06-04 18:01:08,582 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places. [2024-06-04 18:01:08,582 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 305 transitions, 5203 flow [2024-06-04 18:01:08,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 18:01:08,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:08,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:08,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 18:01:08,583 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:01:08,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:08,583 INFO L85 PathProgramCache]: Analyzing trace with hash -908760719, now seen corresponding path program 6 times [2024-06-04 18:01:08,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:08,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417321297] [2024-06-04 18:01:08,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:08,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:01:17,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:17,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417321297] [2024-06-04 18:01:17,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417321297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:17,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:17,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:01:17,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387706138] [2024-06-04 18:01:17,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:17,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:01:17,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:17,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:01:17,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:01:17,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:01:17,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 305 transitions, 5203 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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) [2024-06-04 18:01:17,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:17,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:01:17,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:21,621 INFO L124 PetriNetUnfolderBase]: 6481/9936 cut-off events. [2024-06-04 18:01:21,621 INFO L125 PetriNetUnfolderBase]: For 664851/664853 co-relation queries the response was YES. [2024-06-04 18:01:21,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90441 conditions, 9936 events. 6481/9936 cut-off events. For 664851/664853 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 60667 event pairs, 2143 based on Foata normal form. 20/9955 useless extension candidates. Maximal degree in co-relation 90334. Up to 9177 conditions per place. [2024-06-04 18:01:21,724 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 282 selfloop transitions, 66 changer transitions 0/351 dead transitions. [2024-06-04 18:01:21,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 351 transitions, 6431 flow [2024-06-04 18:01:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:01:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:01:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-06-04 18:01:21,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5296167247386759 [2024-06-04 18:01:21,745 INFO L175 Difference]: Start difference. First operand has 212 places, 305 transitions, 5203 flow. Second operand 7 states and 152 transitions. [2024-06-04 18:01:21,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 351 transitions, 6431 flow [2024-06-04 18:01:22,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 351 transitions, 6244 flow, removed 79 selfloop flow, removed 3 redundant places. [2024-06-04 18:01:22,810 INFO L231 Difference]: Finished difference. Result has 217 places, 310 transitions, 5359 flow [2024-06-04 18:01:22,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5032, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5359, PETRI_PLACES=217, PETRI_TRANSITIONS=310} [2024-06-04 18:01:22,810 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 175 predicate places. [2024-06-04 18:01:22,811 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 310 transitions, 5359 flow [2024-06-04 18:01:22,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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) [2024-06-04 18:01:22,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:22,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:22,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 18:01:22,811 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:01:22,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash -899563949, now seen corresponding path program 7 times [2024-06-04 18:01:22,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:22,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556376664] [2024-06-04 18:01:22,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:01:30,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:30,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556376664] [2024-06-04 18:01:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556376664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:30,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:30,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:01:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316191909] [2024-06-04 18:01:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:30,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:01:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:30,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:01:30,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:01:30,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:01:30,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 310 transitions, 5359 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 18:01:30,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:30,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:01:30,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:33,744 INFO L124 PetriNetUnfolderBase]: 6473/9924 cut-off events. [2024-06-04 18:01:33,744 INFO L125 PetriNetUnfolderBase]: For 628104/628106 co-relation queries the response was YES. [2024-06-04 18:01:33,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89526 conditions, 9924 events. 6473/9924 cut-off events. For 628104/628106 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 60541 event pairs, 2200 based on Foata normal form. 6/9929 useless extension candidates. Maximal degree in co-relation 89417. Up to 9819 conditions per place. [2024-06-04 18:01:33,870 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 318 selfloop transitions, 20 changer transitions 0/341 dead transitions. [2024-06-04 18:01:33,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 341 transitions, 6210 flow [2024-06-04 18:01:33,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:01:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:01:33,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2024-06-04 18:01:33,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36314363143631434 [2024-06-04 18:01:33,873 INFO L175 Difference]: Start difference. First operand has 217 places, 310 transitions, 5359 flow. Second operand 9 states and 134 transitions. [2024-06-04 18:01:33,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 341 transitions, 6210 flow [2024-06-04 18:01:35,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 341 transitions, 6060 flow, removed 47 selfloop flow, removed 3 redundant places. [2024-06-04 18:01:35,539 INFO L231 Difference]: Finished difference. Result has 226 places, 316 transitions, 5388 flow [2024-06-04 18:01:35,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5214, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5388, PETRI_PLACES=226, PETRI_TRANSITIONS=316} [2024-06-04 18:01:35,540 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 184 predicate places. [2024-06-04 18:01:35,540 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 316 transitions, 5388 flow [2024-06-04 18:01:35,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 18:01:35,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:35,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:35,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 18:01:35,541 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:01:35,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:35,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1612757647, now seen corresponding path program 1 times [2024-06-04 18:01:35,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:35,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123861354] [2024-06-04 18:01:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:35,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:01:46,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:46,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123861354] [2024-06-04 18:01:46,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123861354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:46,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:46,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:01:46,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748132060] [2024-06-04 18:01:46,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:46,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:01:46,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:46,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:01:46,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:01:46,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:01:46,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 316 transitions, 5388 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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) [2024-06-04 18:01:46,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:46,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:01:46,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:49,927 INFO L124 PetriNetUnfolderBase]: 6444/9885 cut-off events. [2024-06-04 18:01:49,928 INFO L125 PetriNetUnfolderBase]: For 620767/620769 co-relation queries the response was YES. [2024-06-04 18:01:49,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88090 conditions, 9885 events. 6444/9885 cut-off events. For 620767/620769 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 60458 event pairs, 1990 based on Foata normal form. 14/9898 useless extension candidates. Maximal degree in co-relation 87975. Up to 9523 conditions per place. [2024-06-04 18:01:50,037 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 281 selfloop transitions, 66 changer transitions 0/350 dead transitions. [2024-06-04 18:01:50,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 350 transitions, 6488 flow [2024-06-04 18:01:50,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:01:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:01:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-04 18:01:50,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46747967479674796 [2024-06-04 18:01:50,039 INFO L175 Difference]: Start difference. First operand has 226 places, 316 transitions, 5388 flow. Second operand 6 states and 115 transitions. [2024-06-04 18:01:50,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 350 transitions, 6488 flow [2024-06-04 18:01:51,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 350 transitions, 6398 flow, removed 34 selfloop flow, removed 3 redundant places. [2024-06-04 18:01:51,067 INFO L231 Difference]: Finished difference. Result has 230 places, 325 transitions, 5724 flow [2024-06-04 18:01:51,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5298, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5724, PETRI_PLACES=230, PETRI_TRANSITIONS=325} [2024-06-04 18:01:51,068 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 188 predicate places. [2024-06-04 18:01:51,068 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 325 transitions, 5724 flow [2024-06-04 18:01:51,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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) [2024-06-04 18:01:51,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:51,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:51,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 18:01:51,069 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:01:51,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash 558532967, now seen corresponding path program 1 times [2024-06-04 18:01:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838365600] [2024-06-04 18:01:51,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:51,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:02:00,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:00,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838365600] [2024-06-04 18:02:00,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838365600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:00,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:00,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:02:00,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140949457] [2024-06-04 18:02:00,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:00,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:02:00,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:00,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:02:00,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:02:00,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:02:00,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 325 transitions, 5724 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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) [2024-06-04 18:02:00,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:00,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:02:00,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:05,240 INFO L124 PetriNetUnfolderBase]: 6438/9876 cut-off events. [2024-06-04 18:02:05,240 INFO L125 PetriNetUnfolderBase]: For 635842/635842 co-relation queries the response was YES. [2024-06-04 18:02:05,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89075 conditions, 9876 events. 6438/9876 cut-off events. For 635842/635842 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 60362 event pairs, 2268 based on Foata normal form. 2/9877 useless extension candidates. Maximal degree in co-relation 88957. Up to 9779 conditions per place. [2024-06-04 18:02:05,382 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 313 selfloop transitions, 32 changer transitions 0/348 dead transitions. [2024-06-04 18:02:05,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 348 transitions, 6542 flow [2024-06-04 18:02:05,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:02:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:02:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-04 18:02:05,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38109756097560976 [2024-06-04 18:02:05,384 INFO L175 Difference]: Start difference. First operand has 230 places, 325 transitions, 5724 flow. Second operand 8 states and 125 transitions. [2024-06-04 18:02:05,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 348 transitions, 6542 flow [2024-06-04 18:02:06,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 348 transitions, 6398 flow, removed 42 selfloop flow, removed 3 redundant places. [2024-06-04 18:02:06,620 INFO L231 Difference]: Finished difference. Result has 235 places, 328 transitions, 5715 flow [2024-06-04 18:02:06,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5580, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5715, PETRI_PLACES=235, PETRI_TRANSITIONS=328} [2024-06-04 18:02:06,622 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 193 predicate places. [2024-06-04 18:02:06,622 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 328 transitions, 5715 flow [2024-06-04 18:02:06,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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) [2024-06-04 18:02:06,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:06,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:06,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 18:02:06,623 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:02:06,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:06,623 INFO L85 PathProgramCache]: Analyzing trace with hash 971201951, now seen corresponding path program 1 times [2024-06-04 18:02:06,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:06,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894092201] [2024-06-04 18:02:06,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:06,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:02:18,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:18,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894092201] [2024-06-04 18:02:18,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894092201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:18,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:18,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:02:18,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513582718] [2024-06-04 18:02:18,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:18,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:02:18,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:18,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:02:18,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:02:19,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:02:19,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 328 transitions, 5715 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:02:19,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:19,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:02:19,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:22,686 INFO L124 PetriNetUnfolderBase]: 6433/9869 cut-off events. [2024-06-04 18:02:22,687 INFO L125 PetriNetUnfolderBase]: For 657719/657719 co-relation queries the response was YES. [2024-06-04 18:02:22,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89499 conditions, 9869 events. 6433/9869 cut-off events. For 657719/657719 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 60114 event pairs, 2281 based on Foata normal form. 2/9870 useless extension candidates. Maximal degree in co-relation 89380. Up to 9841 conditions per place. [2024-06-04 18:02:22,794 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 326 selfloop transitions, 11 changer transitions 0/340 dead transitions. [2024-06-04 18:02:22,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 340 transitions, 6457 flow [2024-06-04 18:02:22,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 18:02:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 18:02:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-06-04 18:02:22,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951219512195122 [2024-06-04 18:02:22,797 INFO L175 Difference]: Start difference. First operand has 235 places, 328 transitions, 5715 flow. Second operand 5 states and 81 transitions. [2024-06-04 18:02:22,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 340 transitions, 6457 flow [2024-06-04 18:02:23,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 340 transitions, 6345 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-04 18:02:23,931 INFO L231 Difference]: Finished difference. Result has 234 places, 330 transitions, 5670 flow [2024-06-04 18:02:23,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5603, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5670, PETRI_PLACES=234, PETRI_TRANSITIONS=330} [2024-06-04 18:02:23,932 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places. [2024-06-04 18:02:23,932 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 330 transitions, 5670 flow [2024-06-04 18:02:23,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:02:23,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:23,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:23,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 18:02:23,933 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:02:23,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:23,933 INFO L85 PathProgramCache]: Analyzing trace with hash -679991688, now seen corresponding path program 1 times [2024-06-04 18:02:23,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:23,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665804832] [2024-06-04 18:02:23,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:23,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:02:32,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:32,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665804832] [2024-06-04 18:02:32,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665804832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:32,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:32,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:02:32,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786028586] [2024-06-04 18:02:32,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:32,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:02:32,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:32,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:02:32,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:02:32,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:02:32,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 330 transitions, 5670 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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) [2024-06-04 18:02:32,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:32,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:02:32,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:36,108 INFO L124 PetriNetUnfolderBase]: 6413/9839 cut-off events. [2024-06-04 18:02:36,108 INFO L125 PetriNetUnfolderBase]: For 675611/675613 co-relation queries the response was YES. [2024-06-04 18:02:36,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89318 conditions, 9839 events. 6413/9839 cut-off events. For 675611/675613 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 60020 event pairs, 2096 based on Foata normal form. 12/9850 useless extension candidates. Maximal degree in co-relation 89199. Up to 9457 conditions per place. [2024-06-04 18:02:36,207 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 315 selfloop transitions, 47 changer transitions 0/365 dead transitions. [2024-06-04 18:02:36,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 365 transitions, 6504 flow [2024-06-04 18:02:36,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:02:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:02:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-04 18:02:36,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-04 18:02:36,210 INFO L175 Difference]: Start difference. First operand has 234 places, 330 transitions, 5670 flow. Second operand 8 states and 154 transitions. [2024-06-04 18:02:36,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 365 transitions, 6504 flow [2024-06-04 18:02:37,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 365 transitions, 6453 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-04 18:02:37,307 INFO L231 Difference]: Finished difference. Result has 239 places, 330 transitions, 5719 flow [2024-06-04 18:02:37,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5619, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5719, PETRI_PLACES=239, PETRI_TRANSITIONS=330} [2024-06-04 18:02:37,307 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 197 predicate places. [2024-06-04 18:02:37,307 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 330 transitions, 5719 flow [2024-06-04 18:02:37,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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) [2024-06-04 18:02:37,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:37,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:37,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 18:02:37,308 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:02:37,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash 349104932, now seen corresponding path program 1 times [2024-06-04 18:02:37,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:37,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767638054] [2024-06-04 18:02:37,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:37,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:02:48,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:48,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767638054] [2024-06-04 18:02:48,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767638054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:48,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:48,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:02:48,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465024372] [2024-06-04 18:02:48,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:48,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:02:48,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:48,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:02:48,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:02:48,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:02:48,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 330 transitions, 5719 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:02:48,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:48,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:02:48,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:51,660 INFO L124 PetriNetUnfolderBase]: 6445/9883 cut-off events. [2024-06-04 18:02:51,660 INFO L125 PetriNetUnfolderBase]: For 691973/691975 co-relation queries the response was YES. [2024-06-04 18:02:51,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90358 conditions, 9883 events. 6445/9883 cut-off events. For 691973/691975 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 60329 event pairs, 2095 based on Foata normal form. 4/9886 useless extension candidates. Maximal degree in co-relation 90239. Up to 9621 conditions per place. [2024-06-04 18:02:51,808 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 322 selfloop transitions, 48 changer transitions 0/373 dead transitions. [2024-06-04 18:02:51,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 373 transitions, 6743 flow [2024-06-04 18:02:51,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:02:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:02:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-04 18:02:51,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281842818428184 [2024-06-04 18:02:51,810 INFO L175 Difference]: Start difference. First operand has 239 places, 330 transitions, 5719 flow. Second operand 9 states and 158 transitions. [2024-06-04 18:02:51,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 373 transitions, 6743 flow [2024-06-04 18:02:53,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 373 transitions, 6639 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-04 18:02:53,319 INFO L231 Difference]: Finished difference. Result has 244 places, 338 transitions, 5890 flow [2024-06-04 18:02:53,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5615, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5890, PETRI_PLACES=244, PETRI_TRANSITIONS=338} [2024-06-04 18:02:53,319 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 202 predicate places. [2024-06-04 18:02:53,319 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 338 transitions, 5890 flow [2024-06-04 18:02:53,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:02:53,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:53,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:53,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 18:02:53,320 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:02:53,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1388093234, now seen corresponding path program 2 times [2024-06-04 18:02:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:53,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562854290] [2024-06-04 18:02:53,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:53,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:03:00,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:00,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562854290] [2024-06-04 18:03:00,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562854290] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:00,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:00,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:03:00,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448567113] [2024-06-04 18:03:00,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:00,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:03:00,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:00,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:03:00,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:03:01,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:03:01,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 338 transitions, 5890 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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) [2024-06-04 18:03:01,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:01,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:03:01,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:04,441 INFO L124 PetriNetUnfolderBase]: 6405/9820 cut-off events. [2024-06-04 18:03:04,441 INFO L125 PetriNetUnfolderBase]: For 713597/713599 co-relation queries the response was YES. [2024-06-04 18:03:04,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90023 conditions, 9820 events. 6405/9820 cut-off events. For 713597/713599 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 59781 event pairs, 2064 based on Foata normal form. 24/9843 useless extension candidates. Maximal degree in co-relation 89902. Up to 9313 conditions per place. [2024-06-04 18:03:04,548 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 321 selfloop transitions, 60 changer transitions 0/384 dead transitions. [2024-06-04 18:03:04,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 384 transitions, 6820 flow [2024-06-04 18:03:04,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:03:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:03:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-04 18:03:04,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195121951219512 [2024-06-04 18:03:04,552 INFO L175 Difference]: Start difference. First operand has 244 places, 338 transitions, 5890 flow. Second operand 10 states and 172 transitions. [2024-06-04 18:03:04,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 384 transitions, 6820 flow [2024-06-04 18:03:05,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 384 transitions, 6617 flow, removed 57 selfloop flow, removed 6 redundant places. [2024-06-04 18:03:05,939 INFO L231 Difference]: Finished difference. Result has 249 places, 340 transitions, 5857 flow [2024-06-04 18:03:05,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5687, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5857, PETRI_PLACES=249, PETRI_TRANSITIONS=340} [2024-06-04 18:03:05,939 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 207 predicate places. [2024-06-04 18:03:05,940 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 340 transitions, 5857 flow [2024-06-04 18:03:05,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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) [2024-06-04 18:03:05,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:05,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:05,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 18:03:05,940 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:03:05,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1381606484, now seen corresponding path program 3 times [2024-06-04 18:03:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152762109] [2024-06-04 18:03:05,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:05,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:03:13,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152762109] [2024-06-04 18:03:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152762109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:13,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:13,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:03:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11568567] [2024-06-04 18:03:13,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:13,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:03:13,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:03:13,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:03:14,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:03:14,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 340 transitions, 5857 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 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) [2024-06-04 18:03:14,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:14,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:03:14,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:17,678 INFO L124 PetriNetUnfolderBase]: 6717/10317 cut-off events. [2024-06-04 18:03:17,678 INFO L125 PetriNetUnfolderBase]: For 748224/748226 co-relation queries the response was YES. [2024-06-04 18:03:17,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94292 conditions, 10317 events. 6717/10317 cut-off events. For 748224/748226 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 63345 event pairs, 2194 based on Foata normal form. 26/10342 useless extension candidates. Maximal degree in co-relation 94169. Up to 9651 conditions per place. [2024-06-04 18:03:17,799 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 337 selfloop transitions, 66 changer transitions 0/406 dead transitions. [2024-06-04 18:03:17,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 406 transitions, 7467 flow [2024-06-04 18:03:17,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:03:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:03:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2024-06-04 18:03:17,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3780487804878049 [2024-06-04 18:03:17,802 INFO L175 Difference]: Start difference. First operand has 249 places, 340 transitions, 5857 flow. Second operand 10 states and 155 transitions. [2024-06-04 18:03:17,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 406 transitions, 7467 flow [2024-06-04 18:03:19,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 406 transitions, 7171 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-06-04 18:03:19,220 INFO L231 Difference]: Finished difference. Result has 253 places, 366 transitions, 6366 flow [2024-06-04 18:03:19,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5629, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6366, PETRI_PLACES=253, PETRI_TRANSITIONS=366} [2024-06-04 18:03:19,220 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 211 predicate places. [2024-06-04 18:03:19,221 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 366 transitions, 6366 flow [2024-06-04 18:03:19,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 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) [2024-06-04 18:03:19,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:19,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:19,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 18:03:19,221 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:03:19,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:19,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1191179032, now seen corresponding path program 1 times [2024-06-04 18:03:19,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:19,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181805875] [2024-06-04 18:03:19,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:19,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:03:28,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:28,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181805875] [2024-06-04 18:03:28,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181805875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:28,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:28,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:03:28,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098387316] [2024-06-04 18:03:28,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:28,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:03:28,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:28,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:03:28,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:03:28,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:03:28,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 366 transitions, 6366 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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) [2024-06-04 18:03:28,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:28,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:03:28,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:31,767 INFO L124 PetriNetUnfolderBase]: 6762/10379 cut-off events. [2024-06-04 18:03:31,768 INFO L125 PetriNetUnfolderBase]: For 758065/758065 co-relation queries the response was YES. [2024-06-04 18:03:31,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95633 conditions, 10379 events. 6762/10379 cut-off events. For 758065/758065 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 63528 event pairs, 2381 based on Foata normal form. 6/10384 useless extension candidates. Maximal degree in co-relation 95506. Up to 10299 conditions per place. [2024-06-04 18:03:31,880 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 363 selfloop transitions, 30 changer transitions 0/396 dead transitions. [2024-06-04 18:03:31,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 396 transitions, 7489 flow [2024-06-04 18:03:31,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:03:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:03:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-04 18:03:31,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36890243902439024 [2024-06-04 18:03:31,881 INFO L175 Difference]: Start difference. First operand has 253 places, 366 transitions, 6366 flow. Second operand 8 states and 121 transitions. [2024-06-04 18:03:31,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 396 transitions, 7489 flow [2024-06-04 18:03:33,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 396 transitions, 7358 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-04 18:03:33,401 INFO L231 Difference]: Finished difference. Result has 256 places, 378 transitions, 6569 flow [2024-06-04 18:03:33,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6235, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6569, PETRI_PLACES=256, PETRI_TRANSITIONS=378} [2024-06-04 18:03:33,401 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 214 predicate places. [2024-06-04 18:03:33,401 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 378 transitions, 6569 flow [2024-06-04 18:03:33,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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) [2024-06-04 18:03:33,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:33,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:33,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 18:03:33,402 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:03:33,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:33,402 INFO L85 PathProgramCache]: Analyzing trace with hash 211185322, now seen corresponding path program 4 times [2024-06-04 18:03:33,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:33,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465304738] [2024-06-04 18:03:33,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:33,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:03:41,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:41,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465304738] [2024-06-04 18:03:41,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465304738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:41,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:41,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:03:41,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226834233] [2024-06-04 18:03:41,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:41,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:03:41,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:41,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:03:41,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:03:41,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:03:41,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 378 transitions, 6569 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:03:41,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:41,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:03:41,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:44,853 INFO L124 PetriNetUnfolderBase]: 6742/10349 cut-off events. [2024-06-04 18:03:44,853 INFO L125 PetriNetUnfolderBase]: For 773053/773055 co-relation queries the response was YES. [2024-06-04 18:03:44,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94929 conditions, 10349 events. 6742/10349 cut-off events. For 773053/773055 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 63287 event pairs, 2270 based on Foata normal form. 12/10360 useless extension candidates. Maximal degree in co-relation 94801. Up to 10165 conditions per place. [2024-06-04 18:03:44,974 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 384 selfloop transitions, 19 changer transitions 0/406 dead transitions. [2024-06-04 18:03:44,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 406 transitions, 7459 flow [2024-06-04 18:03:44,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:03:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:03:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-04 18:03:44,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 18:03:44,977 INFO L175 Difference]: Start difference. First operand has 256 places, 378 transitions, 6569 flow. Second operand 8 states and 128 transitions. [2024-06-04 18:03:44,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 406 transitions, 7459 flow [2024-06-04 18:03:46,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 406 transitions, 7306 flow, removed 52 selfloop flow, removed 5 redundant places. [2024-06-04 18:03:46,654 INFO L231 Difference]: Finished difference. Result has 259 places, 378 transitions, 6460 flow [2024-06-04 18:03:46,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6416, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6460, PETRI_PLACES=259, PETRI_TRANSITIONS=378} [2024-06-04 18:03:46,655 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places. [2024-06-04 18:03:46,655 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 378 transitions, 6460 flow [2024-06-04 18:03:46,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:03:46,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:46,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:46,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 18:03:46,656 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:03:46,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash -394721190, now seen corresponding path program 2 times [2024-06-04 18:03:46,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:46,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122679912] [2024-06-04 18:03:46,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:46,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:03:54,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:54,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122679912] [2024-06-04 18:03:54,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122679912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:54,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:54,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:03:54,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433884662] [2024-06-04 18:03:54,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:54,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:03:54,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:54,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:03:54,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:03:54,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:03:54,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 378 transitions, 6460 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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) [2024-06-04 18:03:54,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:54,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:03:54,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:58,380 INFO L124 PetriNetUnfolderBase]: 6722/10319 cut-off events. [2024-06-04 18:03:58,380 INFO L125 PetriNetUnfolderBase]: For 786267/786267 co-relation queries the response was YES. [2024-06-04 18:03:58,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94670 conditions, 10319 events. 6722/10319 cut-off events. For 786267/786267 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 63121 event pairs, 2359 based on Foata normal form. 6/10324 useless extension candidates. Maximal degree in co-relation 94541. Up to 10203 conditions per place. [2024-06-04 18:03:58,504 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 357 selfloop transitions, 40 changer transitions 0/400 dead transitions. [2024-06-04 18:03:58,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 400 transitions, 7428 flow [2024-06-04 18:03:58,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:03:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:03:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-04 18:03:58,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-04 18:03:58,506 INFO L175 Difference]: Start difference. First operand has 259 places, 378 transitions, 6460 flow. Second operand 6 states and 104 transitions. [2024-06-04 18:03:58,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 400 transitions, 7428 flow [2024-06-04 18:04:00,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 400 transitions, 7319 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-04 18:04:00,216 INFO L231 Difference]: Finished difference. Result has 258 places, 381 transitions, 6551 flow [2024-06-04 18:04:00,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6351, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6551, PETRI_PLACES=258, PETRI_TRANSITIONS=381} [2024-06-04 18:04:00,216 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 216 predicate places. [2024-06-04 18:04:00,216 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 381 transitions, 6551 flow [2024-06-04 18:04:00,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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) [2024-06-04 18:04:00,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:00,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:00,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 18:04:00,217 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:04:00,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash 749476946, now seen corresponding path program 2 times [2024-06-04 18:04:00,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:00,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658120548] [2024-06-04 18:04:00,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:00,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:04:09,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:09,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658120548] [2024-06-04 18:04:09,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658120548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:09,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:09,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:04:09,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414703950] [2024-06-04 18:04:09,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:09,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:04:09,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:09,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:04:09,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:04:09,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:04:09,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 381 transitions, 6551 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:04:09,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:09,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:04:09,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:13,304 INFO L124 PetriNetUnfolderBase]: 6833/10472 cut-off events. [2024-06-04 18:04:13,304 INFO L125 PetriNetUnfolderBase]: For 825779/825787 co-relation queries the response was YES. [2024-06-04 18:04:13,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96525 conditions, 10472 events. 6833/10472 cut-off events. For 825779/825787 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 64131 event pairs, 2045 based on Foata normal form. 22/10493 useless extension candidates. Maximal degree in co-relation 96396. Up to 9386 conditions per place. [2024-06-04 18:04:13,407 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 287 selfloop transitions, 153 changer transitions 0/443 dead transitions. [2024-06-04 18:04:13,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 443 transitions, 8202 flow [2024-06-04 18:04:13,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:04:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:04:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-04 18:04:13,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49085365853658536 [2024-06-04 18:04:13,408 INFO L175 Difference]: Start difference. First operand has 258 places, 381 transitions, 6551 flow. Second operand 8 states and 161 transitions. [2024-06-04 18:04:13,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 443 transitions, 8202 flow [2024-06-04 18:04:15,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 443 transitions, 8071 flow, removed 33 selfloop flow, removed 5 redundant places. [2024-06-04 18:04:15,064 INFO L231 Difference]: Finished difference. Result has 263 places, 401 transitions, 7330 flow [2024-06-04 18:04:15,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6440, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7330, PETRI_PLACES=263, PETRI_TRANSITIONS=401} [2024-06-04 18:04:15,064 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 221 predicate places. [2024-06-04 18:04:15,065 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 401 transitions, 7330 flow [2024-06-04 18:04:15,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:04:15,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:15,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:15,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 18:04:15,065 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:04:15,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:15,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1069352936, now seen corresponding path program 5 times [2024-06-04 18:04:15,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:15,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760450747] [2024-06-04 18:04:15,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:15,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:04:24,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:24,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760450747] [2024-06-04 18:04:24,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760450747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:24,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:24,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:04:24,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568457474] [2024-06-04 18:04:24,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:24,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:04:24,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:24,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:04:24,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:04:24,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:04:24,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 401 transitions, 7330 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:04:24,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:24,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:04:24,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:28,653 INFO L124 PetriNetUnfolderBase]: 8222/12581 cut-off events. [2024-06-04 18:04:28,653 INFO L125 PetriNetUnfolderBase]: For 1067425/1067427 co-relation queries the response was YES. [2024-06-04 18:04:28,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120583 conditions, 12581 events. 8222/12581 cut-off events. For 1067425/1067427 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 78825 event pairs, 2298 based on Foata normal form. 68/12648 useless extension candidates. Maximal degree in co-relation 120452. Up to 10463 conditions per place. [2024-06-04 18:04:28,813 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 445 selfloop transitions, 105 changer transitions 0/553 dead transitions. [2024-06-04 18:04:28,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 553 transitions, 10884 flow [2024-06-04 18:04:28,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:04:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:04:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-04 18:04:28,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48048780487804876 [2024-06-04 18:04:28,815 INFO L175 Difference]: Start difference. First operand has 263 places, 401 transitions, 7330 flow. Second operand 10 states and 197 transitions. [2024-06-04 18:04:28,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 553 transitions, 10884 flow [2024-06-04 18:04:31,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 553 transitions, 10521 flow, removed 71 selfloop flow, removed 9 redundant places. [2024-06-04 18:04:31,512 INFO L231 Difference]: Finished difference. Result has 268 places, 472 transitions, 8863 flow [2024-06-04 18:04:31,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6951, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8863, PETRI_PLACES=268, PETRI_TRANSITIONS=472} [2024-06-04 18:04:31,513 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 226 predicate places. [2024-06-04 18:04:31,513 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 472 transitions, 8863 flow [2024-06-04 18:04:31,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:04:31,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:31,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:31,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 18:04:31,514 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:04:31,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:31,514 INFO L85 PathProgramCache]: Analyzing trace with hash 134654113, now seen corresponding path program 1 times [2024-06-04 18:04:31,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:31,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031901857] [2024-06-04 18:04:31,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:31,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:04:42,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:42,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031901857] [2024-06-04 18:04:42,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031901857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:42,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:42,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:04:42,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134865950] [2024-06-04 18:04:42,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:42,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:04:42,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:42,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:04:42,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:04:42,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:04:42,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 472 transitions, 8863 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 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) [2024-06-04 18:04:42,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:42,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:04:42,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:46,708 INFO L124 PetriNetUnfolderBase]: 8242/12609 cut-off events. [2024-06-04 18:04:46,709 INFO L125 PetriNetUnfolderBase]: For 894505/894505 co-relation queries the response was YES. [2024-06-04 18:04:46,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120596 conditions, 12609 events. 8242/12609 cut-off events. For 894505/894505 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 79112 event pairs, 3114 based on Foata normal form. 4/12612 useless extension candidates. Maximal degree in co-relation 120464. Up to 12446 conditions per place. [2024-06-04 18:04:46,873 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 458 selfloop transitions, 41 changer transitions 0/502 dead transitions. [2024-06-04 18:04:46,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 502 transitions, 10169 flow [2024-06-04 18:04:46,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:04:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:04:46,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-04 18:04:46,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37398373983739835 [2024-06-04 18:04:46,874 INFO L175 Difference]: Start difference. First operand has 268 places, 472 transitions, 8863 flow. Second operand 9 states and 138 transitions. [2024-06-04 18:04:46,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 502 transitions, 10169 flow [2024-06-04 18:04:49,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 502 transitions, 9951 flow, removed 70 selfloop flow, removed 3 redundant places. [2024-06-04 18:04:49,020 INFO L231 Difference]: Finished difference. Result has 274 places, 478 transitions, 8857 flow [2024-06-04 18:04:49,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8647, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8857, PETRI_PLACES=274, PETRI_TRANSITIONS=478} [2024-06-04 18:04:49,021 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 232 predicate places. [2024-06-04 18:04:49,021 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 478 transitions, 8857 flow [2024-06-04 18:04:49,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 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) [2024-06-04 18:04:49,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:49,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:49,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 18:04:49,022 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:04:49,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1560463935, now seen corresponding path program 2 times [2024-06-04 18:04:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:49,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758643431] [2024-06-04 18:04:49,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:49,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:04:59,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:59,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758643431] [2024-06-04 18:04:59,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758643431] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:59,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:59,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:04:59,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605997952] [2024-06-04 18:04:59,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:59,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:04:59,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:59,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:04:59,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:04:59,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:04:59,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 478 transitions, 8857 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:04:59,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:59,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:04:59,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:05:04,683 INFO L124 PetriNetUnfolderBase]: 8297/12686 cut-off events. [2024-06-04 18:05:04,683 INFO L125 PetriNetUnfolderBase]: For 891482/891482 co-relation queries the response was YES. [2024-06-04 18:05:04,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120522 conditions, 12686 events. 8297/12686 cut-off events. For 891482/891482 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 79631 event pairs, 3114 based on Foata normal form. 4/12689 useless extension candidates. Maximal degree in co-relation 120389. Up to 12579 conditions per place. [2024-06-04 18:05:04,819 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 476 selfloop transitions, 32 changer transitions 0/511 dead transitions. [2024-06-04 18:05:04,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 511 transitions, 10143 flow [2024-06-04 18:05:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:05:04,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:05:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-04 18:05:04,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-04 18:05:04,821 INFO L175 Difference]: Start difference. First operand has 274 places, 478 transitions, 8857 flow. Second operand 8 states and 126 transitions. [2024-06-04 18:05:04,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 511 transitions, 10143 flow [2024-06-04 18:05:06,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 511 transitions, 10038 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-06-04 18:05:06,890 INFO L231 Difference]: Finished difference. Result has 278 places, 488 transitions, 9022 flow [2024-06-04 18:05:06,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8762, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9022, PETRI_PLACES=278, PETRI_TRANSITIONS=488} [2024-06-04 18:05:06,891 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 236 predicate places. [2024-06-04 18:05:06,891 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 488 transitions, 9022 flow [2024-06-04 18:05:06,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:05:06,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:05:06,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:05:06,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 18:05:06,892 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:05:06,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:05:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1036699757, now seen corresponding path program 3 times [2024-06-04 18:05:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:05:06,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361252118] [2024-06-04 18:05:06,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:05:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:05:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:05:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:05:16,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:05:16,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361252118] [2024-06-04 18:05:16,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361252118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:05:16,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:05:16,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:05:16,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811212746] [2024-06-04 18:05:16,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:05:16,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:05:16,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:05:16,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:05:16,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:05:16,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:05:16,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 488 transitions, 9022 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:05:16,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:05:16,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:05:16,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:05:20,895 INFO L124 PetriNetUnfolderBase]: 8285/12670 cut-off events. [2024-06-04 18:05:20,895 INFO L125 PetriNetUnfolderBase]: For 914031/914031 co-relation queries the response was YES. [2024-06-04 18:05:21,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120777 conditions, 12670 events. 8285/12670 cut-off events. For 914031/914031 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 79538 event pairs, 3106 based on Foata normal form. 4/12673 useless extension candidates. Maximal degree in co-relation 120641. Up to 12504 conditions per place. [2024-06-04 18:05:21,072 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 460 selfloop transitions, 46 changer transitions 0/509 dead transitions. [2024-06-04 18:05:21,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 509 transitions, 10118 flow [2024-06-04 18:05:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:05:21,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:05:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-04 18:05:21,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-04 18:05:21,074 INFO L175 Difference]: Start difference. First operand has 278 places, 488 transitions, 9022 flow. Second operand 7 states and 117 transitions. [2024-06-04 18:05:21,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 509 transitions, 10118 flow [2024-06-04 18:05:23,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 509 transitions, 9994 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-06-04 18:05:23,776 INFO L231 Difference]: Finished difference. Result has 280 places, 488 transitions, 9002 flow [2024-06-04 18:05:23,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8898, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9002, PETRI_PLACES=280, PETRI_TRANSITIONS=488} [2024-06-04 18:05:23,776 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 238 predicate places. [2024-06-04 18:05:23,777 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 488 transitions, 9002 flow [2024-06-04 18:05:23,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:05:23,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:05:23,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:05:23,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 18:05:23,777 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:05:23,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:05:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash -423598362, now seen corresponding path program 1 times [2024-06-04 18:05:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:05:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097716109] [2024-06-04 18:05:23,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:05:23,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:05:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:05:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:05:33,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:05:33,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097716109] [2024-06-04 18:05:33,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097716109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:05:33,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:05:33,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:05:33,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266646083] [2024-06-04 18:05:33,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:05:33,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:05:33,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:05:33,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:05:33,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:05:34,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:05:34,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 488 transitions, 9002 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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) [2024-06-04 18:05:34,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:05:34,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:05:34,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:05:38,835 INFO L124 PetriNetUnfolderBase]: 8472/12951 cut-off events. [2024-06-04 18:05:38,835 INFO L125 PetriNetUnfolderBase]: For 972025/972035 co-relation queries the response was YES. [2024-06-04 18:05:38,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124656 conditions, 12951 events. 8472/12951 cut-off events. For 972025/972035 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 81356 event pairs, 2135 based on Foata normal form. 14/12964 useless extension candidates. Maximal degree in co-relation 124519. Up to 11913 conditions per place. [2024-06-04 18:05:39,006 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 418 selfloop transitions, 123 changer transitions 0/544 dead transitions. [2024-06-04 18:05:39,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 544 transitions, 10768 flow [2024-06-04 18:05:39,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:05:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:05:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-04 18:05:39,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45257452574525747 [2024-06-04 18:05:39,007 INFO L175 Difference]: Start difference. First operand has 280 places, 488 transitions, 9002 flow. Second operand 9 states and 167 transitions. [2024-06-04 18:05:39,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 544 transitions, 10768 flow [2024-06-04 18:05:41,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 544 transitions, 10636 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-04 18:05:41,915 INFO L231 Difference]: Finished difference. Result has 285 places, 499 transitions, 9493 flow [2024-06-04 18:05:41,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8876, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9493, PETRI_PLACES=285, PETRI_TRANSITIONS=499} [2024-06-04 18:05:41,916 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 243 predicate places. [2024-06-04 18:05:41,916 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 499 transitions, 9493 flow [2024-06-04 18:05:41,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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) [2024-06-04 18:05:41,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:05:41,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:05:41,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 18:05:41,917 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:05:41,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:05:41,917 INFO L85 PathProgramCache]: Analyzing trace with hash -423359042, now seen corresponding path program 1 times [2024-06-04 18:05:41,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:05:41,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877760080] [2024-06-04 18:05:41,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:05:41,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:05:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:05:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:05:52,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:05:52,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877760080] [2024-06-04 18:05:52,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877760080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:05:52,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:05:52,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:05:52,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594306968] [2024-06-04 18:05:52,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:05:52,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:05:52,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:05:52,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:05:52,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:05:52,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:05:52,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 499 transitions, 9493 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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) [2024-06-04 18:05:52,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:05:52,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:05:52,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:05:56,981 INFO L124 PetriNetUnfolderBase]: 8508/13001 cut-off events. [2024-06-04 18:05:56,981 INFO L125 PetriNetUnfolderBase]: For 984822/984832 co-relation queries the response was YES. [2024-06-04 18:05:57,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126687 conditions, 13001 events. 8508/13001 cut-off events. For 984822/984832 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 81952 event pairs, 2399 based on Foata normal form. 14/13014 useless extension candidates. Maximal degree in co-relation 126547. Up to 12259 conditions per place. [2024-06-04 18:05:57,137 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 422 selfloop transitions, 118 changer transitions 0/543 dead transitions. [2024-06-04 18:05:57,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 543 transitions, 11027 flow [2024-06-04 18:05:57,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:05:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:05:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-04 18:05:57,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-04 18:05:57,138 INFO L175 Difference]: Start difference. First operand has 285 places, 499 transitions, 9493 flow. Second operand 9 states and 159 transitions. [2024-06-04 18:05:57,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 543 transitions, 11027 flow [2024-06-04 18:05:59,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 543 transitions, 10885 flow, removed 49 selfloop flow, removed 3 redundant places. [2024-06-04 18:05:59,705 INFO L231 Difference]: Finished difference. Result has 291 places, 507 transitions, 9814 flow [2024-06-04 18:05:59,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9351, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9814, PETRI_PLACES=291, PETRI_TRANSITIONS=507} [2024-06-04 18:05:59,705 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 249 predicate places. [2024-06-04 18:05:59,705 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 507 transitions, 9814 flow [2024-06-04 18:05:59,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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) [2024-06-04 18:05:59,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:05:59,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:05:59,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 18:05:59,706 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:05:59,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:05:59,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2050242190, now seen corresponding path program 2 times [2024-06-04 18:05:59,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:05:59,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930421946] [2024-06-04 18:05:59,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:05:59,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:05:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:06:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:06:09,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:06:09,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930421946] [2024-06-04 18:06:09,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930421946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:06:09,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:06:09,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:06:09,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332772461] [2024-06-04 18:06:09,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:06:09,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:06:09,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:06:09,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:06:09,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:06:09,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:06:09,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 507 transitions, 9814 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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) [2024-06-04 18:06:09,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:06:09,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:06:09,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:06:14,527 INFO L124 PetriNetUnfolderBase]: 8524/13025 cut-off events. [2024-06-04 18:06:14,527 INFO L125 PetriNetUnfolderBase]: For 1027534/1027544 co-relation queries the response was YES. [2024-06-04 18:06:14,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128797 conditions, 13025 events. 8524/13025 cut-off events. For 1027534/1027544 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 82117 event pairs, 2528 based on Foata normal form. 14/13038 useless extension candidates. Maximal degree in co-relation 128655. Up to 12518 conditions per place. [2024-06-04 18:06:14,692 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 471 selfloop transitions, 70 changer transitions 0/544 dead transitions. [2024-06-04 18:06:14,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 544 transitions, 11107 flow [2024-06-04 18:06:14,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:06:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:06:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-04 18:06:14,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42005420054200543 [2024-06-04 18:06:14,694 INFO L175 Difference]: Start difference. First operand has 291 places, 507 transitions, 9814 flow. Second operand 9 states and 155 transitions. [2024-06-04 18:06:14,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 544 transitions, 11107 flow [2024-06-04 18:06:18,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 544 transitions, 10932 flow, removed 57 selfloop flow, removed 4 redundant places. [2024-06-04 18:06:18,067 INFO L231 Difference]: Finished difference. Result has 296 places, 510 transitions, 9878 flow [2024-06-04 18:06:18,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9639, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9878, PETRI_PLACES=296, PETRI_TRANSITIONS=510} [2024-06-04 18:06:18,068 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 254 predicate places. [2024-06-04 18:06:18,068 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 510 transitions, 9878 flow [2024-06-04 18:06:18,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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) [2024-06-04 18:06:18,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:06:18,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:06:18,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 18:06:18,069 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:06:18,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:06:18,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2058574370, now seen corresponding path program 2 times [2024-06-04 18:06:18,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:06:18,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084070057] [2024-06-04 18:06:18,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:06:18,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:06:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:06:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:06:28,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:06:28,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084070057] [2024-06-04 18:06:28,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084070057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:06:28,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:06:28,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:06:28,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169999215] [2024-06-04 18:06:28,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:06:28,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:06:28,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:06:28,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:06:28,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:06:28,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:06:28,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 510 transitions, 9878 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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) [2024-06-04 18:06:28,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:06:28,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:06:28,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:06:33,085 INFO L124 PetriNetUnfolderBase]: 8574/13095 cut-off events. [2024-06-04 18:06:33,085 INFO L125 PetriNetUnfolderBase]: For 1061106/1061116 co-relation queries the response was YES. [2024-06-04 18:06:33,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130340 conditions, 13095 events. 8574/13095 cut-off events. For 1061106/1061116 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 82533 event pairs, 2528 based on Foata normal form. 14/13108 useless extension candidates. Maximal degree in co-relation 130196. Up to 12659 conditions per place. [2024-06-04 18:06:33,552 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 480 selfloop transitions, 66 changer transitions 0/549 dead transitions. [2024-06-04 18:06:33,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 549 transitions, 11289 flow [2024-06-04 18:06:33,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:06:33,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:06:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-04 18:06:33,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092140921409214 [2024-06-04 18:06:33,554 INFO L175 Difference]: Start difference. First operand has 296 places, 510 transitions, 9878 flow. Second operand 9 states and 151 transitions. [2024-06-04 18:06:33,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 549 transitions, 11289 flow [2024-06-04 18:06:36,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 549 transitions, 11071 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-06-04 18:06:36,657 INFO L231 Difference]: Finished difference. Result has 299 places, 519 transitions, 10023 flow [2024-06-04 18:06:36,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9670, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10023, PETRI_PLACES=299, PETRI_TRANSITIONS=519} [2024-06-04 18:06:36,658 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 257 predicate places. [2024-06-04 18:06:36,659 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 519 transitions, 10023 flow [2024-06-04 18:06:36,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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) [2024-06-04 18:06:36,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:06:36,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:06:36,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 18:06:36,659 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:06:36,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:06:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1944557144, now seen corresponding path program 1 times [2024-06-04 18:06:36,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:06:36,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13103033] [2024-06-04 18:06:36,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:06:36,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:06:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:06:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:06:44,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:06:44,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13103033] [2024-06-04 18:06:44,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13103033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:06:44,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:06:44,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:06:44,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216666406] [2024-06-04 18:06:44,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:06:44,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:06:44,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:06:44,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:06:44,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:06:44,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:06:44,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 519 transitions, 10023 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 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) [2024-06-04 18:06:44,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:06:44,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:06:44,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:06:50,045 INFO L124 PetriNetUnfolderBase]: 8668/13230 cut-off events. [2024-06-04 18:06:50,045 INFO L125 PetriNetUnfolderBase]: For 1113232/1113234 co-relation queries the response was YES. [2024-06-04 18:06:50,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132700 conditions, 13230 events. 8668/13230 cut-off events. For 1113232/1113234 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 83285 event pairs, 2563 based on Foata normal form. 8/13237 useless extension candidates. Maximal degree in co-relation 132554. Up to 11872 conditions per place. [2024-06-04 18:06:50,202 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 502 selfloop transitions, 160 changer transitions 2/667 dead transitions. [2024-06-04 18:06:50,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 667 transitions, 14259 flow [2024-06-04 18:06:50,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:06:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:06:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-04 18:06:50,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 18:06:50,204 INFO L175 Difference]: Start difference. First operand has 299 places, 519 transitions, 10023 flow. Second operand 9 states and 162 transitions. [2024-06-04 18:06:50,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 667 transitions, 14259 flow [2024-06-04 18:06:53,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 667 transitions, 14037 flow, removed 47 selfloop flow, removed 5 redundant places. [2024-06-04 18:06:53,130 INFO L231 Difference]: Finished difference. Result has 307 places, 590 transitions, 11962 flow [2024-06-04 18:06:53,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9838, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11962, PETRI_PLACES=307, PETRI_TRANSITIONS=590} [2024-06-04 18:06:53,130 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 265 predicate places. [2024-06-04 18:06:53,131 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 590 transitions, 11962 flow [2024-06-04 18:06:53,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 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) [2024-06-04 18:06:53,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:06:53,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:06:53,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 18:06:53,131 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:06:53,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:06:53,132 INFO L85 PathProgramCache]: Analyzing trace with hash -305148540, now seen corresponding path program 2 times [2024-06-04 18:06:53,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:06:53,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354187518] [2024-06-04 18:06:53,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:06:53,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:06:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:07:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:07:01,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:07:01,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354187518] [2024-06-04 18:07:01,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354187518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:07:01,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:07:01,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:07:01,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530339142] [2024-06-04 18:07:01,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:07:01,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:07:01,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:07:01,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:07:01,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:07:01,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:07:01,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 590 transitions, 11962 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:07:01,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:07:01,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:07:01,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:07:06,807 INFO L124 PetriNetUnfolderBase]: 8855/13481 cut-off events. [2024-06-04 18:07:06,807 INFO L125 PetriNetUnfolderBase]: For 1217399/1217401 co-relation queries the response was YES. [2024-06-04 18:07:06,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139927 conditions, 13481 events. 8855/13481 cut-off events. For 1217399/1217401 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 84392 event pairs, 2414 based on Foata normal form. 32/13512 useless extension candidates. Maximal degree in co-relation 139776. Up to 12872 conditions per place. [2024-06-04 18:07:06,972 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 555 selfloop transitions, 97 changer transitions 0/655 dead transitions. [2024-06-04 18:07:06,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 655 transitions, 14362 flow [2024-06-04 18:07:06,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:07:06,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:07:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-04 18:07:06,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 18:07:06,974 INFO L175 Difference]: Start difference. First operand has 307 places, 590 transitions, 11962 flow. Second operand 9 states and 153 transitions. [2024-06-04 18:07:06,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 655 transitions, 14362 flow [2024-06-04 18:07:10,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 655 transitions, 14147 flow, removed 103 selfloop flow, removed 2 redundant places. [2024-06-04 18:07:10,172 INFO L231 Difference]: Finished difference. Result has 315 places, 626 transitions, 12892 flow [2024-06-04 18:07:10,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11759, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12892, PETRI_PLACES=315, PETRI_TRANSITIONS=626} [2024-06-04 18:07:10,173 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 273 predicate places. [2024-06-04 18:07:10,173 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 626 transitions, 12892 flow [2024-06-04 18:07:10,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) [2024-06-04 18:07:10,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:07:10,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:07:10,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 18:07:10,174 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:07:10,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:07:10,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1750102606, now seen corresponding path program 3 times [2024-06-04 18:07:10,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:07:10,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797818170] [2024-06-04 18:07:10,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:07:10,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:07:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat