./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix003.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-06-19_11-23-25.files/mutex-meet-rel/mix003.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb4cb34f 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/mix003.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix003.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-eb4cb34-m [2024-06-21 18:19:40,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-21 18:19:40,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-21 18:19:40,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-21 18:19:40,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-21 18:19:41,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-21 18:19:41,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-21 18:19:41,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-21 18:19:41,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-21 18:19:41,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-21 18:19:41,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-21 18:19:41,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-21 18:19:41,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-21 18:19:41,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-21 18:19:41,009 INFO L153 SettingsManager]: * Use SBE=true [2024-06-21 18:19:41,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-21 18:19:41,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-21 18:19:41,009 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-21 18:19:41,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-21 18:19:41,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-21 18:19:41,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-21 18:19:41,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-21 18:19:41,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-21 18:19:41,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-21 18:19:41,011 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-21 18:19:41,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-21 18:19:41,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-21 18:19:41,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-21 18:19:41,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-21 18:19:41,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-21 18:19:41,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-21 18:19:41,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-21 18:19:41,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-21 18:19:41,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-21 18:19:41,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-21 18:19:41,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-21 18:19:41,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-21 18:19:41,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-21 18:19:41,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-21 18:19:41,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-21 18:19:41,015 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-21 18:19:41,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-21 18:19:41,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-21 18:19:41,016 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-21 18:19:41,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-21 18:19:41,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-21 18:19:41,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-21 18:19:41,210 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-21 18:19:41,211 INFO L274 PluginConnector]: CDTParser initialized [2024-06-21 18:19:41,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2024-06-21 18:19:42,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-21 18:19:42,539 INFO L384 CDTParser]: Found 1 translation units. [2024-06-21 18:19:42,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2024-06-21 18:19:42,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e700f4c/a03e4a9296b2402f86e8088f1ccaa64b/FLAGa335d95d5 [2024-06-21 18:19:42,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e700f4c/a03e4a9296b2402f86e8088f1ccaa64b [2024-06-21 18:19:42,583 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-21 18:19:42,584 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-21 18:19:42,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix003.oepc.yml/witness.yml [2024-06-21 18:19:42,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-21 18:19:42,662 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-21 18:19:42,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-21 18:19:42,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-21 18:19:42,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-21 18:19:42,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 06:19:42" (1/2) ... [2024-06-21 18:19:42,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fcf9351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:19:42, skipping insertion in model container [2024-06-21 18:19:42,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 06:19:42" (1/2) ... [2024-06-21 18:19:42,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@44f0ec9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:19:42, skipping insertion in model container [2024-06-21 18:19:42,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 06:19:42" (2/2) ... [2024-06-21 18:19:42,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fcf9351 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:19:42, skipping insertion in model container [2024-06-21 18:19:42,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 06:19:42" (2/2) ... [2024-06-21 18:19:42,675 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-21 18:19:42,696 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-21 18:19:42,697 INFO L97 edCorrectnessWitness]: Location invariant before [L848-L848] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0_used >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff0_used >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff0_used >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff0_used >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0_used >= 0LL) && (1LL + (long long )z$w_buff0_used) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$mem_tmp >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-21 18:19:42,697 INFO L97 edCorrectnessWitness]: Location invariant before [L850-L850] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0_used >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff0_used >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff0_used >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff0_used >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0_used >= 0LL) && (1LL + (long long )z$w_buff0_used) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$mem_tmp >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-21 18:19:42,697 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0_used >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff0_used >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff0_used >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff0_used >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0_used >= 0LL) && (1LL + (long long )z$w_buff0_used) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$mem_tmp >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-21 18:19:42,698 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-21 18:19:42,698 INFO L106 edCorrectnessWitness]: ghost_update [L846-L846] multithreaded = 1; [2024-06-21 18:19:42,739 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-21 18:19:43,103 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-21 18:19:43,121 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-21 18:19:43,307 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-21 18:19:43,340 INFO L206 MainTranslator]: Completed translation [2024-06-21 18:19:43,341 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:19:43 WrapperNode [2024-06-21 18:19:43,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-21 18:19:43,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-21 18:19:43,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-21 18:19:43,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-21 18:19:43,347 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 21.06 06:19:43" (1/1) ... [2024-06-21 18:19:43,385 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 21.06 06:19:43" (1/1) ... [2024-06-21 18:19:43,437 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128 [2024-06-21 18:19:43,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-21 18:19:43,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-21 18:19:43,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-21 18:19:43,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-21 18:19:43,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:19:43" (1/1) ... [2024-06-21 18:19:43,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:19:43" (1/1) ... [2024-06-21 18:19:43,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:19:43" (1/1) ... [2024-06-21 18:19:43,505 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-21 18:19:43,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:19:43" (1/1) ... [2024-06-21 18:19:43,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:19:43" (1/1) ... [2024-06-21 18:19:43,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:19:43" (1/1) ... [2024-06-21 18:19:43,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:19:43" (1/1) ... [2024-06-21 18:19:43,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:19:43" (1/1) ... [2024-06-21 18:19:43,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:19:43" (1/1) ... [2024-06-21 18:19:43,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-21 18:19:43,548 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-21 18:19:43,548 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-21 18:19:43,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-21 18:19:43,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:19:43" (1/1) ... [2024-06-21 18:19:43,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-21 18:19:43,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-21 18:19:43,578 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-21 18:19:43,598 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-21 18:19:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-21 18:19:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-21 18:19:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-21 18:19:43,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-21 18:19:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-21 18:19:43,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-21 18:19:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-21 18:19:43,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-21 18:19:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-21 18:19:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-21 18:19:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-21 18:19:43,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-21 18:19:43,616 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-21 18:19:43,731 INFO L244 CfgBuilder]: Building ICFG [2024-06-21 18:19:43,733 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-21 18:19:44,199 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-21 18:19:44,200 INFO L293 CfgBuilder]: Performing block encoding [2024-06-21 18:19:44,382 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-21 18:19:44,383 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-21 18:19:44,383 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 06:19:44 BoogieIcfgContainer [2024-06-21 18:19:44,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-21 18:19:44,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-21 18:19:44,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-21 18:19:44,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-21 18:19:44,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.06 06:19:42" (1/4) ... [2024-06-21 18:19:44,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ffe173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 06:19:44, skipping insertion in model container [2024-06-21 18:19:44,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 06:19:42" (2/4) ... [2024-06-21 18:19:44,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ffe173 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 21.06 06:19:44, skipping insertion in model container [2024-06-21 18:19:44,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:19:43" (3/4) ... [2024-06-21 18:19:44,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ffe173 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 21.06 06:19:44, skipping insertion in model container [2024-06-21 18:19:44,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 06:19:44" (4/4) ... [2024-06-21 18:19:44,392 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003.oepc.i [2024-06-21 18:19:44,406 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-21 18:19:44,407 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-21 18:19:44,407 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-21 18:19:44,456 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-21 18:19:44,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-21 18:19:44,514 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-21 18:19:44,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-21 18:19:44,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-21 18:19:44,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-21 18:19:44,519 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-21 18:19:44,564 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-21 18:19:44,569 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;@141c27c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-21 18:19:44,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-21 18:19:44,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-21 18:19:44,588 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-21 18:19:44,588 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-21 18:19:44,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:19:44,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-21 18:19:44,590 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-21 18:19:44,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:19:44,594 INFO L85 PathProgramCache]: Analyzing trace with hash 380730443, now seen corresponding path program 1 times [2024-06-21 18:19:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:19:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722279631] [2024-06-21 18:19:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:19:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:19:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:19:46,307 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-21 18:19:46,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:19:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722279631] [2024-06-21 18:19:46,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722279631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:19:46,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:19:46,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-21 18:19:46,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365567610] [2024-06-21 18:19:46,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:19:46,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-21 18:19:46,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:19:46,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-21 18:19:46,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-21 18:19:46,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-06-21 18:19:46,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-21 18:19:46,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:19:46,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-06-21 18:19:46,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:19:46,792 INFO L124 PetriNetUnfolderBase]: 1116/1766 cut-off events. [2024-06-21 18:19:46,792 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-06-21 18:19:46,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 1766 events. 1116/1766 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8814 event pairs, 765 based on Foata normal form. 1/1713 useless extension candidates. Maximal degree in co-relation 3505. Up to 1676 conditions per place. [2024-06-21 18:19:46,804 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 31 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2024-06-21 18:19:46,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 171 flow [2024-06-21 18:19:46,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-21 18:19:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-21 18:19:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-06-21 18:19:46,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2024-06-21 18:19:46,814 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 80 transitions. [2024-06-21 18:19:46,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 171 flow [2024-06-21 18:19:46,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-21 18:19:46,819 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow [2024-06-21 18:19:46,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-21 18:19:46,822 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-21 18:19:46,822 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow [2024-06-21 18:19:46,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-21 18:19:46,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:19:46,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:19:46,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-21 18:19:46,823 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-21 18:19:46,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:19:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash 810521078, now seen corresponding path program 1 times [2024-06-21 18:19:46,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:19:46,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152192677] [2024-06-21 18:19:46,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:19:46,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:19:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:19:47,763 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-21 18:19:47,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:19:47,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152192677] [2024-06-21 18:19:47,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152192677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:19:47,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:19:47,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-21 18:19:47,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340063209] [2024-06-21 18:19:47,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:19:47,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-21 18:19:47,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:19:47,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-21 18:19:47,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-21 18:19:47,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-06-21 18:19:47,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-21 18:19:47,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:19:47,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-06-21 18:19:47,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:19:48,161 INFO L124 PetriNetUnfolderBase]: 1110/1773 cut-off events. [2024-06-21 18:19:48,161 INFO L125 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES. [2024-06-21 18:19:48,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 1773 events. 1110/1773 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8861 event pairs, 641 based on Foata normal form. 3/1758 useless extension candidates. Maximal degree in co-relation 3982. Up to 1652 conditions per place. [2024-06-21 18:19:48,169 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 38 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2024-06-21 18:19:48,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 238 flow [2024-06-21 18:19:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-21 18:19:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-21 18:19:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-06-21 18:19:48,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-06-21 18:19:48,171 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 104 transitions. [2024-06-21 18:19:48,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 238 flow [2024-06-21 18:19:48,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-21 18:19:48,173 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow [2024-06-21 18:19:48,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-21 18:19:48,174 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-06-21 18:19:48,174 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow [2024-06-21 18:19:48,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-21 18:19:48,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:19:48,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:19:48,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-21 18:19:48,175 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-21 18:19:48,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:19:48,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1521713301, now seen corresponding path program 1 times [2024-06-21 18:19:48,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:19:48,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879580157] [2024-06-21 18:19:48,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:19:48,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:19:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:19:49,875 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-21 18:19:49,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:19:49,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879580157] [2024-06-21 18:19:49,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879580157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:19:49,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:19:49,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:19:49,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009489463] [2024-06-21 18:19:49,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:19:49,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:19:49,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:19:49,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:19:49,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:19:49,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-21 18:19:49,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-21 18:19:49,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:19:49,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-21 18:19:49,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:19:50,375 INFO L124 PetriNetUnfolderBase]: 1345/2122 cut-off events. [2024-06-21 18:19:50,375 INFO L125 PetriNetUnfolderBase]: For 1153/1153 co-relation queries the response was YES. [2024-06-21 18:19:50,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5301 conditions, 2122 events. 1345/2122 cut-off events. For 1153/1153 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10709 event pairs, 592 based on Foata normal form. 3/2102 useless extension candidates. Maximal degree in co-relation 5287. Up to 1965 conditions per place. [2024-06-21 18:19:50,389 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 53 selfloop transitions, 13 changer transitions 0/73 dead transitions. [2024-06-21 18:19:50,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 372 flow [2024-06-21 18:19:50,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 18:19:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 18:19:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-06-21 18:19:50,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-21 18:19:50,394 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 6 states and 147 transitions. [2024-06-21 18:19:50,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 372 flow [2024-06-21 18:19:50,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 352 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-21 18:19:50,398 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 196 flow [2024-06-21 18:19:50,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-06-21 18:19:50,399 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-21 18:19:50,399 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 196 flow [2024-06-21 18:19:50,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-21 18:19:50,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:19:50,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:19:50,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-21 18:19:50,400 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-21 18:19:50,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:19:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash -927427979, now seen corresponding path program 1 times [2024-06-21 18:19:50,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:19:50,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840361364] [2024-06-21 18:19:50,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:19:50,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:19:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:19:52,547 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-21 18:19:52,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:19:52,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840361364] [2024-06-21 18:19:52,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840361364] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:19:52,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:19:52,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:19:52,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516635918] [2024-06-21 18:19:52,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:19:52,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:19:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:19:52,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:19:52,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:19:52,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-21 18:19:52,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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-21 18:19:52,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:19:52,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-21 18:19:52,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:19:53,171 INFO L124 PetriNetUnfolderBase]: 1336/2103 cut-off events. [2024-06-21 18:19:53,171 INFO L125 PetriNetUnfolderBase]: For 2265/2265 co-relation queries the response was YES. [2024-06-21 18:19:53,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5872 conditions, 2103 events. 1336/2103 cut-off events. For 2265/2265 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10534 event pairs, 450 based on Foata normal form. 6/2084 useless extension candidates. Maximal degree in co-relation 5856. Up to 1920 conditions per place. [2024-06-21 18:19:53,184 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 57 selfloop transitions, 15 changer transitions 0/79 dead transitions. [2024-06-21 18:19:53,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 432 flow [2024-06-21 18:19:53,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:19:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:19:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-21 18:19:53,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.564625850340136 [2024-06-21 18:19:53,187 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 196 flow. Second operand 7 states and 166 transitions. [2024-06-21 18:19:53,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 432 flow [2024-06-21 18:19:53,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 404 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-21 18:19:53,192 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 217 flow [2024-06-21 18:19:53,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-21 18:19:53,194 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2024-06-21 18:19:53,194 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 217 flow [2024-06-21 18:19:53,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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-21 18:19:53,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:19:53,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:19:53,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-21 18:19:53,195 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:19:53,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:19:53,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1592598440, now seen corresponding path program 1 times [2024-06-21 18:19:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:19:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043919642] [2024-06-21 18:19:53,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:19:53,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:19:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:19:54,623 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-21 18:19:54,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:19:54,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043919642] [2024-06-21 18:19:54,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043919642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:19:54,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:19:54,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-21 18:19:54,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060182078] [2024-06-21 18:19:54,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:19:54,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-21 18:19:54,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:19:54,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-21 18:19:54,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-21 18:19:54,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:19:54,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 217 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-21 18:19:54,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:19:54,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:19:54,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:19:55,271 INFO L124 PetriNetUnfolderBase]: 1627/2507 cut-off events. [2024-06-21 18:19:55,271 INFO L125 PetriNetUnfolderBase]: For 4170/4170 co-relation queries the response was YES. [2024-06-21 18:19:55,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7415 conditions, 2507 events. 1627/2507 cut-off events. For 4170/4170 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12312 event pairs, 963 based on Foata normal form. 2/2491 useless extension candidates. Maximal degree in co-relation 7397. Up to 2407 conditions per place. [2024-06-21 18:19:55,288 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 46 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2024-06-21 18:19:55,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 382 flow [2024-06-21 18:19:55,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-21 18:19:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-21 18:19:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-06-21 18:19:55,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-21 18:19:55,290 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 217 flow. Second operand 5 states and 97 transitions. [2024-06-21 18:19:55,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 382 flow [2024-06-21 18:19:55,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 341 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-21 18:19:55,296 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 244 flow [2024-06-21 18:19:55,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-06-21 18:19:55,300 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2024-06-21 18:19:55,300 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 244 flow [2024-06-21 18:19:55,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-21 18:19:55,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:19:55,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:19:55,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-21 18:19:55,305 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-21 18:19:55,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:19:55,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2125910344, now seen corresponding path program 1 times [2024-06-21 18:19:55,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:19:55,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633304557] [2024-06-21 18:19:55,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:19:55,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:19:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:19:57,093 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-21 18:19:57,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:19:57,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633304557] [2024-06-21 18:19:57,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633304557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:19:57,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:19:57,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:19:57,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215095116] [2024-06-21 18:19:57,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:19:57,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:19:57,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:19:57,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:19:57,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:19:57,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:19:57,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-21 18:19:57,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:19:57,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:19:57,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:19:57,876 INFO L124 PetriNetUnfolderBase]: 1617/2511 cut-off events. [2024-06-21 18:19:57,877 INFO L125 PetriNetUnfolderBase]: For 5687/5687 co-relation queries the response was YES. [2024-06-21 18:19:57,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7879 conditions, 2511 events. 1617/2511 cut-off events. For 5687/5687 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12385 event pairs, 927 based on Foata normal form. 4/2500 useless extension candidates. Maximal degree in co-relation 7857. Up to 2375 conditions per place. [2024-06-21 18:19:57,892 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 51 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-21 18:19:57,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 430 flow [2024-06-21 18:19:57,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 18:19:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 18:19:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-21 18:19:57,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2024-06-21 18:19:57,894 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 244 flow. Second operand 6 states and 115 transitions. [2024-06-21 18:19:57,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 430 flow [2024-06-21 18:19:57,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 412 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-21 18:19:57,899 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 288 flow [2024-06-21 18:19:57,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-06-21 18:19:57,901 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2024-06-21 18:19:57,902 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 288 flow [2024-06-21 18:19:57,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-21 18:19:57,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:19:57,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:19:57,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-21 18:19:57,902 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-21 18:19:57,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:19:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash -741600209, now seen corresponding path program 1 times [2024-06-21 18:19:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:19:57,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524652535] [2024-06-21 18:19:57,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:19:57,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:19:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:19:59,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-21 18:19:59,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:19:59,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524652535] [2024-06-21 18:19:59,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524652535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:19:59,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:19:59,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:19:59,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999554754] [2024-06-21 18:19:59,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:19:59,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:19:59,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:19:59,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:19:59,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:19:59,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:19:59,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 288 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-21 18:19:59,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:19:59,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:19:59,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:00,082 INFO L124 PetriNetUnfolderBase]: 1650/2555 cut-off events. [2024-06-21 18:20:00,082 INFO L125 PetriNetUnfolderBase]: For 7657/7663 co-relation queries the response was YES. [2024-06-21 18:20:00,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8644 conditions, 2555 events. 1650/2555 cut-off events. For 7657/7663 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12629 event pairs, 872 based on Foata normal form. 6/2559 useless extension candidates. Maximal degree in co-relation 8619. Up to 2393 conditions per place. [2024-06-21 18:20:00,105 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 62 selfloop transitions, 24 changer transitions 0/91 dead transitions. [2024-06-21 18:20:00,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 643 flow [2024-06-21 18:20:00,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:20:00,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:20:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-21 18:20:00,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-21 18:20:00,108 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 288 flow. Second operand 7 states and 140 transitions. [2024-06-21 18:20:00,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 643 flow [2024-06-21 18:20:00,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 91 transitions, 611 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-21 18:20:00,113 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 429 flow [2024-06-21 18:20:00,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2024-06-21 18:20:00,114 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2024-06-21 18:20:00,115 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 429 flow [2024-06-21 18:20:00,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-21 18:20:00,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:00,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:00,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-21 18:20:00,115 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-21 18:20:00,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:00,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1484432009, now seen corresponding path program 2 times [2024-06-21 18:20:00,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:00,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403803189] [2024-06-21 18:20:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:00,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:01,398 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-21 18:20:01,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:01,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403803189] [2024-06-21 18:20:01,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403803189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:01,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:01,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:20:01,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662474050] [2024-06-21 18:20:01,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:01,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:20:01,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:01,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:20:01,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:20:01,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:01,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 429 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-21 18:20:01,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:01,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:01,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:01,978 INFO L124 PetriNetUnfolderBase]: 1682/2607 cut-off events. [2024-06-21 18:20:01,978 INFO L125 PetriNetUnfolderBase]: For 10247/10253 co-relation queries the response was YES. [2024-06-21 18:20:01,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9588 conditions, 2607 events. 1682/2607 cut-off events. For 10247/10253 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12777 event pairs, 922 based on Foata normal form. 7/2600 useless extension candidates. Maximal degree in co-relation 9560. Up to 2444 conditions per place. [2024-06-21 18:20:01,990 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 62 selfloop transitions, 30 changer transitions 0/97 dead transitions. [2024-06-21 18:20:01,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 97 transitions, 815 flow [2024-06-21 18:20:01,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 18:20:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 18:20:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2024-06-21 18:20:01,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-21 18:20:01,994 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 429 flow. Second operand 6 states and 119 transitions. [2024-06-21 18:20:01,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 97 transitions, 815 flow [2024-06-21 18:20:02,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 770 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-21 18:20:02,004 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 613 flow [2024-06-21 18:20:02,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=613, PETRI_PLACES=69, PETRI_TRANSITIONS=81} [2024-06-21 18:20:02,004 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2024-06-21 18:20:02,005 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 81 transitions, 613 flow [2024-06-21 18:20:02,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-21 18:20:02,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:02,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:02,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-21 18:20:02,005 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-21 18:20:02,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:02,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1134632039, now seen corresponding path program 3 times [2024-06-21 18:20:02,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:02,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369576199] [2024-06-21 18:20:02,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:02,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:03,163 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-21 18:20:03,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:03,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369576199] [2024-06-21 18:20:03,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369576199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:03,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:03,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:20:03,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8478031] [2024-06-21 18:20:03,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:03,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:20:03,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:03,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:20:03,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:20:03,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:03,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 81 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-21 18:20:03,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:03,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:03,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:03,725 INFO L124 PetriNetUnfolderBase]: 1674/2595 cut-off events. [2024-06-21 18:20:03,725 INFO L125 PetriNetUnfolderBase]: For 11740/11740 co-relation queries the response was YES. [2024-06-21 18:20:03,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9774 conditions, 2595 events. 1674/2595 cut-off events. For 11740/11740 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12731 event pairs, 920 based on Foata normal form. 3/2585 useless extension candidates. Maximal degree in co-relation 9743. Up to 2465 conditions per place. [2024-06-21 18:20:03,740 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 74 selfloop transitions, 16 changer transitions 0/95 dead transitions. [2024-06-21 18:20:03,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 95 transitions, 837 flow [2024-06-21 18:20:03,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 18:20:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 18:20:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-21 18:20:03,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-21 18:20:03,742 INFO L175 Difference]: Start difference. First operand has 69 places, 81 transitions, 613 flow. Second operand 6 states and 114 transitions. [2024-06-21 18:20:03,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 95 transitions, 837 flow [2024-06-21 18:20:03,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 95 transitions, 746 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-21 18:20:03,754 INFO L231 Difference]: Finished difference. Result has 72 places, 81 transitions, 565 flow [2024-06-21 18:20:03,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=565, PETRI_PLACES=72, PETRI_TRANSITIONS=81} [2024-06-21 18:20:03,755 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2024-06-21 18:20:03,755 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 81 transitions, 565 flow [2024-06-21 18:20:03,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-21 18:20:03,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:03,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:03,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-21 18:20:03,756 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-21 18:20:03,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash -234600913, now seen corresponding path program 1 times [2024-06-21 18:20:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:03,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020561700] [2024-06-21 18:20:03,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:03,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:05,249 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-21 18:20:05,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:05,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020561700] [2024-06-21 18:20:05,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020561700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:05,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:05,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:20:05,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637822701] [2024-06-21 18:20:05,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:05,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:20:05,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:05,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:20:05,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:20:05,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:05,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 81 transitions, 565 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:05,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:05,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:05,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:06,220 INFO L124 PetriNetUnfolderBase]: 1723/2658 cut-off events. [2024-06-21 18:20:06,220 INFO L125 PetriNetUnfolderBase]: For 13771/13774 co-relation queries the response was YES. [2024-06-21 18:20:06,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10231 conditions, 2658 events. 1723/2658 cut-off events. For 13771/13774 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13108 event pairs, 834 based on Foata normal form. 4/2651 useless extension candidates. Maximal degree in co-relation 10199. Up to 2482 conditions per place. [2024-06-21 18:20:06,234 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 92 selfloop transitions, 34 changer transitions 0/131 dead transitions. [2024-06-21 18:20:06,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 131 transitions, 1081 flow [2024-06-21 18:20:06,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:20:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:20:06,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-21 18:20:06,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-21 18:20:06,238 INFO L175 Difference]: Start difference. First operand has 72 places, 81 transitions, 565 flow. Second operand 10 states and 189 transitions. [2024-06-21 18:20:06,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 131 transitions, 1081 flow [2024-06-21 18:20:06,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 131 transitions, 1036 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-21 18:20:06,250 INFO L231 Difference]: Finished difference. Result has 79 places, 96 transitions, 728 flow [2024-06-21 18:20:06,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=728, PETRI_PLACES=79, PETRI_TRANSITIONS=96} [2024-06-21 18:20:06,251 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2024-06-21 18:20:06,251 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 96 transitions, 728 flow [2024-06-21 18:20:06,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:06,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:06,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:06,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-21 18:20:06,252 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-21 18:20:06,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:06,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1525988665, now seen corresponding path program 2 times [2024-06-21 18:20:06,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:06,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986840697] [2024-06-21 18:20:06,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:06,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:08,038 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-21 18:20:08,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:08,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986840697] [2024-06-21 18:20:08,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986840697] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:08,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:08,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:20:08,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868348940] [2024-06-21 18:20:08,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:08,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:20:08,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:08,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:20:08,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:20:08,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:08,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 96 transitions, 728 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:08,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:08,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:08,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:08,922 INFO L124 PetriNetUnfolderBase]: 1767/2738 cut-off events. [2024-06-21 18:20:08,922 INFO L125 PetriNetUnfolderBase]: For 17392/17395 co-relation queries the response was YES. [2024-06-21 18:20:08,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11293 conditions, 2738 events. 1767/2738 cut-off events. For 17392/17395 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13532 event pairs, 794 based on Foata normal form. 5/2737 useless extension candidates. Maximal degree in co-relation 11259. Up to 2546 conditions per place. [2024-06-21 18:20:08,941 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 93 selfloop transitions, 39 changer transitions 0/137 dead transitions. [2024-06-21 18:20:08,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 137 transitions, 1235 flow [2024-06-21 18:20:08,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:20:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:20:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-21 18:20:08,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-21 18:20:08,943 INFO L175 Difference]: Start difference. First operand has 79 places, 96 transitions, 728 flow. Second operand 8 states and 154 transitions. [2024-06-21 18:20:08,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 137 transitions, 1235 flow [2024-06-21 18:20:08,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 137 transitions, 1132 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-21 18:20:08,960 INFO L231 Difference]: Finished difference. Result has 84 places, 113 transitions, 913 flow [2024-06-21 18:20:08,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=913, PETRI_PLACES=84, PETRI_TRANSITIONS=113} [2024-06-21 18:20:08,961 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2024-06-21 18:20:08,961 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 113 transitions, 913 flow [2024-06-21 18:20:08,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:08,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:08,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:08,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-21 18:20:08,962 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-21 18:20:08,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:08,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1515143749, now seen corresponding path program 1 times [2024-06-21 18:20:08,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:08,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122627182] [2024-06-21 18:20:08,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:08,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:10,800 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-21 18:20:10,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:10,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122627182] [2024-06-21 18:20:10,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122627182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:10,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:10,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:20:10,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279283805] [2024-06-21 18:20:10,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:10,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:20:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:10,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:20:10,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:20:10,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:10,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 113 transitions, 913 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:10,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:10,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:10,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:11,614 INFO L124 PetriNetUnfolderBase]: 1788/2761 cut-off events. [2024-06-21 18:20:11,615 INFO L125 PetriNetUnfolderBase]: For 20293/20296 co-relation queries the response was YES. [2024-06-21 18:20:11,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11760 conditions, 2761 events. 1788/2761 cut-off events. For 20293/20296 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13643 event pairs, 821 based on Foata normal form. 4/2760 useless extension candidates. Maximal degree in co-relation 11723. Up to 2532 conditions per place. [2024-06-21 18:20:11,632 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 102 selfloop transitions, 46 changer transitions 0/153 dead transitions. [2024-06-21 18:20:11,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 153 transitions, 1467 flow [2024-06-21 18:20:11,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:20:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:20:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-21 18:20:11,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-21 18:20:11,633 INFO L175 Difference]: Start difference. First operand has 84 places, 113 transitions, 913 flow. Second operand 8 states and 160 transitions. [2024-06-21 18:20:11,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 153 transitions, 1467 flow [2024-06-21 18:20:11,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 153 transitions, 1398 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-21 18:20:11,655 INFO L231 Difference]: Finished difference. Result has 91 places, 126 transitions, 1082 flow [2024-06-21 18:20:11,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1082, PETRI_PLACES=91, PETRI_TRANSITIONS=126} [2024-06-21 18:20:11,656 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2024-06-21 18:20:11,656 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 126 transitions, 1082 flow [2024-06-21 18:20:11,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:11,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:11,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:11,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-21 18:20:11,657 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-21 18:20:11,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:11,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1525868695, now seen corresponding path program 3 times [2024-06-21 18:20:11,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:11,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899369346] [2024-06-21 18:20:11,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:11,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:13,361 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-21 18:20:13,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:13,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899369346] [2024-06-21 18:20:13,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899369346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:13,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:13,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:20:13,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462673924] [2024-06-21 18:20:13,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:13,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:20:13,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:13,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:20:13,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:20:13,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:13,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 126 transitions, 1082 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:13,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:13,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:13,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:14,368 INFO L124 PetriNetUnfolderBase]: 1809/2812 cut-off events. [2024-06-21 18:20:14,368 INFO L125 PetriNetUnfolderBase]: For 24138/24141 co-relation queries the response was YES. [2024-06-21 18:20:14,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12634 conditions, 2812 events. 1809/2812 cut-off events. For 24138/24141 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13916 event pairs, 769 based on Foata normal form. 4/2814 useless extension candidates. Maximal degree in co-relation 12594. Up to 2501 conditions per place. [2024-06-21 18:20:14,386 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 87 selfloop transitions, 72 changer transitions 0/164 dead transitions. [2024-06-21 18:20:14,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 164 transitions, 1691 flow [2024-06-21 18:20:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:20:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:20:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-21 18:20:14,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-21 18:20:14,387 INFO L175 Difference]: Start difference. First operand has 91 places, 126 transitions, 1082 flow. Second operand 8 states and 160 transitions. [2024-06-21 18:20:14,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 164 transitions, 1691 flow [2024-06-21 18:20:14,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 164 transitions, 1644 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-21 18:20:14,413 INFO L231 Difference]: Finished difference. Result has 97 places, 137 transitions, 1338 flow [2024-06-21 18:20:14,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1338, PETRI_PLACES=97, PETRI_TRANSITIONS=137} [2024-06-21 18:20:14,414 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2024-06-21 18:20:14,414 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 137 transitions, 1338 flow [2024-06-21 18:20:14,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:14,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:14,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:14,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-21 18:20:14,415 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-21 18:20:14,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1805361591, now seen corresponding path program 4 times [2024-06-21 18:20:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:14,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908665902] [2024-06-21 18:20:14,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:14,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:15,872 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-21 18:20:15,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:15,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908665902] [2024-06-21 18:20:15,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908665902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:15,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:15,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:20:15,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281064549] [2024-06-21 18:20:15,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:15,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:20:15,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:15,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:20:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:20:15,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:15,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 137 transitions, 1338 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:15,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:15,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:15,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:16,641 INFO L124 PetriNetUnfolderBase]: 1829/2830 cut-off events. [2024-06-21 18:20:16,641 INFO L125 PetriNetUnfolderBase]: For 29609/29609 co-relation queries the response was YES. [2024-06-21 18:20:16,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13558 conditions, 2830 events. 1829/2830 cut-off events. For 29609/29609 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14027 event pairs, 874 based on Foata normal form. 3/2822 useless extension candidates. Maximal degree in co-relation 13515. Up to 2657 conditions per place. [2024-06-21 18:20:16,658 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 128 selfloop transitions, 34 changer transitions 0/167 dead transitions. [2024-06-21 18:20:16,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 167 transitions, 1846 flow [2024-06-21 18:20:16,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:20:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:20:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-21 18:20:16,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-21 18:20:16,659 INFO L175 Difference]: Start difference. First operand has 97 places, 137 transitions, 1338 flow. Second operand 7 states and 133 transitions. [2024-06-21 18:20:16,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 167 transitions, 1846 flow [2024-06-21 18:20:16,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 167 transitions, 1746 flow, removed 30 selfloop flow, removed 3 redundant places. [2024-06-21 18:20:16,689 INFO L231 Difference]: Finished difference. Result has 102 places, 150 transitions, 1488 flow [2024-06-21 18:20:16,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1488, PETRI_PLACES=102, PETRI_TRANSITIONS=150} [2024-06-21 18:20:16,689 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2024-06-21 18:20:16,690 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 150 transitions, 1488 flow [2024-06-21 18:20:16,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:16,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:16,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:16,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-21 18:20:16,690 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-21 18:20:16,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:16,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1227249017, now seen corresponding path program 2 times [2024-06-21 18:20:16,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:16,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799125012] [2024-06-21 18:20:16,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:16,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:18,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-21 18:20:18,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:18,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799125012] [2024-06-21 18:20:18,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799125012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:18,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:18,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:20:18,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919949550] [2024-06-21 18:20:18,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:18,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:20:18,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:18,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:20:18,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:20:18,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:18,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 150 transitions, 1488 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:18,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:18,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:18,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:18,704 INFO L124 PetriNetUnfolderBase]: 1881/2914 cut-off events. [2024-06-21 18:20:18,705 INFO L125 PetriNetUnfolderBase]: For 33599/33599 co-relation queries the response was YES. [2024-06-21 18:20:18,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14288 conditions, 2914 events. 1881/2914 cut-off events. For 33599/33599 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14571 event pairs, 888 based on Foata normal form. 5/2905 useless extension candidates. Maximal degree in co-relation 14242. Up to 2653 conditions per place. [2024-06-21 18:20:18,722 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 136 selfloop transitions, 46 changer transitions 0/187 dead transitions. [2024-06-21 18:20:18,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 187 transitions, 2152 flow [2024-06-21 18:20:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:20:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:20:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-21 18:20:18,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-21 18:20:18,724 INFO L175 Difference]: Start difference. First operand has 102 places, 150 transitions, 1488 flow. Second operand 7 states and 140 transitions. [2024-06-21 18:20:18,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 187 transitions, 2152 flow [2024-06-21 18:20:18,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 187 transitions, 2103 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-21 18:20:18,751 INFO L231 Difference]: Finished difference. Result has 105 places, 162 transitions, 1685 flow [2024-06-21 18:20:18,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1685, PETRI_PLACES=105, PETRI_TRANSITIONS=162} [2024-06-21 18:20:18,752 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places. [2024-06-21 18:20:18,752 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 162 transitions, 1685 flow [2024-06-21 18:20:18,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:18,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:18,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:18,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-21 18:20:18,752 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-21 18:20:18,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:18,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1180456267, now seen corresponding path program 5 times [2024-06-21 18:20:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:18,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878576302] [2024-06-21 18:20:18,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:20,130 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-21 18:20:20,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:20,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878576302] [2024-06-21 18:20:20,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878576302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:20,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:20,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:20:20,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094292893] [2024-06-21 18:20:20,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:20,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:20:20,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:20,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:20:20,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:20:20,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:20,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 162 transitions, 1685 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:20,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:20,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:20,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:20,774 INFO L124 PetriNetUnfolderBase]: 1906/2950 cut-off events. [2024-06-21 18:20:20,774 INFO L125 PetriNetUnfolderBase]: For 38346/38349 co-relation queries the response was YES. [2024-06-21 18:20:20,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15144 conditions, 2950 events. 1906/2950 cut-off events. For 38346/38349 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14765 event pairs, 882 based on Foata normal form. 5/2943 useless extension candidates. Maximal degree in co-relation 15097. Up to 2696 conditions per place. [2024-06-21 18:20:20,794 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 124 selfloop transitions, 62 changer transitions 0/191 dead transitions. [2024-06-21 18:20:20,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 191 transitions, 2299 flow [2024-06-21 18:20:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:20:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:20:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-21 18:20:20,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2024-06-21 18:20:20,795 INFO L175 Difference]: Start difference. First operand has 105 places, 162 transitions, 1685 flow. Second operand 7 states and 138 transitions. [2024-06-21 18:20:20,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 191 transitions, 2299 flow [2024-06-21 18:20:20,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 191 transitions, 2227 flow, removed 29 selfloop flow, removed 2 redundant places. [2024-06-21 18:20:20,829 INFO L231 Difference]: Finished difference. Result has 110 places, 171 transitions, 1857 flow [2024-06-21 18:20:20,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1857, PETRI_PLACES=110, PETRI_TRANSITIONS=171} [2024-06-21 18:20:20,829 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places. [2024-06-21 18:20:20,829 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 171 transitions, 1857 flow [2024-06-21 18:20:20,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:20,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:20,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:20,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-21 18:20:20,830 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-21 18:20:20,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:20,831 INFO L85 PathProgramCache]: Analyzing trace with hash -813853987, now seen corresponding path program 6 times [2024-06-21 18:20:20,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:20,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694101324] [2024-06-21 18:20:20,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:20,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:22,211 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-21 18:20:22,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:22,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694101324] [2024-06-21 18:20:22,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694101324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:22,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:22,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:20:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702978693] [2024-06-21 18:20:22,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:22,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:20:22,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:22,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:20:22,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:20:22,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:22,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 171 transitions, 1857 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:22,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:22,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:22,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:22,903 INFO L124 PetriNetUnfolderBase]: 1898/2939 cut-off events. [2024-06-21 18:20:22,903 INFO L125 PetriNetUnfolderBase]: For 41834/41834 co-relation queries the response was YES. [2024-06-21 18:20:22,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15419 conditions, 2939 events. 1898/2939 cut-off events. For 41834/41834 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14720 event pairs, 888 based on Foata normal form. 3/2931 useless extension candidates. Maximal degree in co-relation 15369. Up to 2775 conditions per place. [2024-06-21 18:20:22,923 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 162 selfloop transitions, 22 changer transitions 0/189 dead transitions. [2024-06-21 18:20:22,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 189 transitions, 2313 flow [2024-06-21 18:20:22,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:20:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:20:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-21 18:20:22,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-21 18:20:22,924 INFO L175 Difference]: Start difference. First operand has 110 places, 171 transitions, 1857 flow. Second operand 7 states and 131 transitions. [2024-06-21 18:20:22,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 189 transitions, 2313 flow [2024-06-21 18:20:22,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 189 transitions, 2134 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-21 18:20:22,974 INFO L231 Difference]: Finished difference. Result has 113 places, 171 transitions, 1734 flow [2024-06-21 18:20:22,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1678, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1734, PETRI_PLACES=113, PETRI_TRANSITIONS=171} [2024-06-21 18:20:22,974 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places. [2024-06-21 18:20:22,974 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 171 transitions, 1734 flow [2024-06-21 18:20:22,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:22,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:22,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:22,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-21 18:20:22,975 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-21 18:20:22,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1404380537, now seen corresponding path program 3 times [2024-06-21 18:20:22,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:22,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291924662] [2024-06-21 18:20:22,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:22,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:24,246 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-21 18:20:24,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:24,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291924662] [2024-06-21 18:20:24,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291924662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:24,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:24,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:20:24,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066530423] [2024-06-21 18:20:24,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:24,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:20:24,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:24,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:20:24,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:20:24,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:24,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 171 transitions, 1734 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:24,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:24,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:24,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:24,973 INFO L124 PetriNetUnfolderBase]: 1927/2982 cut-off events. [2024-06-21 18:20:24,973 INFO L125 PetriNetUnfolderBase]: For 45700/45700 co-relation queries the response was YES. [2024-06-21 18:20:24,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15681 conditions, 2982 events. 1927/2982 cut-off events. For 45700/45700 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14947 event pairs, 888 based on Foata normal form. 5/2976 useless extension candidates. Maximal degree in co-relation 15630. Up to 2765 conditions per place. [2024-06-21 18:20:24,991 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 168 selfloop transitions, 32 changer transitions 0/205 dead transitions. [2024-06-21 18:20:24,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 205 transitions, 2437 flow [2024-06-21 18:20:24,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:20:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:20:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-21 18:20:24,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-21 18:20:24,992 INFO L175 Difference]: Start difference. First operand has 113 places, 171 transitions, 1734 flow. Second operand 8 states and 147 transitions. [2024-06-21 18:20:24,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 205 transitions, 2437 flow [2024-06-21 18:20:25,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 205 transitions, 2344 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-21 18:20:25,045 INFO L231 Difference]: Finished difference. Result has 115 places, 178 transitions, 1818 flow [2024-06-21 18:20:25,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1818, PETRI_PLACES=115, PETRI_TRANSITIONS=178} [2024-06-21 18:20:25,046 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2024-06-21 18:20:25,046 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 178 transitions, 1818 flow [2024-06-21 18:20:25,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:25,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:25,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:25,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-21 18:20:25,047 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-21 18:20:25,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:25,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1173789841, now seen corresponding path program 4 times [2024-06-21 18:20:25,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:25,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637250837] [2024-06-21 18:20:25,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:25,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:26,354 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-21 18:20:26,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:26,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637250837] [2024-06-21 18:20:26,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637250837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:26,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:26,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:20:26,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648333326] [2024-06-21 18:20:26,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:26,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:20:26,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:26,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:20:26,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:20:26,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:26,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 178 transitions, 1818 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:26,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:26,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:26,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:27,060 INFO L124 PetriNetUnfolderBase]: 1914/2964 cut-off events. [2024-06-21 18:20:27,061 INFO L125 PetriNetUnfolderBase]: For 48825/48825 co-relation queries the response was YES. [2024-06-21 18:20:27,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15739 conditions, 2964 events. 1914/2964 cut-off events. For 48825/48825 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14875 event pairs, 886 based on Foata normal form. 5/2958 useless extension candidates. Maximal degree in co-relation 15687. Up to 2792 conditions per place. [2024-06-21 18:20:27,078 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 174 selfloop transitions, 20 changer transitions 0/199 dead transitions. [2024-06-21 18:20:27,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 199 transitions, 2308 flow [2024-06-21 18:20:27,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:20:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:20:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-21 18:20:27,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-21 18:20:27,079 INFO L175 Difference]: Start difference. First operand has 115 places, 178 transitions, 1818 flow. Second operand 7 states and 132 transitions. [2024-06-21 18:20:27,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 199 transitions, 2308 flow [2024-06-21 18:20:27,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 199 transitions, 2122 flow, removed 53 selfloop flow, removed 7 redundant places. [2024-06-21 18:20:27,133 INFO L231 Difference]: Finished difference. Result has 115 places, 178 transitions, 1684 flow [2024-06-21 18:20:27,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1684, PETRI_PLACES=115, PETRI_TRANSITIONS=178} [2024-06-21 18:20:27,134 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2024-06-21 18:20:27,134 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 178 transitions, 1684 flow [2024-06-21 18:20:27,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-21 18:20:27,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:27,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:27,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-21 18:20:27,135 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:20:27,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:27,135 INFO L85 PathProgramCache]: Analyzing trace with hash 875095549, now seen corresponding path program 1 times [2024-06-21 18:20:27,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:27,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817863696] [2024-06-21 18:20:27,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:27,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:28,576 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-21 18:20:28,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:28,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817863696] [2024-06-21 18:20:28,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817863696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:28,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:28,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-21 18:20:28,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378493173] [2024-06-21 18:20:28,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:28,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-21 18:20:28,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:28,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-21 18:20:28,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-21 18:20:28,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:28,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 178 transitions, 1684 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-21 18:20:28,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:28,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:28,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:28,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([381] L782-->L785: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~y~0=v_~y~0_1, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0][38], [Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 123#(and (= ~__unbuffered_p0_EAX~0 0) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), 42#$Ultimate##0true, Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff0_thd3~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~z$r_buff0_thd3~0 256)) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 104#true, 283#true, Black: 134#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 261#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0)), Black: 78#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (not (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0)) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 7#L762true, Black: 86#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 275#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), 22#L785true, Black: 220#(and (= ~z$w_buff1_used~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (or (= ~__unbuffered_p0_EAX~0 0) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 223#true, Black: 216#(and (= ~z$w_buff1_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 193#true, 16#L851true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 229#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), 269#true, Black: 166#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), Black: 163#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), P1Thread1of1ForFork2InUse, Black: 239#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 175#true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 177#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 249#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 124#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 189#(and (= ~__unbuffered_cnt~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1))]) [2024-06-21 18:20:28,987 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-06-21 18:20:28,987 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-21 18:20:28,987 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-21 18:20:28,987 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-21 18:20:29,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L800-->L802: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0][174], [Black: 123#(and (= ~__unbuffered_p0_EAX~0 0) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 2#L782true, Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff0_thd3~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~z$r_buff0_thd3~0 256)) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 104#true, 283#true, Black: 134#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 261#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0)), Black: 78#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (not (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0)) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), 7#L762true, Black: 275#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 220#(and (= ~z$w_buff1_used~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (or (= ~__unbuffered_p0_EAX~0 0) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), 223#true, Black: 154#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 216#(and (= ~z$w_buff1_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 193#true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), 16#L851true, Black: 229#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), 269#true, Black: 166#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), Black: 163#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 38#L802true, P1Thread1of1ForFork2InUse, Black: 239#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), 140#true, P0Thread1of1ForFork0InUse, Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), P2Thread1of1ForFork1InUse, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 175#true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 249#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), Black: 177#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 124#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 189#(and (= ~__unbuffered_cnt~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1))]) [2024-06-21 18:20:29,006 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-21 18:20:29,006 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-21 18:20:29,006 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-21 18:20:29,006 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-21 18:20:29,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([375] L762-->L769: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd1~0_26 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_57 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_31 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_58 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_47 256) 0)) .cse4))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_47) v_~z$w_buff1_used~0_46) (= v_~z$w_buff0_used~0_57 (ite .cse2 0 v_~z$w_buff0_used~0_58)) (= v_~z$r_buff0_thd1~0_30 (ite .cse0 0 v_~z$r_buff0_thd1~0_31)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_30 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_46 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_26) v_~z$r_buff1_thd1~0_25) (= v_~z~0_22 (ite .cse2 v_~z$w_buff0~0_21 (ite .cse1 v_~z$w_buff1~0_18 v_~z~0_23)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_58, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_47, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_31} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_57, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_46, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][91], [Black: 123#(and (= ~__unbuffered_p0_EAX~0 0) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 42#$Ultimate##0true, 20#L769true, 2#L782true, Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff0_thd3~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~z$r_buff0_thd3~0 256)) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 283#true, 104#true, Black: 134#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 261#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0)), Black: 78#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (not (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0)) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 275#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 220#(and (= ~z$w_buff1_used~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (or (= ~__unbuffered_p0_EAX~0 0) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 223#true, Black: 216#(and (= ~z$w_buff1_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 193#true, 16#L851true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 229#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), 269#true, Black: 166#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), Black: 163#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), P1Thread1of1ForFork2InUse, Black: 239#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), P0Thread1of1ForFork0InUse, 140#true, Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), P2Thread1of1ForFork1InUse, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 175#true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 249#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), Black: 177#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 124#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 189#(and (= ~__unbuffered_cnt~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1))]) [2024-06-21 18:20:29,008 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2024-06-21 18:20:29,008 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-21 18:20:29,008 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-21 18:20:29,008 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-21 18:20:29,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([349] L851-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (and (let ((.cse5 (mod v_~z$w_buff0_used~0_35 256))) (let ((.cse2 (mod v_~z$r_buff1_thd2~0_11 256)) (.cse6 (+ .cse5 1)) (.cse3 (mod v_~z$r_buff1_thd3~0_19 256)) (.cse12 (mod v_~z$r_buff0_thd3~0_21 256)) (.cse10 (mod v_~z$w_buff1_used~0_28 256)) (.cse11 (mod v_~z$r_buff1_thd1~0_11 256)) (.cse7 (mod v_~z$r_buff0_thd2~0_13 256)) (.cse8 (mod v_~z$r_buff1_thd0~0_7 256)) (.cse0 (mod v_~z$r_buff0_thd0~0_7 256)) (.cse4 (mod v_~z$flush_delayed~0_9 256)) (.cse1 (mod v_~z$r_buff0_thd1~0_14 256)) (.cse9 (mod v_~z$read_delayed~0_6 256))) (or (< v_~z$w_buff0~0_14 .cse0) (< v_~y~0_9 v_~__unbuffered_p1_EBX~0_7) (< .cse1 .cse2) (< (+ .cse3 v_~z$w_buff0~0_14) 0) (< v_~z$w_buff0~0_14 .cse4) (< (+ .cse5 v_~x~0_9) 0) (< v_~z$w_buff0~0_14 .cse2) (< (+ v_~__unbuffered_p0_EAX~0_7 .cse1) 0) (< (+ .cse1 v_~__unbuffered_p1_EBX~0_7) 0) (< v_~z$w_buff0~0_14 .cse3) (< (+ .cse2 v_~z$w_buff0~0_14) 0) (< .cse1 v_~z$w_buff0~0_14) (< (+ v_~__unbuffered_p1_EAX~0_7 v_~z$w_buff0~0_14) 0) (< v_~z$w_buff0~0_14 v_~z$w_buff1~0_13) (< .cse5 .cse0) (< .cse6 v_~z$w_buff1~0_13) (< v_~z$w_buff0~0_14 .cse1) (< (+ v_~z$w_buff0~0_14 v_~x~0_9) 0) (< .cse1 .cse7) (< v_~z$mem_tmp~0_8 v_~__unbuffered_p2_EBX~0_7) (< .cse1 .cse8) (< (+ .cse1 v_~z$mem_tmp~0_8) 0) (< (+ .cse9 v_~z$w_buff0~0_14) 0) (< v_~z~0_18 v_~__unbuffered_p2_EBX~0_7) (< (+ (mod v_~main$tmp_guard1~0_6 256) v_~z$w_buff0~0_14) 0) (< v_~z~0_18 v_~z$mem_tmp~0_8) (< (+ .cse10 v_~z$w_buff0~0_14) 0) (< v_~z$w_buff0~0_14 .cse8) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse5) 0) (< .cse5 .cse3) (< (+ v_~z$w_buff0~0_14 .cse7) 0) (< v_~z$w_buff1~0_13 .cse11) (< .cse11 v_~z$w_buff1~0_13) (< (+ .cse1 v_~__unbuffered_cnt~0_12) 0) (< .cse5 .cse12) (< (+ .cse4 v_~z$w_buff0~0_14) 0) (< (+ v_~z$w_buff0~0_14 v_~y~0_9) 0) (< (+ .cse1 v_~__unbuffered_p1_EAX~0_7) 0) (< (+ .cse5 v_~__unbuffered_p1_EBX~0_7) 0) (< .cse11 .cse10) (< .cse1 .cse10) (< (+ v_~__unbuffered_p0_EAX~0_7 v_~z$w_buff0~0_14) 0) (< .cse1 .cse4) (< v_~z$w_buff0~0_14 .cse5) (< (+ (mod v_~weak$$choice0~0_7 256) v_~z$w_buff0~0_14) 0) (< (+ .cse5 v_~z$w_buff0~0_14) 0) (< .cse1 .cse11) (< .cse6 v_~z$w_buff0~0_14) (< (+ v_~z~0_18 v_~z$w_buff0~0_14) 0) (< (+ .cse1 v_~y~0_9) 0) (< (+ .cse5 v_~z$mem_tmp~0_8) 0) (< (+ v_~__unbuffered_p0_EAX~0_7 .cse5) 0) (< (+ v_~z$w_buff0~0_14 v_~z$mem_tmp~0_8) 0) (< .cse6 .cse11) (< (+ v_~z~0_18 .cse5) 0) (< (+ v_~__unbuffered_p2_EBX~0_7 .cse1) 0) (< (+ .cse1 v_~z$w_buff1~0_13) 0) (< v_~y~0_9 v_~__unbuffered_p2_EAX~0_7) (< v_~z$w_buff0~0_14 .cse11) (< .cse5 .cse2) (< .cse6 .cse1) (< (+ v_~__unbuffered_cnt~0_12 v_~z$w_buff0~0_14) 0) (< (+ v_~z~0_18 .cse1) 0) (< .cse5 .cse7) (< (+ .cse1 v_~x~0_9) 0) (< v_~z$w_buff0~0_14 .cse10) (< .cse1 .cse5) (< v_~x~0_9 v_~__unbuffered_p1_EAX~0_7) (< .cse1 .cse3) (< (+ v_~z$w_buff0~0_14 v_~z$w_buff1~0_13) 0) (< (+ .cse5 v_~__unbuffered_p1_EAX~0_7) 0) (< v_~z$w_buff1~0_13 .cse10) (< (+ .cse12 v_~z$w_buff0~0_14) 0) (< (+ .cse5 v_~__unbuffered_cnt~0_12) 0) (< (+ .cse5 v_~z$w_buff1~0_13) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse1) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~z$w_buff0~0_14) 0) (< (+ .cse1 v_~z$w_buff0~0_14) 0) (< v_~z$w_buff0~0_14 .cse12) (< .cse1 .cse12) (< v_~x~0_9 v_~__unbuffered_p0_EAX~0_7) (< .cse5 .cse10) (< (+ .cse5 v_~y~0_9) 0) (< (+ v_~__unbuffered_p2_EBX~0_7 .cse5) 0) (< .cse5 .cse8) (< (+ v_~z$w_buff0~0_14 .cse11) 0) (< v_~__unbuffered_p2_EBX~0_7 v_~z$mem_tmp~0_8) (< (+ .cse0 v_~z$w_buff0~0_14) 0) (< v_~z$w_buff0~0_14 .cse7) (< (+ .cse8 v_~z$w_buff0~0_14) 0) (< .cse1 .cse0) (< (+ v_~__unbuffered_p2_EBX~0_7 v_~z$w_buff0~0_14) 0) (< (+ v_~__unbuffered_p1_EBX~0_7 v_~z$w_buff0~0_14) 0) (< (+ (mod v_~weak$$choice2~0_14 256) v_~z$w_buff0~0_14) 0) (< .cse1 .cse9) (< v_~z$w_buff0~0_14 .cse9) (< .cse5 .cse4) (< .cse1 v_~z$w_buff1~0_13) (< .cse5 .cse9)))) (not (= |v_#ghost~multithreaded_7| 0))) InVars {~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13, ~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$w_buff0~0=v_~z$w_buff0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_35, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_28, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_14, ~x~0=v_~x~0_9} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13, ~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$w_buff0~0=v_~z$w_buff0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_35, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_28, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_14, ~x~0=v_~x~0_9} AuxVars[] AssignedVars[][151], [Black: 123#(and (= ~__unbuffered_p0_EAX~0 0) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 42#$Ultimate##0true, 2#L782true, Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff0_thd3~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~z$r_buff0_thd3~0 256)) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 283#true, 104#true, Black: 134#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 261#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0)), Black: 78#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (not (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0)) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 7#L762true, Black: 86#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 275#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 220#(and (= ~z$w_buff1_used~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (or (= ~__unbuffered_p0_EAX~0 0) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), 223#true, Black: 216#(and (= ~z$w_buff1_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 193#true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 229#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), 269#true, Black: 166#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), Black: 163#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), P1Thread1of1ForFork2InUse, 34#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 239#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 175#true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 249#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), Black: 177#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 124#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 189#(and (= ~__unbuffered_cnt~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1))]) [2024-06-21 18:20:29,010 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2024-06-21 18:20:29,010 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-21 18:20:29,010 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-21 18:20:29,010 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-21 18:20:29,325 INFO L124 PetriNetUnfolderBase]: 2304/3534 cut-off events. [2024-06-21 18:20:29,325 INFO L125 PetriNetUnfolderBase]: For 73534/73628 co-relation queries the response was YES. [2024-06-21 18:20:29,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18924 conditions, 3534 events. 2304/3534 cut-off events. For 73534/73628 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 18085 event pairs, 1211 based on Foata normal form. 14/3500 useless extension candidates. Maximal degree in co-relation 18873. Up to 3305 conditions per place. [2024-06-21 18:20:29,350 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 131 selfloop transitions, 10 changer transitions 0/188 dead transitions. [2024-06-21 18:20:29,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 188 transitions, 2014 flow [2024-06-21 18:20:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-21 18:20:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-21 18:20:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-06-21 18:20:29,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-21 18:20:29,351 INFO L175 Difference]: Start difference. First operand has 115 places, 178 transitions, 1684 flow. Second operand 5 states and 93 transitions. [2024-06-21 18:20:29,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 188 transitions, 2014 flow [2024-06-21 18:20:29,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 188 transitions, 1907 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-21 18:20:29,414 INFO L231 Difference]: Finished difference. Result has 114 places, 181 transitions, 1629 flow [2024-06-21 18:20:29,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1629, PETRI_PLACES=114, PETRI_TRANSITIONS=181} [2024-06-21 18:20:29,415 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places. [2024-06-21 18:20:29,415 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 181 transitions, 1629 flow [2024-06-21 18:20:29,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-21 18:20:29,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:29,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:29,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-21 18:20:29,415 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-21 18:20:29,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:29,416 INFO L85 PathProgramCache]: Analyzing trace with hash -613709933, now seen corresponding path program 1 times [2024-06-21 18:20:29,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:29,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343731783] [2024-06-21 18:20:29,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:29,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:31,014 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-21 18:20:31,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:31,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343731783] [2024-06-21 18:20:31,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343731783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:31,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:31,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:20:31,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062198442] [2024-06-21 18:20:31,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:31,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:20:31,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:31,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:20:31,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:20:31,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:20:31,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 181 transitions, 1629 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-21 18:20:31,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:31,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:20:31,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:31,916 INFO L124 PetriNetUnfolderBase]: 2425/3661 cut-off events. [2024-06-21 18:20:31,917 INFO L125 PetriNetUnfolderBase]: For 77241/77265 co-relation queries the response was YES. [2024-06-21 18:20:31,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20163 conditions, 3661 events. 2425/3661 cut-off events. For 77241/77265 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 18042 event pairs, 1135 based on Foata normal form. 2/3627 useless extension candidates. Maximal degree in co-relation 20111. Up to 3461 conditions per place. [2024-06-21 18:20:31,942 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 163 selfloop transitions, 37 changer transitions 0/205 dead transitions. [2024-06-21 18:20:31,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 205 transitions, 2137 flow [2024-06-21 18:20:31,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:20:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:20:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-21 18:20:31,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-21 18:20:31,944 INFO L175 Difference]: Start difference. First operand has 114 places, 181 transitions, 1629 flow. Second operand 8 states and 143 transitions. [2024-06-21 18:20:31,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 205 transitions, 2137 flow [2024-06-21 18:20:32,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 205 transitions, 2107 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-21 18:20:32,014 INFO L231 Difference]: Finished difference. Result has 119 places, 184 transitions, 1720 flow [2024-06-21 18:20:32,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1599, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1720, PETRI_PLACES=119, PETRI_TRANSITIONS=184} [2024-06-21 18:20:32,015 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 76 predicate places. [2024-06-21 18:20:32,015 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 184 transitions, 1720 flow [2024-06-21 18:20:32,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-21 18:20:32,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:32,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:32,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-21 18:20:32,016 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-21 18:20:32,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash -536907536, now seen corresponding path program 1 times [2024-06-21 18:20:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:32,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746404849] [2024-06-21 18:20:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:32,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:33,456 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-21 18:20:33,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:33,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746404849] [2024-06-21 18:20:33,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746404849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:33,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:33,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:20:33,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958194560] [2024-06-21 18:20:33,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:33,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:20:33,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:33,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:20:33,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:20:33,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:33,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 184 transitions, 1720 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-21 18:20:33,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:33,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:33,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:34,633 INFO L124 PetriNetUnfolderBase]: 2287/3484 cut-off events. [2024-06-21 18:20:34,634 INFO L125 PetriNetUnfolderBase]: For 86359/86389 co-relation queries the response was YES. [2024-06-21 18:20:34,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20687 conditions, 3484 events. 2287/3484 cut-off events. For 86359/86389 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 17625 event pairs, 910 based on Foata normal form. 8/3404 useless extension candidates. Maximal degree in co-relation 20634. Up to 3096 conditions per place. [2024-06-21 18:20:34,657 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 151 selfloop transitions, 75 changer transitions 0/233 dead transitions. [2024-06-21 18:20:34,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 233 transitions, 2580 flow [2024-06-21 18:20:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:20:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:20:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-06-21 18:20:34,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-21 18:20:34,660 INFO L175 Difference]: Start difference. First operand has 119 places, 184 transitions, 1720 flow. Second operand 10 states and 194 transitions. [2024-06-21 18:20:34,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 233 transitions, 2580 flow [2024-06-21 18:20:34,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 233 transitions, 2489 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-21 18:20:34,732 INFO L231 Difference]: Finished difference. Result has 125 places, 199 transitions, 2007 flow [2024-06-21 18:20:34,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2007, PETRI_PLACES=125, PETRI_TRANSITIONS=199} [2024-06-21 18:20:34,733 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places. [2024-06-21 18:20:34,733 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 199 transitions, 2007 flow [2024-06-21 18:20:34,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-21 18:20:34,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:34,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:34,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-21 18:20:34,734 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-21 18:20:34,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:34,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1650561126, now seen corresponding path program 2 times [2024-06-21 18:20:34,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:34,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793228474] [2024-06-21 18:20:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:34,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:36,941 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-21 18:20:36,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:36,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793228474] [2024-06-21 18:20:36,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793228474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:36,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:36,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:20:36,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169166204] [2024-06-21 18:20:36,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:36,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:20:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:36,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:20:36,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:20:37,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:20:37,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 199 transitions, 2007 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-21 18:20:37,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:37,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:20:37,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:37,917 INFO L124 PetriNetUnfolderBase]: 2305/3511 cut-off events. [2024-06-21 18:20:37,917 INFO L125 PetriNetUnfolderBase]: For 96650/96680 co-relation queries the response was YES. [2024-06-21 18:20:37,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21874 conditions, 3511 events. 2305/3511 cut-off events. For 96650/96680 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 17740 event pairs, 910 based on Foata normal form. 9/3432 useless extension candidates. Maximal degree in co-relation 21818. Up to 3116 conditions per place. [2024-06-21 18:20:37,941 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 153 selfloop transitions, 80 changer transitions 0/240 dead transitions. [2024-06-21 18:20:37,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 240 transitions, 2833 flow [2024-06-21 18:20:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:20:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:20:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2024-06-21 18:20:37,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894179894179894 [2024-06-21 18:20:37,943 INFO L175 Difference]: Start difference. First operand has 125 places, 199 transitions, 2007 flow. Second operand 9 states and 185 transitions. [2024-06-21 18:20:37,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 240 transitions, 2833 flow [2024-06-21 18:20:38,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 240 transitions, 2714 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-21 18:20:38,029 INFO L231 Difference]: Finished difference. Result has 130 places, 205 transitions, 2160 flow [2024-06-21 18:20:38,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1914, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2160, PETRI_PLACES=130, PETRI_TRANSITIONS=205} [2024-06-21 18:20:38,030 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 87 predicate places. [2024-06-21 18:20:38,030 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 205 transitions, 2160 flow [2024-06-21 18:20:38,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-21 18:20:38,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:38,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:38,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-21 18:20:38,031 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-21 18:20:38,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:38,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1639358191, now seen corresponding path program 2 times [2024-06-21 18:20:38,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:38,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734415428] [2024-06-21 18:20:38,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:38,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:39,763 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-21 18:20:39,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:39,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734415428] [2024-06-21 18:20:39,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734415428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:39,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:39,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:20:39,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338058612] [2024-06-21 18:20:39,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:39,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:20:39,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:39,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:20:39,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:20:39,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:39,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 205 transitions, 2160 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-21 18:20:39,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:39,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:39,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:40,976 INFO L124 PetriNetUnfolderBase]: 2335/3590 cut-off events. [2024-06-21 18:20:40,976 INFO L125 PetriNetUnfolderBase]: For 96858/96884 co-relation queries the response was YES. [2024-06-21 18:20:40,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22275 conditions, 3590 events. 2335/3590 cut-off events. For 96858/96884 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 18281 event pairs, 882 based on Foata normal form. 6/3532 useless extension candidates. Maximal degree in co-relation 22218. Up to 3208 conditions per place. [2024-06-21 18:20:41,005 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 175 selfloop transitions, 75 changer transitions 0/257 dead transitions. [2024-06-21 18:20:41,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 257 transitions, 3106 flow [2024-06-21 18:20:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 18:20:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 18:20:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2024-06-21 18:20:41,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45021645021645024 [2024-06-21 18:20:41,007 INFO L175 Difference]: Start difference. First operand has 130 places, 205 transitions, 2160 flow. Second operand 11 states and 208 transitions. [2024-06-21 18:20:41,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 257 transitions, 3106 flow [2024-06-21 18:20:41,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 257 transitions, 2928 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-21 18:20:41,107 INFO L231 Difference]: Finished difference. Result has 136 places, 219 transitions, 2315 flow [2024-06-21 18:20:41,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1982, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2315, PETRI_PLACES=136, PETRI_TRANSITIONS=219} [2024-06-21 18:20:41,108 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places. [2024-06-21 18:20:41,108 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 219 transitions, 2315 flow [2024-06-21 18:20:41,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-21 18:20:41,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:41,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:41,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-21 18:20:41,108 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-21 18:20:41,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:41,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1639362996, now seen corresponding path program 3 times [2024-06-21 18:20:41,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:41,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245339481] [2024-06-21 18:20:41,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:41,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:43,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-21 18:20:43,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:43,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245339481] [2024-06-21 18:20:43,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245339481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:43,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:43,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:20:43,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074877448] [2024-06-21 18:20:43,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:43,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:20:43,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:43,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:20:43,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:20:43,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:20:43,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 219 transitions, 2315 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-21 18:20:43,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:43,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:20:43,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:44,297 INFO L124 PetriNetUnfolderBase]: 2342/3583 cut-off events. [2024-06-21 18:20:44,298 INFO L125 PetriNetUnfolderBase]: For 104982/105003 co-relation queries the response was YES. [2024-06-21 18:20:44,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23104 conditions, 3583 events. 2342/3583 cut-off events. For 104982/105003 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18179 event pairs, 904 based on Foata normal form. 5/3498 useless extension candidates. Maximal degree in co-relation 23045. Up to 3226 conditions per place. [2024-06-21 18:20:44,324 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 173 selfloop transitions, 65 changer transitions 0/245 dead transitions. [2024-06-21 18:20:44,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 245 transitions, 2930 flow [2024-06-21 18:20:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:20:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:20:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-21 18:20:44,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-06-21 18:20:44,326 INFO L175 Difference]: Start difference. First operand has 136 places, 219 transitions, 2315 flow. Second operand 8 states and 161 transitions. [2024-06-21 18:20:44,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 245 transitions, 2930 flow [2024-06-21 18:20:44,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 245 transitions, 2782 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-06-21 18:20:44,440 INFO L231 Difference]: Finished difference. Result has 138 places, 219 transitions, 2315 flow [2024-06-21 18:20:44,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2167, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2315, PETRI_PLACES=138, PETRI_TRANSITIONS=219} [2024-06-21 18:20:44,440 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places. [2024-06-21 18:20:44,440 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 219 transitions, 2315 flow [2024-06-21 18:20:44,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-21 18:20:44,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:44,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:44,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-21 18:20:44,441 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-21 18:20:44,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash -61007319, now seen corresponding path program 3 times [2024-06-21 18:20:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:44,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345383130] [2024-06-21 18:20:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:44,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:46,502 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-21 18:20:46,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:46,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345383130] [2024-06-21 18:20:46,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345383130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:46,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:46,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:20:46,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879595044] [2024-06-21 18:20:46,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:46,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:20:46,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:46,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:20:46,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:20:46,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:46,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 219 transitions, 2315 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-21 18:20:46,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:46,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:46,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:47,642 INFO L124 PetriNetUnfolderBase]: 2346/3602 cut-off events. [2024-06-21 18:20:47,642 INFO L125 PetriNetUnfolderBase]: For 111239/111257 co-relation queries the response was YES. [2024-06-21 18:20:47,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23261 conditions, 3602 events. 2346/3602 cut-off events. For 111239/111257 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18219 event pairs, 847 based on Foata normal form. 11/3554 useless extension candidates. Maximal degree in co-relation 23200. Up to 3271 conditions per place. [2024-06-21 18:20:47,670 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 190 selfloop transitions, 60 changer transitions 0/257 dead transitions. [2024-06-21 18:20:47,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 257 transitions, 3038 flow [2024-06-21 18:20:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:20:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:20:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-21 18:20:47,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-21 18:20:47,673 INFO L175 Difference]: Start difference. First operand has 138 places, 219 transitions, 2315 flow. Second operand 9 states and 171 transitions. [2024-06-21 18:20:47,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 257 transitions, 3038 flow [2024-06-21 18:20:47,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 257 transitions, 2895 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-21 18:20:47,769 INFO L231 Difference]: Finished difference. Result has 140 places, 230 transitions, 2441 flow [2024-06-21 18:20:47,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2172, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2441, PETRI_PLACES=140, PETRI_TRANSITIONS=230} [2024-06-21 18:20:47,770 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places. [2024-06-21 18:20:47,770 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 230 transitions, 2441 flow [2024-06-21 18:20:47,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-21 18:20:47,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:47,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:47,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-21 18:20:47,771 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-21 18:20:47,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:47,771 INFO L85 PathProgramCache]: Analyzing trace with hash 275184891, now seen corresponding path program 4 times [2024-06-21 18:20:47,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:47,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664969978] [2024-06-21 18:20:47,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:47,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:49,886 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-21 18:20:49,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:49,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664969978] [2024-06-21 18:20:49,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664969978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:49,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:49,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:20:49,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681855036] [2024-06-21 18:20:49,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:49,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:20:49,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:49,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:20:49,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:20:50,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:50,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 230 transitions, 2441 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-21 18:20:50,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:50,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:50,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:51,152 INFO L124 PetriNetUnfolderBase]: 2440/3729 cut-off events. [2024-06-21 18:20:51,152 INFO L125 PetriNetUnfolderBase]: For 125740/125762 co-relation queries the response was YES. [2024-06-21 18:20:51,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24702 conditions, 3729 events. 2440/3729 cut-off events. For 125740/125762 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18940 event pairs, 870 based on Foata normal form. 6/3660 useless extension candidates. Maximal degree in co-relation 24640. Up to 3106 conditions per place. [2024-06-21 18:20:51,184 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 132 selfloop transitions, 138 changer transitions 0/277 dead transitions. [2024-06-21 18:20:51,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 277 transitions, 3596 flow [2024-06-21 18:20:51,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:20:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:20:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions. [2024-06-21 18:20:51,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2024-06-21 18:20:51,186 INFO L175 Difference]: Start difference. First operand has 140 places, 230 transitions, 2441 flow. Second operand 9 states and 183 transitions. [2024-06-21 18:20:51,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 277 transitions, 3596 flow [2024-06-21 18:20:51,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 277 transitions, 3451 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-21 18:20:51,313 INFO L231 Difference]: Finished difference. Result has 143 places, 244 transitions, 2834 flow [2024-06-21 18:20:51,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2296, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2834, PETRI_PLACES=143, PETRI_TRANSITIONS=244} [2024-06-21 18:20:51,313 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 100 predicate places. [2024-06-21 18:20:51,313 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 244 transitions, 2834 flow [2024-06-21 18:20:51,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-21 18:20:51,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:51,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:51,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-21 18:20:51,314 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-21 18:20:51,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:51,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1063109600, now seen corresponding path program 4 times [2024-06-21 18:20:51,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:51,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344835125] [2024-06-21 18:20:51,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:51,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:53,576 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-21 18:20:53,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:53,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344835125] [2024-06-21 18:20:53,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344835125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:53,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:53,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:20:53,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355689846] [2024-06-21 18:20:53,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:53,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:20:53,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:53,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:20:53,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:20:53,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:20:53,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 244 transitions, 2834 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-21 18:20:53,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:53,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:20:53,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:54,676 INFO L124 PetriNetUnfolderBase]: 2428/3728 cut-off events. [2024-06-21 18:20:54,676 INFO L125 PetriNetUnfolderBase]: For 133633/133651 co-relation queries the response was YES. [2024-06-21 18:20:54,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25608 conditions, 3728 events. 2428/3728 cut-off events. For 133633/133651 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18965 event pairs, 860 based on Foata normal form. 8/3677 useless extension candidates. Maximal degree in co-relation 25544. Up to 3272 conditions per place. [2024-06-21 18:20:54,704 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 172 selfloop transitions, 94 changer transitions 0/273 dead transitions. [2024-06-21 18:20:54,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 273 transitions, 3596 flow [2024-06-21 18:20:54,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:20:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:20:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-21 18:20:54,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-21 18:20:54,706 INFO L175 Difference]: Start difference. First operand has 143 places, 244 transitions, 2834 flow. Second operand 8 states and 162 transitions. [2024-06-21 18:20:54,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 273 transitions, 3596 flow [2024-06-21 18:20:54,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 273 transitions, 3488 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-06-21 18:20:54,820 INFO L231 Difference]: Finished difference. Result has 148 places, 247 transitions, 2987 flow [2024-06-21 18:20:54,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2738, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2987, PETRI_PLACES=148, PETRI_TRANSITIONS=247} [2024-06-21 18:20:54,820 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 105 predicate places. [2024-06-21 18:20:54,821 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 247 transitions, 2987 flow [2024-06-21 18:20:54,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-21 18:20:54,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:54,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:54,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-21 18:20:54,821 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:20:54,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash 275179311, now seen corresponding path program 5 times [2024-06-21 18:20:54,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:54,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262910408] [2024-06-21 18:20:54,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:54,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:56,907 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-21 18:20:56,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:56,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262910408] [2024-06-21 18:20:56,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262910408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:56,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:56,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:20:56,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030816240] [2024-06-21 18:20:56,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:56,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:20:56,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:56,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:20:56,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:20:57,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:20:57,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 247 transitions, 2987 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-21 18:20:57,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:20:57,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:20:57,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:20:58,268 INFO L124 PetriNetUnfolderBase]: 2441/3731 cut-off events. [2024-06-21 18:20:58,269 INFO L125 PetriNetUnfolderBase]: For 144471/144499 co-relation queries the response was YES. [2024-06-21 18:20:58,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26197 conditions, 3731 events. 2441/3731 cut-off events. For 144471/144499 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18984 event pairs, 868 based on Foata normal form. 8/3664 useless extension candidates. Maximal degree in co-relation 26131. Up to 3114 conditions per place. [2024-06-21 18:20:58,301 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 139 selfloop transitions, 132 changer transitions 0/278 dead transitions. [2024-06-21 18:20:58,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 278 transitions, 3849 flow [2024-06-21 18:20:58,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:20:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:20:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-21 18:20:58,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-06-21 18:20:58,303 INFO L175 Difference]: Start difference. First operand has 148 places, 247 transitions, 2987 flow. Second operand 9 states and 182 transitions. [2024-06-21 18:20:58,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 278 transitions, 3849 flow [2024-06-21 18:20:58,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 278 transitions, 3616 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-21 18:20:58,480 INFO L231 Difference]: Finished difference. Result has 151 places, 247 transitions, 3027 flow [2024-06-21 18:20:58,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2754, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3027, PETRI_PLACES=151, PETRI_TRANSITIONS=247} [2024-06-21 18:20:58,480 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 108 predicate places. [2024-06-21 18:20:58,480 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 247 transitions, 3027 flow [2024-06-21 18:20:58,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-21 18:20:58,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:20:58,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:20:58,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-21 18:20:58,481 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-21 18:20:58,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:20:58,482 INFO L85 PathProgramCache]: Analyzing trace with hash -609990863, now seen corresponding path program 6 times [2024-06-21 18:20:58,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:20:58,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874265640] [2024-06-21 18:20:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:20:58,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:20:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:20:59,986 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-21 18:20:59,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:20:59,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874265640] [2024-06-21 18:20:59,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874265640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:20:59,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:20:59,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:20:59,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124715346] [2024-06-21 18:20:59,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:20:59,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:20:59,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:20:59,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:20:59,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:21:00,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:21:00,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 247 transitions, 3027 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-21 18:21:00,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:00,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:21:00,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:00,958 INFO L124 PetriNetUnfolderBase]: 2780/4193 cut-off events. [2024-06-21 18:21:00,958 INFO L125 PetriNetUnfolderBase]: For 157472/157497 co-relation queries the response was YES. [2024-06-21 18:21:00,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28984 conditions, 4193 events. 2780/4193 cut-off events. For 157472/157497 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 20924 event pairs, 1124 based on Foata normal form. 3/4162 useless extension candidates. Maximal degree in co-relation 28917. Up to 3735 conditions per place. [2024-06-21 18:21:00,989 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 216 selfloop transitions, 96 changer transitions 0/317 dead transitions. [2024-06-21 18:21:00,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 317 transitions, 4619 flow [2024-06-21 18:21:00,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:21:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:21:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-21 18:21:00,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-21 18:21:00,991 INFO L175 Difference]: Start difference. First operand has 151 places, 247 transitions, 3027 flow. Second operand 8 states and 156 transitions. [2024-06-21 18:21:00,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 317 transitions, 4619 flow [2024-06-21 18:21:01,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 317 transitions, 4232 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-21 18:21:01,191 INFO L231 Difference]: Finished difference. Result has 154 places, 282 transitions, 3499 flow [2024-06-21 18:21:01,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2722, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3499, PETRI_PLACES=154, PETRI_TRANSITIONS=282} [2024-06-21 18:21:01,191 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 111 predicate places. [2024-06-21 18:21:01,192 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 282 transitions, 3499 flow [2024-06-21 18:21:01,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-21 18:21:01,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:01,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:01,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-21 18:21:01,192 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-21 18:21:01,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:01,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1210805921, now seen corresponding path program 7 times [2024-06-21 18:21:01,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:01,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564925937] [2024-06-21 18:21:01,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:02,654 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-21 18:21:02,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:02,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564925937] [2024-06-21 18:21:02,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564925937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:02,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:02,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:21:02,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424115878] [2024-06-21 18:21:02,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:02,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:21:02,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:02,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:21:02,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:21:02,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:21:02,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 282 transitions, 3499 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-21 18:21:02,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:02,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:21:02,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:03,615 INFO L124 PetriNetUnfolderBase]: 2772/4182 cut-off events. [2024-06-21 18:21:03,616 INFO L125 PetriNetUnfolderBase]: For 164896/164924 co-relation queries the response was YES. [2024-06-21 18:21:03,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29467 conditions, 4182 events. 2772/4182 cut-off events. For 164896/164924 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 20860 event pairs, 1124 based on Foata normal form. 3/4151 useless extension candidates. Maximal degree in co-relation 29396. Up to 3727 conditions per place. [2024-06-21 18:21:03,651 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 210 selfloop transitions, 100 changer transitions 0/315 dead transitions. [2024-06-21 18:21:03,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 315 transitions, 4464 flow [2024-06-21 18:21:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:21:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:21:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-21 18:21:03,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-06-21 18:21:03,653 INFO L175 Difference]: Start difference. First operand has 154 places, 282 transitions, 3499 flow. Second operand 8 states and 153 transitions. [2024-06-21 18:21:03,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 315 transitions, 4464 flow [2024-06-21 18:21:03,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 315 transitions, 4319 flow, removed 71 selfloop flow, removed 1 redundant places. [2024-06-21 18:21:03,875 INFO L231 Difference]: Finished difference. Result has 161 places, 282 transitions, 3568 flow [2024-06-21 18:21:03,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3354, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3568, PETRI_PLACES=161, PETRI_TRANSITIONS=282} [2024-06-21 18:21:03,876 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 118 predicate places. [2024-06-21 18:21:03,876 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 282 transitions, 3568 flow [2024-06-21 18:21:03,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-21 18:21:03,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:03,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:03,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-21 18:21:03,876 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-21 18:21:03,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:03,877 INFO L85 PathProgramCache]: Analyzing trace with hash 706772389, now seen corresponding path program 8 times [2024-06-21 18:21:03,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:03,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965332587] [2024-06-21 18:21:03,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:03,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:05,183 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-21 18:21:05,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:05,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965332587] [2024-06-21 18:21:05,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965332587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:05,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:05,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:21:05,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262884590] [2024-06-21 18:21:05,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:05,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:21:05,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:05,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:21:05,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:21:05,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:21:05,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 282 transitions, 3568 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-21 18:21:05,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:05,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:21:05,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:06,242 INFO L124 PetriNetUnfolderBase]: 2782/4195 cut-off events. [2024-06-21 18:21:06,242 INFO L125 PetriNetUnfolderBase]: For 175623/175648 co-relation queries the response was YES. [2024-06-21 18:21:06,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30072 conditions, 4195 events. 2782/4195 cut-off events. For 175623/175648 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 20919 event pairs, 1144 based on Foata normal form. 6/4170 useless extension candidates. Maximal degree in co-relation 29998. Up to 3971 conditions per place. [2024-06-21 18:21:06,282 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 280 selfloop transitions, 27 changer transitions 0/312 dead transitions. [2024-06-21 18:21:06,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 312 transitions, 4452 flow [2024-06-21 18:21:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:21:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:21:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-21 18:21:06,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-21 18:21:06,284 INFO L175 Difference]: Start difference. First operand has 161 places, 282 transitions, 3568 flow. Second operand 8 states and 144 transitions. [2024-06-21 18:21:06,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 312 transitions, 4452 flow [2024-06-21 18:21:06,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 312 transitions, 4253 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-21 18:21:06,500 INFO L231 Difference]: Finished difference. Result has 164 places, 290 transitions, 3597 flow [2024-06-21 18:21:06,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3381, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3597, PETRI_PLACES=164, PETRI_TRANSITIONS=290} [2024-06-21 18:21:06,500 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places. [2024-06-21 18:21:06,500 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 290 transitions, 3597 flow [2024-06-21 18:21:06,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-21 18:21:06,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:06,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:06,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-21 18:21:06,501 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-21 18:21:06,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash 586124541, now seen corresponding path program 9 times [2024-06-21 18:21:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:06,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467358411] [2024-06-21 18:21:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:06,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:07,904 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-21 18:21:07,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:07,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467358411] [2024-06-21 18:21:07,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467358411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:07,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:07,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:21:07,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951128117] [2024-06-21 18:21:07,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:07,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:21:07,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:07,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:21:07,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:21:08,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:21:08,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 290 transitions, 3597 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-21 18:21:08,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:08,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:21:08,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:09,019 INFO L124 PetriNetUnfolderBase]: 2800/4222 cut-off events. [2024-06-21 18:21:09,019 INFO L125 PetriNetUnfolderBase]: For 184365/184390 co-relation queries the response was YES. [2024-06-21 18:21:09,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30511 conditions, 4222 events. 2800/4222 cut-off events. For 184365/184390 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21072 event pairs, 1141 based on Foata normal form. 3/4194 useless extension candidates. Maximal degree in co-relation 30435. Up to 3927 conditions per place. [2024-06-21 18:21:09,051 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 272 selfloop transitions, 48 changer transitions 0/325 dead transitions. [2024-06-21 18:21:09,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 325 transitions, 4690 flow [2024-06-21 18:21:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:21:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:21:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-21 18:21:09,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-21 18:21:09,053 INFO L175 Difference]: Start difference. First operand has 164 places, 290 transitions, 3597 flow. Second operand 8 states and 149 transitions. [2024-06-21 18:21:09,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 325 transitions, 4690 flow [2024-06-21 18:21:09,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 325 transitions, 4593 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-21 18:21:09,251 INFO L231 Difference]: Finished difference. Result has 169 places, 297 transitions, 3754 flow [2024-06-21 18:21:09,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3500, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3754, PETRI_PLACES=169, PETRI_TRANSITIONS=297} [2024-06-21 18:21:09,251 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 126 predicate places. [2024-06-21 18:21:09,252 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 297 transitions, 3754 flow [2024-06-21 18:21:09,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-21 18:21:09,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:09,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:09,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-21 18:21:09,252 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-21 18:21:09,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2035103079, now seen corresponding path program 10 times [2024-06-21 18:21:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:09,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444143368] [2024-06-21 18:21:09,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:09,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:10,598 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-21 18:21:10,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:10,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444143368] [2024-06-21 18:21:10,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444143368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:10,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:10,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:21:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788771037] [2024-06-21 18:21:10,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:10,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:21:10,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:10,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:21:10,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:21:10,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:21:10,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 297 transitions, 3754 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-21 18:21:10,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:10,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:21:10,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:11,636 INFO L124 PetriNetUnfolderBase]: 2792/4211 cut-off events. [2024-06-21 18:21:11,637 INFO L125 PetriNetUnfolderBase]: For 192666/192691 co-relation queries the response was YES. [2024-06-21 18:21:11,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30713 conditions, 4211 events. 2792/4211 cut-off events. For 192666/192691 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21025 event pairs, 1141 based on Foata normal form. 3/4183 useless extension candidates. Maximal degree in co-relation 30634. Up to 3919 conditions per place. [2024-06-21 18:21:11,674 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 266 selfloop transitions, 51 changer transitions 0/322 dead transitions. [2024-06-21 18:21:11,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 322 transitions, 4566 flow [2024-06-21 18:21:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:21:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:21:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-21 18:21:11,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-21 18:21:11,676 INFO L175 Difference]: Start difference. First operand has 169 places, 297 transitions, 3754 flow. Second operand 8 states and 147 transitions. [2024-06-21 18:21:11,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 322 transitions, 4566 flow [2024-06-21 18:21:11,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 322 transitions, 4266 flow, removed 78 selfloop flow, removed 7 redundant places. [2024-06-21 18:21:11,962 INFO L231 Difference]: Finished difference. Result has 170 places, 298 transitions, 3579 flow [2024-06-21 18:21:11,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3460, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3579, PETRI_PLACES=170, PETRI_TRANSITIONS=298} [2024-06-21 18:21:11,963 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 127 predicate places. [2024-06-21 18:21:11,963 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 298 transitions, 3579 flow [2024-06-21 18:21:11,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-21 18:21:11,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:11,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:11,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-21 18:21:11,963 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-21 18:21:11,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:11,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2035103234, now seen corresponding path program 5 times [2024-06-21 18:21:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:11,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539543303] [2024-06-21 18:21:11,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:11,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:13,617 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-21 18:21:13,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:13,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539543303] [2024-06-21 18:21:13,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539543303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:13,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:13,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:21:13,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096086677] [2024-06-21 18:21:13,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:13,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:21:13,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:13,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:21:13,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:21:13,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:21:13,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 298 transitions, 3579 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-21 18:21:13,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:13,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:21:13,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:14,729 INFO L124 PetriNetUnfolderBase]: 2663/4055 cut-off events. [2024-06-21 18:21:14,729 INFO L125 PetriNetUnfolderBase]: For 209520/209565 co-relation queries the response was YES. [2024-06-21 18:21:14,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30461 conditions, 4055 events. 2663/4055 cut-off events. For 209520/209565 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 20634 event pairs, 1018 based on Foata normal form. 6/3999 useless extension candidates. Maximal degree in co-relation 30382. Up to 3740 conditions per place. [2024-06-21 18:21:14,768 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 282 selfloop transitions, 25 changer transitions 0/323 dead transitions. [2024-06-21 18:21:14,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 323 transitions, 4375 flow [2024-06-21 18:21:14,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:21:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:21:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-21 18:21:14,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-21 18:21:14,770 INFO L175 Difference]: Start difference. First operand has 170 places, 298 transitions, 3579 flow. Second operand 8 states and 148 transitions. [2024-06-21 18:21:14,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 323 transitions, 4375 flow [2024-06-21 18:21:15,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 323 transitions, 4290 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-21 18:21:15,041 INFO L231 Difference]: Finished difference. Result has 173 places, 301 transitions, 3609 flow [2024-06-21 18:21:15,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3494, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3609, PETRI_PLACES=173, PETRI_TRANSITIONS=301} [2024-06-21 18:21:15,041 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places. [2024-06-21 18:21:15,041 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 301 transitions, 3609 flow [2024-06-21 18:21:15,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-21 18:21:15,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:15,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:15,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-21 18:21:15,042 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-21 18:21:15,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:15,042 INFO L85 PathProgramCache]: Analyzing trace with hash 593753238, now seen corresponding path program 1 times [2024-06-21 18:21:15,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:15,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507557583] [2024-06-21 18:21:15,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:15,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:17,272 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-21 18:21:17,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:17,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507557583] [2024-06-21 18:21:17,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507557583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:17,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:17,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:21:17,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745067418] [2024-06-21 18:21:17,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:17,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:21:17,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:17,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:21:17,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:21:17,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:21:17,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 301 transitions, 3609 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-21 18:21:17,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:17,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:21:17,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:18,582 INFO L124 PetriNetUnfolderBase]: 2787/4204 cut-off events. [2024-06-21 18:21:18,582 INFO L125 PetriNetUnfolderBase]: For 210943/210970 co-relation queries the response was YES. [2024-06-21 18:21:18,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31064 conditions, 4204 events. 2787/4204 cut-off events. For 210943/210970 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 21008 event pairs, 1128 based on Foata normal form. 4/4177 useless extension candidates. Maximal degree in co-relation 30984. Up to 3996 conditions per place. [2024-06-21 18:21:18,624 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 303 selfloop transitions, 21 changer transitions 0/329 dead transitions. [2024-06-21 18:21:18,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 329 transitions, 4475 flow [2024-06-21 18:21:18,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:21:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:21:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-21 18:21:18,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4021164021164021 [2024-06-21 18:21:18,626 INFO L175 Difference]: Start difference. First operand has 173 places, 301 transitions, 3609 flow. Second operand 9 states and 152 transitions. [2024-06-21 18:21:18,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 329 transitions, 4475 flow [2024-06-21 18:21:18,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 329 transitions, 4386 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-21 18:21:18,892 INFO L231 Difference]: Finished difference. Result has 177 places, 307 transitions, 3680 flow [2024-06-21 18:21:18,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3520, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3680, PETRI_PLACES=177, PETRI_TRANSITIONS=307} [2024-06-21 18:21:18,892 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places. [2024-06-21 18:21:18,892 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 307 transitions, 3680 flow [2024-06-21 18:21:18,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-21 18:21:18,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:18,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:18,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-21 18:21:18,893 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:21:18,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:18,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1358159770, now seen corresponding path program 1 times [2024-06-21 18:21:18,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:18,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953623598] [2024-06-21 18:21:18,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:18,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:20,549 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-21 18:21:20,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:20,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953623598] [2024-06-21 18:21:20,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953623598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:20,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:20,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:21:20,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067985025] [2024-06-21 18:21:20,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:20,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:21:20,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:20,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:21:20,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:21:20,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:21:20,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 307 transitions, 3680 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-21 18:21:20,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:20,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:21:20,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:21,624 INFO L124 PetriNetUnfolderBase]: 2620/4013 cut-off events. [2024-06-21 18:21:21,625 INFO L125 PetriNetUnfolderBase]: For 221807/221982 co-relation queries the response was YES. [2024-06-21 18:21:21,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29908 conditions, 4013 events. 2620/4013 cut-off events. For 221807/221982 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 20704 event pairs, 1167 based on Foata normal form. 24/3977 useless extension candidates. Maximal degree in co-relation 29826. Up to 3727 conditions per place. [2024-06-21 18:21:21,666 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 246 selfloop transitions, 13 changer transitions 0/320 dead transitions. [2024-06-21 18:21:21,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 320 transitions, 4266 flow [2024-06-21 18:21:21,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 18:21:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 18:21:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-21 18:21:21,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2024-06-21 18:21:21,667 INFO L175 Difference]: Start difference. First operand has 177 places, 307 transitions, 3680 flow. Second operand 6 states and 109 transitions. [2024-06-21 18:21:21,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 320 transitions, 4266 flow [2024-06-21 18:21:22,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 320 transitions, 4157 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-21 18:21:22,007 INFO L231 Difference]: Finished difference. Result has 177 places, 310 transitions, 3637 flow [2024-06-21 18:21:22,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3571, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3637, PETRI_PLACES=177, PETRI_TRANSITIONS=310} [2024-06-21 18:21:22,008 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places. [2024-06-21 18:21:22,008 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 310 transitions, 3637 flow [2024-06-21 18:21:22,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-21 18:21:22,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:22,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:22,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-21 18:21:22,008 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-21 18:21:22,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:22,009 INFO L85 PathProgramCache]: Analyzing trace with hash 715406006, now seen corresponding path program 1 times [2024-06-21 18:21:22,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:22,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201700572] [2024-06-21 18:21:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:22,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:24,308 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-21 18:21:24,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:24,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201700572] [2024-06-21 18:21:24,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201700572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:24,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:24,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:21:24,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799285293] [2024-06-21 18:21:24,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:24,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:21:24,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:24,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:21:24,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:21:24,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:21:24,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 310 transitions, 3637 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-21 18:21:24,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:24,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:21:24,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:25,728 INFO L124 PetriNetUnfolderBase]: 2782/4242 cut-off events. [2024-06-21 18:21:25,729 INFO L125 PetriNetUnfolderBase]: For 247678/247737 co-relation queries the response was YES. [2024-06-21 18:21:25,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33171 conditions, 4242 events. 2782/4242 cut-off events. For 247678/247737 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 21854 event pairs, 856 based on Foata normal form. 17/4211 useless extension candidates. Maximal degree in co-relation 33088. Up to 3593 conditions per place. [2024-06-21 18:21:25,770 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 269 selfloop transitions, 110 changer transitions 0/396 dead transitions. [2024-06-21 18:21:25,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 396 transitions, 5452 flow [2024-06-21 18:21:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-21 18:21:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-21 18:21:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 237 transitions. [2024-06-21 18:21:25,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2024-06-21 18:21:25,772 INFO L175 Difference]: Start difference. First operand has 177 places, 310 transitions, 3637 flow. Second operand 12 states and 237 transitions. [2024-06-21 18:21:25,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 396 transitions, 5452 flow [2024-06-21 18:21:26,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 396 transitions, 5420 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-21 18:21:26,140 INFO L231 Difference]: Finished difference. Result has 188 places, 342 transitions, 4302 flow [2024-06-21 18:21:26,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3605, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4302, PETRI_PLACES=188, PETRI_TRANSITIONS=342} [2024-06-21 18:21:26,140 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 145 predicate places. [2024-06-21 18:21:26,140 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 342 transitions, 4302 flow [2024-06-21 18:21:26,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-21 18:21:26,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:26,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:26,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-21 18:21:26,141 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-21 18:21:26,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:26,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1769263332, now seen corresponding path program 1 times [2024-06-21 18:21:26,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:26,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079894915] [2024-06-21 18:21:26,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:26,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:27,585 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-21 18:21:27,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:27,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079894915] [2024-06-21 18:21:27,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079894915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:27,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:27,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:21:27,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989426648] [2024-06-21 18:21:27,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:27,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:21:27,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:27,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:21:27,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:21:27,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-21 18:21:27,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 342 transitions, 4302 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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-21 18:21:27,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:27,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-21 18:21:27,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:28,868 INFO L124 PetriNetUnfolderBase]: 2551/4029 cut-off events. [2024-06-21 18:21:28,868 INFO L125 PetriNetUnfolderBase]: For 295123/295225 co-relation queries the response was YES. [2024-06-21 18:21:28,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35140 conditions, 4029 events. 2551/4029 cut-off events. For 295123/295225 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 22565 event pairs, 590 based on Foata normal form. 19/3899 useless extension candidates. Maximal degree in co-relation 35052. Up to 3134 conditions per place. [2024-06-21 18:21:28,908 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 243 selfloop transitions, 99 changer transitions 0/389 dead transitions. [2024-06-21 18:21:28,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 389 transitions, 5580 flow [2024-06-21 18:21:28,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:21:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:21:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 218 transitions. [2024-06-21 18:21:28,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190476190476191 [2024-06-21 18:21:28,909 INFO L175 Difference]: Start difference. First operand has 188 places, 342 transitions, 4302 flow. Second operand 10 states and 218 transitions. [2024-06-21 18:21:28,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 389 transitions, 5580 flow [2024-06-21 18:21:29,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 389 transitions, 5462 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-21 18:21:29,331 INFO L231 Difference]: Finished difference. Result has 195 places, 352 transitions, 4673 flow [2024-06-21 18:21:29,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4184, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4673, PETRI_PLACES=195, PETRI_TRANSITIONS=352} [2024-06-21 18:21:29,331 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 152 predicate places. [2024-06-21 18:21:29,332 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 352 transitions, 4673 flow [2024-06-21 18:21:29,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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-21 18:21:29,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:29,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:29,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-21 18:21:29,332 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-21 18:21:29,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:29,333 INFO L85 PathProgramCache]: Analyzing trace with hash 535749628, now seen corresponding path program 2 times [2024-06-21 18:21:29,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:29,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239986950] [2024-06-21 18:21:29,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:29,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:31,124 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-21 18:21:31,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:31,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239986950] [2024-06-21 18:21:31,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239986950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:31,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:31,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:21:31,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250464578] [2024-06-21 18:21:31,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:31,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:21:31,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:31,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:21:31,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:21:31,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:21:31,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 352 transitions, 4673 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-21 18:21:31,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:31,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:21:31,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:32,642 INFO L124 PetriNetUnfolderBase]: 2969/4558 cut-off events. [2024-06-21 18:21:32,642 INFO L125 PetriNetUnfolderBase]: For 292841/292897 co-relation queries the response was YES. [2024-06-21 18:21:32,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38027 conditions, 4558 events. 2969/4558 cut-off events. For 292841/292897 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 24008 event pairs, 789 based on Foata normal form. 19/4533 useless extension candidates. Maximal degree in co-relation 37935. Up to 3685 conditions per place. [2024-06-21 18:21:32,688 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 252 selfloop transitions, 144 changer transitions 0/413 dead transitions. [2024-06-21 18:21:32,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 413 transitions, 6256 flow [2024-06-21 18:21:32,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 18:21:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 18:21:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 216 transitions. [2024-06-21 18:21:32,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2024-06-21 18:21:32,690 INFO L175 Difference]: Start difference. First operand has 195 places, 352 transitions, 4673 flow. Second operand 11 states and 216 transitions. [2024-06-21 18:21:32,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 413 transitions, 6256 flow [2024-06-21 18:21:33,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 413 transitions, 6130 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-21 18:21:33,142 INFO L231 Difference]: Finished difference. Result has 203 places, 374 transitions, 5316 flow [2024-06-21 18:21:33,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4553, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5316, PETRI_PLACES=203, PETRI_TRANSITIONS=374} [2024-06-21 18:21:33,142 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places. [2024-06-21 18:21:33,143 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 374 transitions, 5316 flow [2024-06-21 18:21:33,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-21 18:21:33,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:33,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:33,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-21 18:21:33,143 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-21 18:21:33,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash 630787042, now seen corresponding path program 2 times [2024-06-21 18:21:33,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:33,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707397463] [2024-06-21 18:21:33,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:33,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:35,586 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-21 18:21:35,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:35,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707397463] [2024-06-21 18:21:35,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707397463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:35,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:35,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:21:35,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958826577] [2024-06-21 18:21:35,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:35,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:21:35,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:35,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:21:35,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:21:35,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:21:35,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 374 transitions, 5316 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:21:35,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:35,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:21:35,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:37,067 INFO L124 PetriNetUnfolderBase]: 3115/4706 cut-off events. [2024-06-21 18:21:37,067 INFO L125 PetriNetUnfolderBase]: For 319086/319147 co-relation queries the response was YES. [2024-06-21 18:21:37,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41466 conditions, 4706 events. 3115/4706 cut-off events. For 319086/319147 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 24725 event pairs, 711 based on Foata normal form. 21/4605 useless extension candidates. Maximal degree in co-relation 41372. Up to 3988 conditions per place. [2024-06-21 18:21:37,110 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 293 selfloop transitions, 111 changer transitions 0/421 dead transitions. [2024-06-21 18:21:37,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 421 transitions, 6689 flow [2024-06-21 18:21:37,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:21:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:21:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 204 transitions. [2024-06-21 18:21:37,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-21 18:21:37,112 INFO L175 Difference]: Start difference. First operand has 203 places, 374 transitions, 5316 flow. Second operand 10 states and 204 transitions. [2024-06-21 18:21:37,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 421 transitions, 6689 flow [2024-06-21 18:21:37,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 421 transitions, 6499 flow, removed 48 selfloop flow, removed 7 redundant places. [2024-06-21 18:21:37,548 INFO L231 Difference]: Finished difference. Result has 206 places, 380 transitions, 5494 flow [2024-06-21 18:21:37,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5144, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5494, PETRI_PLACES=206, PETRI_TRANSITIONS=380} [2024-06-21 18:21:37,549 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 163 predicate places. [2024-06-21 18:21:37,549 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 380 transitions, 5494 flow [2024-06-21 18:21:37,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:21:37,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:37,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:37,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-21 18:21:37,550 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-21 18:21:37,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:37,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1834935086, now seen corresponding path program 3 times [2024-06-21 18:21:37,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:37,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605730691] [2024-06-21 18:21:37,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:37,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:40,145 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-21 18:21:40,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:40,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605730691] [2024-06-21 18:21:40,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605730691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:40,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:40,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:21:40,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723164640] [2024-06-21 18:21:40,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:40,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:21:40,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:40,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:21:40,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:21:40,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:21:40,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 380 transitions, 5494 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:21:40,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:40,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:21:40,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:41,614 INFO L124 PetriNetUnfolderBase]: 3091/4716 cut-off events. [2024-06-21 18:21:41,615 INFO L125 PetriNetUnfolderBase]: For 302953/303008 co-relation queries the response was YES. [2024-06-21 18:21:41,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40939 conditions, 4716 events. 3091/4716 cut-off events. For 302953/303008 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 24879 event pairs, 864 based on Foata normal form. 21/4643 useless extension candidates. Maximal degree in co-relation 40844. Up to 4107 conditions per place. [2024-06-21 18:21:41,668 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 301 selfloop transitions, 105 changer transitions 0/423 dead transitions. [2024-06-21 18:21:41,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 423 transitions, 6705 flow [2024-06-21 18:21:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:21:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:21:41,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-06-21 18:21:41,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2024-06-21 18:21:41,669 INFO L175 Difference]: Start difference. First operand has 206 places, 380 transitions, 5494 flow. Second operand 10 states and 201 transitions. [2024-06-21 18:21:41,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 423 transitions, 6705 flow [2024-06-21 18:21:42,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 423 transitions, 6359 flow, removed 76 selfloop flow, removed 7 redundant places. [2024-06-21 18:21:42,171 INFO L231 Difference]: Finished difference. Result has 209 places, 384 transitions, 5484 flow [2024-06-21 18:21:42,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5176, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5484, PETRI_PLACES=209, PETRI_TRANSITIONS=384} [2024-06-21 18:21:42,172 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 166 predicate places. [2024-06-21 18:21:42,172 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 384 transitions, 5484 flow [2024-06-21 18:21:42,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:21:42,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:42,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:42,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-21 18:21:42,173 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:21:42,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:42,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2112877036, now seen corresponding path program 3 times [2024-06-21 18:21:42,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:42,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608591052] [2024-06-21 18:21:42,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:42,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:44,556 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-21 18:21:44,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:44,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608591052] [2024-06-21 18:21:44,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608591052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:44,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:44,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:21:44,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55061546] [2024-06-21 18:21:44,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:44,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:21:44,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:44,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:21:44,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:21:44,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:21:44,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 384 transitions, 5484 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:21:44,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:44,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:21:44,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:46,009 INFO L124 PetriNetUnfolderBase]: 3212/4936 cut-off events. [2024-06-21 18:21:46,009 INFO L125 PetriNetUnfolderBase]: For 329192/329236 co-relation queries the response was YES. [2024-06-21 18:21:46,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42733 conditions, 4936 events. 3212/4936 cut-off events. For 329192/329236 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 26462 event pairs, 881 based on Foata normal form. 23/4915 useless extension candidates. Maximal degree in co-relation 42637. Up to 4116 conditions per place. [2024-06-21 18:21:46,057 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 311 selfloop transitions, 114 changer transitions 0/442 dead transitions. [2024-06-21 18:21:46,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 442 transitions, 7286 flow [2024-06-21 18:21:46,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:21:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:21:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2024-06-21 18:21:46,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973544973544973 [2024-06-21 18:21:46,058 INFO L175 Difference]: Start difference. First operand has 209 places, 384 transitions, 5484 flow. Second operand 9 states and 188 transitions. [2024-06-21 18:21:46,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 442 transitions, 7286 flow [2024-06-21 18:21:46,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 442 transitions, 7036 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-21 18:21:46,574 INFO L231 Difference]: Finished difference. Result has 210 places, 402 transitions, 5850 flow [2024-06-21 18:21:46,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5234, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5850, PETRI_PLACES=210, PETRI_TRANSITIONS=402} [2024-06-21 18:21:46,575 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 167 predicate places. [2024-06-21 18:21:46,575 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 402 transitions, 5850 flow [2024-06-21 18:21:46,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:21:46,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:46,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:46,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-21 18:21:46,576 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:21:46,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash 719364892, now seen corresponding path program 4 times [2024-06-21 18:21:46,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:46,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801747141] [2024-06-21 18:21:46,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:46,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:49,013 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-21 18:21:49,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:49,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801747141] [2024-06-21 18:21:49,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801747141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:49,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:49,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:21:49,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298490909] [2024-06-21 18:21:49,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:49,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:21:49,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:49,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:21:49,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:21:49,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:21:49,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 402 transitions, 5850 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:21:49,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:49,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:21:49,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:50,522 INFO L124 PetriNetUnfolderBase]: 3213/4915 cut-off events. [2024-06-21 18:21:50,522 INFO L125 PetriNetUnfolderBase]: For 330919/330962 co-relation queries the response was YES. [2024-06-21 18:21:50,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42952 conditions, 4915 events. 3213/4915 cut-off events. For 330919/330962 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 26231 event pairs, 911 based on Foata normal form. 13/4844 useless extension candidates. Maximal degree in co-relation 42855. Up to 4376 conditions per place. [2024-06-21 18:21:50,564 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 343 selfloop transitions, 73 changer transitions 0/433 dead transitions. [2024-06-21 18:21:50,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 433 transitions, 6887 flow [2024-06-21 18:21:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:21:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:21:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-21 18:21:50,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47354497354497355 [2024-06-21 18:21:50,566 INFO L175 Difference]: Start difference. First operand has 210 places, 402 transitions, 5850 flow. Second operand 9 states and 179 transitions. [2024-06-21 18:21:50,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 433 transitions, 6887 flow [2024-06-21 18:21:50,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 433 transitions, 6610 flow, removed 92 selfloop flow, removed 5 redundant places. [2024-06-21 18:21:50,995 INFO L231 Difference]: Finished difference. Result has 214 places, 402 transitions, 5731 flow [2024-06-21 18:21:50,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5573, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5731, PETRI_PLACES=214, PETRI_TRANSITIONS=402} [2024-06-21 18:21:50,996 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 171 predicate places. [2024-06-21 18:21:50,996 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 402 transitions, 5731 flow [2024-06-21 18:21:50,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:21:50,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:50,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:50,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-21 18:21:50,997 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:21:50,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:50,997 INFO L85 PathProgramCache]: Analyzing trace with hash 719504516, now seen corresponding path program 4 times [2024-06-21 18:21:50,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:50,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137556701] [2024-06-21 18:21:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:53,403 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-21 18:21:53,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:53,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137556701] [2024-06-21 18:21:53,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137556701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:53,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:53,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:21:53,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371634072] [2024-06-21 18:21:53,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:53,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:21:53,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:53,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:21:53,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:21:53,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:21:53,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 402 transitions, 5731 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:21:53,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:53,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:21:53,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:54,934 INFO L124 PetriNetUnfolderBase]: 3162/4868 cut-off events. [2024-06-21 18:21:54,934 INFO L125 PetriNetUnfolderBase]: For 335840/335884 co-relation queries the response was YES. [2024-06-21 18:21:54,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41851 conditions, 4868 events. 3162/4868 cut-off events. For 335840/335884 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 26130 event pairs, 877 based on Foata normal form. 25/4849 useless extension candidates. Maximal degree in co-relation 41752. Up to 4174 conditions per place. [2024-06-21 18:21:54,985 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 320 selfloop transitions, 100 changer transitions 0/437 dead transitions. [2024-06-21 18:21:54,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 437 transitions, 6989 flow [2024-06-21 18:21:54,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:21:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:21:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions. [2024-06-21 18:21:54,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2024-06-21 18:21:54,986 INFO L175 Difference]: Start difference. First operand has 214 places, 402 transitions, 5731 flow. Second operand 9 states and 183 transitions. [2024-06-21 18:21:54,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 437 transitions, 6989 flow [2024-06-21 18:21:55,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 437 transitions, 6711 flow, removed 56 selfloop flow, removed 8 redundant places. [2024-06-21 18:21:55,565 INFO L231 Difference]: Finished difference. Result has 215 places, 402 transitions, 5682 flow [2024-06-21 18:21:55,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5453, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5682, PETRI_PLACES=215, PETRI_TRANSITIONS=402} [2024-06-21 18:21:55,566 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 172 predicate places. [2024-06-21 18:21:55,566 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 402 transitions, 5682 flow [2024-06-21 18:21:55,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:21:55,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:55,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:55,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-21 18:21:55,567 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-21 18:21:55,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:55,567 INFO L85 PathProgramCache]: Analyzing trace with hash -428624450, now seen corresponding path program 5 times [2024-06-21 18:21:55,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:55,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547541522] [2024-06-21 18:21:55,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:55,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:21:57,956 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-21 18:21:57,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:21:57,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547541522] [2024-06-21 18:21:57,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547541522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:21:57,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:21:57,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:21:57,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548620408] [2024-06-21 18:21:57,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:21:57,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:21:57,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:21:57,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:21:57,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:21:58,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:21:58,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 402 transitions, 5682 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:21:58,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:21:58,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:21:58,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:21:59,382 INFO L124 PetriNetUnfolderBase]: 3136/4837 cut-off events. [2024-06-21 18:21:59,383 INFO L125 PetriNetUnfolderBase]: For 336740/336796 co-relation queries the response was YES. [2024-06-21 18:21:59,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41424 conditions, 4837 events. 3136/4837 cut-off events. For 336740/336796 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 26050 event pairs, 804 based on Foata normal form. 23/4816 useless extension candidates. Maximal degree in co-relation 41324. Up to 3886 conditions per place. [2024-06-21 18:21:59,430 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 271 selfloop transitions, 158 changer transitions 0/446 dead transitions. [2024-06-21 18:21:59,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 446 transitions, 7054 flow [2024-06-21 18:21:59,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:21:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:21:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2024-06-21 18:21:59,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-06-21 18:21:59,432 INFO L175 Difference]: Start difference. First operand has 215 places, 402 transitions, 5682 flow. Second operand 10 states and 208 transitions. [2024-06-21 18:21:59,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 446 transitions, 7054 flow [2024-06-21 18:21:59,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 446 transitions, 6823 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-21 18:21:59,965 INFO L231 Difference]: Finished difference. Result has 218 places, 402 transitions, 5793 flow [2024-06-21 18:21:59,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5451, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5793, PETRI_PLACES=218, PETRI_TRANSITIONS=402} [2024-06-21 18:21:59,966 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 175 predicate places. [2024-06-21 18:21:59,966 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 402 transitions, 5793 flow [2024-06-21 18:21:59,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:21:59,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:21:59,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:21:59,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-21 18:21:59,966 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:21:59,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:21:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash -59202086, now seen corresponding path program 6 times [2024-06-21 18:21:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:21:59,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018340054] [2024-06-21 18:21:59,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:21:59,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:21:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:22:02,314 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-21 18:22:02,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:22:02,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018340054] [2024-06-21 18:22:02,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018340054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:22:02,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:22:02,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:22:02,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126680252] [2024-06-21 18:22:02,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:22:02,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:22:02,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:22:02,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:22:02,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:22:02,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:22:02,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 402 transitions, 5793 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:22:02,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:22:02,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:22:02,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:22:03,749 INFO L124 PetriNetUnfolderBase]: 3282/5031 cut-off events. [2024-06-21 18:22:03,749 INFO L125 PetriNetUnfolderBase]: For 359629/359676 co-relation queries the response was YES. [2024-06-21 18:22:03,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43769 conditions, 5031 events. 3282/5031 cut-off events. For 359629/359676 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 27022 event pairs, 814 based on Foata normal form. 46/5028 useless extension candidates. Maximal degree in co-relation 43668. Up to 3940 conditions per place. [2024-06-21 18:22:03,809 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 253 selfloop transitions, 198 changer transitions 0/468 dead transitions. [2024-06-21 18:22:03,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 468 transitions, 7869 flow [2024-06-21 18:22:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:22:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:22:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2024-06-21 18:22:03,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105820105820106 [2024-06-21 18:22:03,811 INFO L175 Difference]: Start difference. First operand has 218 places, 402 transitions, 5793 flow. Second operand 9 states and 193 transitions. [2024-06-21 18:22:03,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 468 transitions, 7869 flow [2024-06-21 18:22:04,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 468 transitions, 7394 flow, removed 46 selfloop flow, removed 10 redundant places. [2024-06-21 18:22:04,456 INFO L231 Difference]: Finished difference. Result has 219 places, 423 transitions, 6298 flow [2024-06-21 18:22:04,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5326, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6298, PETRI_PLACES=219, PETRI_TRANSITIONS=423} [2024-06-21 18:22:04,456 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 176 predicate places. [2024-06-21 18:22:04,457 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 423 transitions, 6298 flow [2024-06-21 18:22:04,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:22:04,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:22:04,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:22:04,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-21 18:22:04,457 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-21 18:22:04,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:22:04,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1775754910, now seen corresponding path program 1 times [2024-06-21 18:22:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:22:04,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942456765] [2024-06-21 18:22:04,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:22:04,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:22:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:22:06,615 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-21 18:22:06,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:22:06,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942456765] [2024-06-21 18:22:06,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942456765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:22:06,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:22:06,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:22:06,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108433259] [2024-06-21 18:22:06,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:22:06,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:22:06,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:22:06,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:22:06,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:22:06,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:22:06,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 423 transitions, 6298 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-21 18:22:06,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:22:06,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:22:06,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:22:08,232 INFO L124 PetriNetUnfolderBase]: 3515/5311 cut-off events. [2024-06-21 18:22:08,232 INFO L125 PetriNetUnfolderBase]: For 355797/355816 co-relation queries the response was YES. [2024-06-21 18:22:08,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45336 conditions, 5311 events. 3515/5311 cut-off events. For 355797/355816 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 27802 event pairs, 1038 based on Foata normal form. 4/5292 useless extension candidates. Maximal degree in co-relation 45234. Up to 4845 conditions per place. [2024-06-21 18:22:08,284 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 370 selfloop transitions, 98 changer transitions 0/473 dead transitions. [2024-06-21 18:22:08,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 473 transitions, 7674 flow [2024-06-21 18:22:08,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:22:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:22:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-21 18:22:08,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2024-06-21 18:22:08,286 INFO L175 Difference]: Start difference. First operand has 219 places, 423 transitions, 6298 flow. Second operand 9 states and 172 transitions. [2024-06-21 18:22:08,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 473 transitions, 7674 flow [2024-06-21 18:22:08,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 473 transitions, 7399 flow, removed 95 selfloop flow, removed 5 redundant places. [2024-06-21 18:22:08,925 INFO L231 Difference]: Finished difference. Result has 225 places, 442 transitions, 6515 flow [2024-06-21 18:22:08,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6032, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6515, PETRI_PLACES=225, PETRI_TRANSITIONS=442} [2024-06-21 18:22:08,926 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places. [2024-06-21 18:22:08,926 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 442 transitions, 6515 flow [2024-06-21 18:22:08,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-21 18:22:08,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:22:08,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:22:08,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-21 18:22:08,926 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-21 18:22:08,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:22:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash -59375066, now seen corresponding path program 7 times [2024-06-21 18:22:08,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:22:08,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160392098] [2024-06-21 18:22:08,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:22:08,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:22:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:22:11,318 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-21 18:22:11,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:22:11,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160392098] [2024-06-21 18:22:11,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160392098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:22:11,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:22:11,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:22:11,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232850691] [2024-06-21 18:22:11,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:22:11,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:22:11,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:22:11,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:22:11,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:22:11,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:22:11,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 442 transitions, 6515 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:22:11,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:22:11,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:22:11,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:22:12,861 INFO L124 PetriNetUnfolderBase]: 3316/5084 cut-off events. [2024-06-21 18:22:12,862 INFO L125 PetriNetUnfolderBase]: For 350467/350495 co-relation queries the response was YES. [2024-06-21 18:22:12,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44192 conditions, 5084 events. 3316/5084 cut-off events. For 350467/350495 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 27262 event pairs, 817 based on Foata normal form. 27/5067 useless extension candidates. Maximal degree in co-relation 44088. Up to 3970 conditions per place. [2024-06-21 18:22:13,005 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 268 selfloop transitions, 204 changer transitions 0/491 dead transitions. [2024-06-21 18:22:13,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 491 transitions, 8304 flow [2024-06-21 18:22:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:22:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:22:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2024-06-21 18:22:13,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-06-21 18:22:13,007 INFO L175 Difference]: Start difference. First operand has 225 places, 442 transitions, 6515 flow. Second operand 9 states and 195 transitions. [2024-06-21 18:22:13,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 491 transitions, 8304 flow [2024-06-21 18:22:13,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 491 transitions, 8124 flow, removed 39 selfloop flow, removed 4 redundant places. [2024-06-21 18:22:13,604 INFO L231 Difference]: Finished difference. Result has 231 places, 445 transitions, 6876 flow [2024-06-21 18:22:13,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6355, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6876, PETRI_PLACES=231, PETRI_TRANSITIONS=445} [2024-06-21 18:22:13,605 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 188 predicate places. [2024-06-21 18:22:13,605 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 445 transitions, 6876 flow [2024-06-21 18:22:13,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:22:13,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:22:13,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:22:13,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-21 18:22:13,605 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:22:13,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:22:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1775939484, now seen corresponding path program 8 times [2024-06-21 18:22:13,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:22:13,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108761279] [2024-06-21 18:22:13,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:22:13,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:22:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:22:16,343 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-21 18:22:16,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:22:16,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108761279] [2024-06-21 18:22:16,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108761279] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:22:16,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:22:16,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:22:16,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508822022] [2024-06-21 18:22:16,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:22:16,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:22:16,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:22:16,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:22:16,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:22:16,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:22:16,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 445 transitions, 6876 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:22:16,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:22:16,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:22:16,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:22:17,977 INFO L124 PetriNetUnfolderBase]: 3337/5129 cut-off events. [2024-06-21 18:22:17,977 INFO L125 PetriNetUnfolderBase]: For 381718/381746 co-relation queries the response was YES. [2024-06-21 18:22:18,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46003 conditions, 5129 events. 3337/5129 cut-off events. For 381718/381746 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 27648 event pairs, 801 based on Foata normal form. 22/5110 useless extension candidates. Maximal degree in co-relation 45897. Up to 3879 conditions per place. [2024-06-21 18:22:18,035 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 263 selfloop transitions, 214 changer transitions 0/496 dead transitions. [2024-06-21 18:22:18,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 496 transitions, 8729 flow [2024-06-21 18:22:18,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:22:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:22:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2024-06-21 18:22:18,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-06-21 18:22:18,037 INFO L175 Difference]: Start difference. First operand has 231 places, 445 transitions, 6876 flow. Second operand 9 states and 195 transitions. [2024-06-21 18:22:18,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 496 transitions, 8729 flow [2024-06-21 18:22:18,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 496 transitions, 8101 flow, removed 77 selfloop flow, removed 8 redundant places. [2024-06-21 18:22:18,754 INFO L231 Difference]: Finished difference. Result has 233 places, 451 transitions, 6931 flow [2024-06-21 18:22:18,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6264, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6931, PETRI_PLACES=233, PETRI_TRANSITIONS=451} [2024-06-21 18:22:18,755 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places. [2024-06-21 18:22:18,755 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 451 transitions, 6931 flow [2024-06-21 18:22:18,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:22:18,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:22:18,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:22:18,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-21 18:22:18,756 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-21 18:22:18,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:22:18,756 INFO L85 PathProgramCache]: Analyzing trace with hash -59379840, now seen corresponding path program 5 times [2024-06-21 18:22:18,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:22:18,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908476745] [2024-06-21 18:22:18,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:22:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:22:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:22:21,083 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-21 18:22:21,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:22:21,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908476745] [2024-06-21 18:22:21,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908476745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:22:21,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:22:21,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:22:21,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948840887] [2024-06-21 18:22:21,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:22:21,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:22:21,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:22:21,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:22:21,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:22:21,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:22:21,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 451 transitions, 6931 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:22:21,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:22:21,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:22:21,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:22:22,580 INFO L124 PetriNetUnfolderBase]: 3335/5132 cut-off events. [2024-06-21 18:22:22,581 INFO L125 PetriNetUnfolderBase]: For 359845/359872 co-relation queries the response was YES. [2024-06-21 18:22:22,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45951 conditions, 5132 events. 3335/5132 cut-off events. For 359845/359872 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 27593 event pairs, 796 based on Foata normal form. 22/5128 useless extension candidates. Maximal degree in co-relation 45844. Up to 4504 conditions per place. [2024-06-21 18:22:22,635 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 369 selfloop transitions, 96 changer transitions 0/484 dead transitions. [2024-06-21 18:22:22,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 484 transitions, 8186 flow [2024-06-21 18:22:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:22:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:22:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-21 18:22:22,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-21 18:22:22,636 INFO L175 Difference]: Start difference. First operand has 233 places, 451 transitions, 6931 flow. Second operand 9 states and 180 transitions. [2024-06-21 18:22:22,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 484 transitions, 8186 flow [2024-06-21 18:22:23,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 484 transitions, 7936 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-21 18:22:23,263 INFO L231 Difference]: Finished difference. Result has 237 places, 453 transitions, 6946 flow [2024-06-21 18:22:23,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6681, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6946, PETRI_PLACES=237, PETRI_TRANSITIONS=453} [2024-06-21 18:22:23,263 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 194 predicate places. [2024-06-21 18:22:23,263 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 453 transitions, 6946 flow [2024-06-21 18:22:23,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-21 18:22:23,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:22:23,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:22:23,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-21 18:22:23,264 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-21 18:22:23,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:22:23,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1989681320, now seen corresponding path program 1 times [2024-06-21 18:22:23,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:22:23,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577699133] [2024-06-21 18:22:23,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:22:23,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:22:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:22:24,835 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-21 18:22:24,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:22:24,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577699133] [2024-06-21 18:22:24,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577699133] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:22:24,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:22:24,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:22:24,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183190706] [2024-06-21 18:22:24,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:22:24,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:22:24,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:22:24,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:22:24,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:22:24,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:22:24,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 453 transitions, 6946 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-21 18:22:24,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:22:24,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:22:24,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:22:26,176 INFO L124 PetriNetUnfolderBase]: 3385/5223 cut-off events. [2024-06-21 18:22:26,176 INFO L125 PetriNetUnfolderBase]: For 371933/371974 co-relation queries the response was YES. [2024-06-21 18:22:26,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46421 conditions, 5223 events. 3385/5223 cut-off events. For 371933/371974 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 28333 event pairs, 941 based on Foata normal form. 23/5226 useless extension candidates. Maximal degree in co-relation 46312. Up to 4735 conditions per place. [2024-06-21 18:22:26,241 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 357 selfloop transitions, 41 changer transitions 0/477 dead transitions. [2024-06-21 18:22:26,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 477 transitions, 8000 flow [2024-06-21 18:22:26,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:22:26,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:22:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-21 18:22:26,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-21 18:22:26,242 INFO L175 Difference]: Start difference. First operand has 237 places, 453 transitions, 6946 flow. Second operand 7 states and 133 transitions. [2024-06-21 18:22:26,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 477 transitions, 8000 flow [2024-06-21 18:22:26,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 477 transitions, 7753 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-21 18:22:26,924 INFO L231 Difference]: Finished difference. Result has 237 places, 459 transitions, 6867 flow [2024-06-21 18:22:26,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6699, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6867, PETRI_PLACES=237, PETRI_TRANSITIONS=459} [2024-06-21 18:22:26,925 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 194 predicate places. [2024-06-21 18:22:26,925 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 459 transitions, 6867 flow [2024-06-21 18:22:26,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-21 18:22:26,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:22:26,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:22:26,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-21 18:22:26,925 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:22:26,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:22:26,926 INFO L85 PathProgramCache]: Analyzing trace with hash -572037140, now seen corresponding path program 1 times [2024-06-21 18:22:26,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:22:26,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876611507] [2024-06-21 18:22:26,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:22:26,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:22:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:22:29,112 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-21 18:22:29,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:22:29,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876611507] [2024-06-21 18:22:29,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876611507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:22:29,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:22:29,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:22:29,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424992844] [2024-06-21 18:22:29,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:22:29,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:22:29,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:22:29,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:22:29,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:22:29,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:22:29,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 459 transitions, 6867 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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-21 18:22:29,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:22:29,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:22:29,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:22:31,069 INFO L124 PetriNetUnfolderBase]: 3451/5301 cut-off events. [2024-06-21 18:22:31,069 INFO L125 PetriNetUnfolderBase]: For 423510/423543 co-relation queries the response was YES. [2024-06-21 18:22:31,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48970 conditions, 5301 events. 3451/5301 cut-off events. For 423510/423543 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 28837 event pairs, 798 based on Foata normal form. 21/5268 useless extension candidates. Maximal degree in co-relation 48860. Up to 4236 conditions per place. [2024-06-21 18:22:31,132 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 326 selfloop transitions, 163 changer transitions 0/510 dead transitions. [2024-06-21 18:22:31,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 510 transitions, 8693 flow [2024-06-21 18:22:31,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-21 18:22:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-21 18:22:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2024-06-21 18:22:31,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2024-06-21 18:22:31,134 INFO L175 Difference]: Start difference. First operand has 237 places, 459 transitions, 6867 flow. Second operand 12 states and 236 transitions. [2024-06-21 18:22:31,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 510 transitions, 8693 flow [2024-06-21 18:22:31,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 510 transitions, 8633 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-21 18:22:31,856 INFO L231 Difference]: Finished difference. Result has 247 places, 463 transitions, 7270 flow [2024-06-21 18:22:31,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6807, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7270, PETRI_PLACES=247, PETRI_TRANSITIONS=463} [2024-06-21 18:22:31,857 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 204 predicate places. [2024-06-21 18:22:31,857 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 463 transitions, 7270 flow [2024-06-21 18:22:31,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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-21 18:22:31,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:22:31,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:22:31,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-21 18:22:31,857 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-21 18:22:31,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:22:31,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1004259034, now seen corresponding path program 1 times [2024-06-21 18:22:31,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:22:31,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481777297] [2024-06-21 18:22:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:22:31,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:22:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:22:33,463 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-21 18:22:33,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:22:33,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481777297] [2024-06-21 18:22:33,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481777297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:22:33,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:22:33,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:22:33,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478044612] [2024-06-21 18:22:33,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:22:33,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:22:33,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:22:33,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:22:33,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:22:33,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:22:33,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 463 transitions, 7270 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-21 18:22:33,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:22:33,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:22:33,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:22:34,979 INFO L124 PetriNetUnfolderBase]: 3706/5613 cut-off events. [2024-06-21 18:22:34,979 INFO L125 PetriNetUnfolderBase]: For 424759/424770 co-relation queries the response was YES. [2024-06-21 18:22:35,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51602 conditions, 5613 events. 3706/5613 cut-off events. For 424759/424770 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 29802 event pairs, 1267 based on Foata normal form. 3/5597 useless extension candidates. Maximal degree in co-relation 51489. Up to 5299 conditions per place. [2024-06-21 18:22:35,048 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 431 selfloop transitions, 55 changer transitions 0/493 dead transitions. [2024-06-21 18:22:35,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 493 transitions, 8461 flow [2024-06-21 18:22:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:22:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:22:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-21 18:22:35,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2024-06-21 18:22:35,050 INFO L175 Difference]: Start difference. First operand has 247 places, 463 transitions, 7270 flow. Second operand 9 states and 159 transitions. [2024-06-21 18:22:35,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 493 transitions, 8461 flow [2024-06-21 18:22:36,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 493 transitions, 8190 flow, removed 53 selfloop flow, removed 7 redundant places. [2024-06-21 18:22:36,296 INFO L231 Difference]: Finished difference. Result has 249 places, 469 transitions, 7245 flow [2024-06-21 18:22:36,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7006, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7245, PETRI_PLACES=249, PETRI_TRANSITIONS=469} [2024-06-21 18:22:36,296 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 206 predicate places. [2024-06-21 18:22:36,296 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 469 transitions, 7245 flow [2024-06-21 18:22:36,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-21 18:22:36,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:22:36,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:22:36,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-21 18:22:36,297 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-21 18:22:36,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:22:36,298 INFO L85 PathProgramCache]: Analyzing trace with hash -691218739, now seen corresponding path program 1 times [2024-06-21 18:22:36,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:22:36,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043113183] [2024-06-21 18:22:36,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:22:36,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:22:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:22:37,889 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-21 18:22:37,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:22:37,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043113183] [2024-06-21 18:22:37,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043113183] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:22:37,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:22:37,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:22:37,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671273458] [2024-06-21 18:22:37,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:22:37,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:22:37,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:22:37,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:22:37,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:22:38,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:22:38,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 469 transitions, 7245 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-21 18:22:38,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:22:38,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:22:38,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:22:39,343 INFO L124 PetriNetUnfolderBase]: 3498/5382 cut-off events. [2024-06-21 18:22:39,344 INFO L125 PetriNetUnfolderBase]: For 431477/431614 co-relation queries the response was YES. [2024-06-21 18:22:39,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49333 conditions, 5382 events. 3498/5382 cut-off events. For 431477/431614 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29694 event pairs, 1285 based on Foata normal form. 53/5362 useless extension candidates. Maximal degree in co-relation 49218. Up to 4921 conditions per place. [2024-06-21 18:22:39,412 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 381 selfloop transitions, 38 changer transitions 0/498 dead transitions. [2024-06-21 18:22:39,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 498 transitions, 8482 flow [2024-06-21 18:22:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:22:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:22:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-21 18:22:39,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-21 18:22:39,413 INFO L175 Difference]: Start difference. First operand has 249 places, 469 transitions, 7245 flow. Second operand 7 states and 131 transitions. [2024-06-21 18:22:39,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 498 transitions, 8482 flow [2024-06-21 18:22:40,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 498 transitions, 8389 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-21 18:22:40,200 INFO L231 Difference]: Finished difference. Result has 253 places, 484 transitions, 7419 flow [2024-06-21 18:22:40,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7152, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7419, PETRI_PLACES=253, PETRI_TRANSITIONS=484} [2024-06-21 18:22:40,201 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 210 predicate places. [2024-06-21 18:22:40,201 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 484 transitions, 7419 flow [2024-06-21 18:22:40,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-21 18:22:40,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:22:40,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:22:40,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-21 18:22:40,201 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:22:40,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:22:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2086749098, now seen corresponding path program 2 times [2024-06-21 18:22:40,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:22:40,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224824329] [2024-06-21 18:22:40,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:22:40,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:22:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:22:42,949 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-21 18:22:42,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:22:42,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224824329] [2024-06-21 18:22:42,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224824329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:22:42,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:22:42,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:22:42,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391220600] [2024-06-21 18:22:42,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:22:42,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:22:42,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:22:42,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:22:42,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:22:43,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:22:43,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 484 transitions, 7419 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:22:43,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:22:43,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:22:43,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:22:44,895 INFO L124 PetriNetUnfolderBase]: 3743/5732 cut-off events. [2024-06-21 18:22:44,895 INFO L125 PetriNetUnfolderBase]: For 555767/555806 co-relation queries the response was YES. [2024-06-21 18:22:44,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56691 conditions, 5732 events. 3743/5732 cut-off events. For 555767/555806 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 31757 event pairs, 660 based on Foata normal form. 34/5686 useless extension candidates. Maximal degree in co-relation 56572. Up to 3989 conditions per place. [2024-06-21 18:22:44,963 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 349 selfloop transitions, 171 changer transitions 0/543 dead transitions. [2024-06-21 18:22:44,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 543 transitions, 9397 flow [2024-06-21 18:22:44,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 18:22:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 18:22:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 234 transitions. [2024-06-21 18:22:44,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064935064935064 [2024-06-21 18:22:44,969 INFO L175 Difference]: Start difference. First operand has 253 places, 484 transitions, 7419 flow. Second operand 11 states and 234 transitions. [2024-06-21 18:22:44,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 543 transitions, 9397 flow [2024-06-21 18:22:46,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 543 transitions, 9354 flow, removed 20 selfloop flow, removed 1 redundant places. [2024-06-21 18:22:46,006 INFO L231 Difference]: Finished difference. Result has 263 places, 486 transitions, 7828 flow [2024-06-21 18:22:46,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7376, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7828, PETRI_PLACES=263, PETRI_TRANSITIONS=486} [2024-06-21 18:22:46,007 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 220 predicate places. [2024-06-21 18:22:46,007 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 486 transitions, 7828 flow [2024-06-21 18:22:46,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:22:46,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:22:46,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:22:46,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-21 18:22:46,007 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-21 18:22:46,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:22:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash -859113572, now seen corresponding path program 2 times [2024-06-21 18:22:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:22:46,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455906794] [2024-06-21 18:22:46,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:22:46,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:22:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:22:47,391 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-21 18:22:47,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:22:47,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455906794] [2024-06-21 18:22:47,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455906794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:22:47,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:22:47,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:22:47,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439281529] [2024-06-21 18:22:47,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:22:47,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:22:47,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:22:47,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:22:47,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:22:47,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:22:47,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 486 transitions, 7828 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-21 18:22:47,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:22:47,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:22:47,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:22:48,693 INFO L124 PetriNetUnfolderBase]: 3697/5717 cut-off events. [2024-06-21 18:22:48,693 INFO L125 PetriNetUnfolderBase]: For 505854/505991 co-relation queries the response was YES. [2024-06-21 18:22:48,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54847 conditions, 5717 events. 3697/5717 cut-off events. For 505854/505991 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 32192 event pairs, 1425 based on Foata normal form. 55/5698 useless extension candidates. Maximal degree in co-relation 54725. Up to 5274 conditions per place. [2024-06-21 18:22:48,768 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 388 selfloop transitions, 31 changer transitions 0/498 dead transitions. [2024-06-21 18:22:48,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 498 transitions, 8824 flow [2024-06-21 18:22:48,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 18:22:48,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 18:22:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-21 18:22:48,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-21 18:22:48,775 INFO L175 Difference]: Start difference. First operand has 263 places, 486 transitions, 7828 flow. Second operand 6 states and 114 transitions. [2024-06-21 18:22:48,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 498 transitions, 8824 flow [2024-06-21 18:22:49,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 498 transitions, 8569 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-21 18:22:49,683 INFO L231 Difference]: Finished difference. Result has 262 places, 486 transitions, 7648 flow [2024-06-21 18:22:49,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7573, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7648, PETRI_PLACES=262, PETRI_TRANSITIONS=486} [2024-06-21 18:22:49,684 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 219 predicate places. [2024-06-21 18:22:49,684 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 486 transitions, 7648 flow [2024-06-21 18:22:49,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-21 18:22:49,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:22:49,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:22:49,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-21 18:22:49,684 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:22:49,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:22:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1336487856, now seen corresponding path program 9 times [2024-06-21 18:22:49,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:22:49,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55456342] [2024-06-21 18:22:49,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:22:49,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:22:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:22:51,683 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-21 18:22:51,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:22:51,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55456342] [2024-06-21 18:22:51,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55456342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:22:51,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:22:51,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:22:51,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276958262] [2024-06-21 18:22:51,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:22:51,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:22:51,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:22:51,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:22:51,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:22:51,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:22:51,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 486 transitions, 7648 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-21 18:22:51,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:22:51,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:22:51,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:22:53,530 INFO L124 PetriNetUnfolderBase]: 3749/5783 cut-off events. [2024-06-21 18:22:53,531 INFO L125 PetriNetUnfolderBase]: For 556526/556546 co-relation queries the response was YES. [2024-06-21 18:22:53,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57503 conditions, 5783 events. 3749/5783 cut-off events. For 556526/556546 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 32273 event pairs, 1251 based on Foata normal form. 15/5727 useless extension candidates. Maximal degree in co-relation 57379. Up to 5173 conditions per place. [2024-06-21 18:22:53,600 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 441 selfloop transitions, 77 changer transitions 0/541 dead transitions. [2024-06-21 18:22:53,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 541 transitions, 9745 flow [2024-06-21 18:22:53,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:22:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:22:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-21 18:22:53,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-21 18:22:53,601 INFO L175 Difference]: Start difference. First operand has 262 places, 486 transitions, 7648 flow. Second operand 10 states and 185 transitions. [2024-06-21 18:22:53,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 541 transitions, 9745 flow [2024-06-21 18:22:54,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 541 transitions, 9699 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-21 18:22:54,618 INFO L231 Difference]: Finished difference. Result has 269 places, 507 transitions, 8210 flow [2024-06-21 18:22:54,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7602, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8210, PETRI_PLACES=269, PETRI_TRANSITIONS=507} [2024-06-21 18:22:54,618 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 226 predicate places. [2024-06-21 18:22:54,618 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 507 transitions, 8210 flow [2024-06-21 18:22:54,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-21 18:22:54,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:22:54,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:22:54,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-21 18:22:54,619 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:22:54,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:22:54,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1336315062, now seen corresponding path program 2 times [2024-06-21 18:22:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:22:54,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596702209] [2024-06-21 18:22:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:22:54,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:22:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:22:56,159 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-21 18:22:56,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:22:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596702209] [2024-06-21 18:22:56,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596702209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:22:56,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:22:56,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:22:56,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138757509] [2024-06-21 18:22:56,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:22:56,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:22:56,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:22:56,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:22:56,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:22:56,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:22:56,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 507 transitions, 8210 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-21 18:22:56,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:22:56,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:22:56,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:22:57,882 INFO L124 PetriNetUnfolderBase]: 4021/6112 cut-off events. [2024-06-21 18:22:57,883 INFO L125 PetriNetUnfolderBase]: For 573956/573967 co-relation queries the response was YES. [2024-06-21 18:22:57,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59803 conditions, 6112 events. 4021/6112 cut-off events. For 573956/573967 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 33185 event pairs, 1440 based on Foata normal form. 3/6096 useless extension candidates. Maximal degree in co-relation 59677. Up to 5645 conditions per place. [2024-06-21 18:22:57,968 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 449 selfloop transitions, 79 changer transitions 0/537 dead transitions. [2024-06-21 18:22:57,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 537 transitions, 9685 flow [2024-06-21 18:22:57,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:22:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:22:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-21 18:22:57,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2024-06-21 18:22:57,970 INFO L175 Difference]: Start difference. First operand has 269 places, 507 transitions, 8210 flow. Second operand 9 states and 165 transitions. [2024-06-21 18:22:57,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 537 transitions, 9685 flow [2024-06-21 18:22:59,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 537 transitions, 9421 flow, removed 120 selfloop flow, removed 5 redundant places. [2024-06-21 18:22:59,147 INFO L231 Difference]: Finished difference. Result has 273 places, 507 transitions, 8119 flow [2024-06-21 18:22:59,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7950, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8119, PETRI_PLACES=273, PETRI_TRANSITIONS=507} [2024-06-21 18:22:59,148 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 230 predicate places. [2024-06-21 18:22:59,148 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 507 transitions, 8119 flow [2024-06-21 18:22:59,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-21 18:22:59,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:22:59,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:22:59,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-21 18:22:59,148 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:22:59,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:22:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash 989814718, now seen corresponding path program 6 times [2024-06-21 18:22:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:22:59,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240492947] [2024-06-21 18:22:59,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:22:59,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:22:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:23:01,619 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-21 18:23:01,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:23:01,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240492947] [2024-06-21 18:23:01,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240492947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:23:01,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:23:01,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:23:01,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151956521] [2024-06-21 18:23:01,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:23:01,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:23:01,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:23:01,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:23:01,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:23:01,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:23:01,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 507 transitions, 8119 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-21 18:23:01,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:23:01,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:23:01,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:23:03,512 INFO L124 PetriNetUnfolderBase]: 3733/5758 cut-off events. [2024-06-21 18:23:03,513 INFO L125 PetriNetUnfolderBase]: For 580768/580789 co-relation queries the response was YES. [2024-06-21 18:23:03,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58227 conditions, 5758 events. 3733/5758 cut-off events. For 580768/580789 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 32126 event pairs, 1259 based on Foata normal form. 12/5699 useless extension candidates. Maximal degree in co-relation 58100. Up to 5277 conditions per place. [2024-06-21 18:23:03,587 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 486 selfloop transitions, 27 changer transitions 0/536 dead transitions. [2024-06-21 18:23:03,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 536 transitions, 9416 flow [2024-06-21 18:23:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:23:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:23:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-21 18:23:03,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2024-06-21 18:23:03,588 INFO L175 Difference]: Start difference. First operand has 273 places, 507 transitions, 8119 flow. Second operand 9 states and 165 transitions. [2024-06-21 18:23:03,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 536 transitions, 9416 flow [2024-06-21 18:23:04,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 536 transitions, 9292 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-21 18:23:04,614 INFO L231 Difference]: Finished difference. Result has 277 places, 509 transitions, 8130 flow [2024-06-21 18:23:04,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7995, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8130, PETRI_PLACES=277, PETRI_TRANSITIONS=509} [2024-06-21 18:23:04,615 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 234 predicate places. [2024-06-21 18:23:04,615 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 509 transitions, 8130 flow [2024-06-21 18:23:04,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-21 18:23:04,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:23:04,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:23:04,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-21 18:23:04,615 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:23:04,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:23:04,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1564389192, now seen corresponding path program 3 times [2024-06-21 18:23:04,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:23:04,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560259700] [2024-06-21 18:23:04,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:23:04,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:23:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:23:06,169 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-21 18:23:06,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:23:06,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560259700] [2024-06-21 18:23:06,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560259700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:23:06,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:23:06,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:23:06,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30184003] [2024-06-21 18:23:06,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:23:06,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:23:06,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:23:06,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:23:06,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:23:06,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:23:06,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 509 transitions, 8130 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-21 18:23:06,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:23:06,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:23:06,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:23:07,981 INFO L124 PetriNetUnfolderBase]: 4031/6125 cut-off events. [2024-06-21 18:23:07,981 INFO L125 PetriNetUnfolderBase]: For 585675/585686 co-relation queries the response was YES. [2024-06-21 18:23:08,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59902 conditions, 6125 events. 4031/6125 cut-off events. For 585675/585686 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 33268 event pairs, 1440 based on Foata normal form. 3/6109 useless extension candidates. Maximal degree in co-relation 59774. Up to 5770 conditions per place. [2024-06-21 18:23:08,069 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 488 selfloop transitions, 46 changer transitions 0/543 dead transitions. [2024-06-21 18:23:08,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 543 transitions, 9718 flow [2024-06-21 18:23:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:23:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:23:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-21 18:23:08,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-21 18:23:08,071 INFO L175 Difference]: Start difference. First operand has 277 places, 509 transitions, 8130 flow. Second operand 9 states and 162 transitions. [2024-06-21 18:23:08,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 543 transitions, 9718 flow [2024-06-21 18:23:09,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 543 transitions, 9601 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-21 18:23:09,247 INFO L231 Difference]: Finished difference. Result has 279 places, 515 transitions, 8237 flow [2024-06-21 18:23:09,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8013, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8237, PETRI_PLACES=279, PETRI_TRANSITIONS=515} [2024-06-21 18:23:09,248 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 236 predicate places. [2024-06-21 18:23:09,248 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 515 transitions, 8237 flow [2024-06-21 18:23:09,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-21 18:23:09,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:23:09,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:23:09,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-21 18:23:09,248 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:23:09,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:23:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1342989920, now seen corresponding path program 2 times [2024-06-21 18:23:09,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:23:09,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845038227] [2024-06-21 18:23:09,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:23:09,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:23:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:23:10,854 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-21 18:23:10,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:23:10,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845038227] [2024-06-21 18:23:10,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845038227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:23:10,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:23:10,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:23:10,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462554545] [2024-06-21 18:23:10,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:23:10,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:23:10,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:23:10,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:23:10,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:23:10,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:23:10,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 515 transitions, 8237 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-21 18:23:10,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:23:10,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:23:10,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:23:12,728 INFO L124 PetriNetUnfolderBase]: 4040/6138 cut-off events. [2024-06-21 18:23:12,728 INFO L125 PetriNetUnfolderBase]: For 599818/599829 co-relation queries the response was YES. [2024-06-21 18:23:12,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60204 conditions, 6138 events. 4040/6138 cut-off events. For 599818/599829 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 33349 event pairs, 1445 based on Foata normal form. 2/6121 useless extension candidates. Maximal degree in co-relation 60075. Up to 5842 conditions per place. [2024-06-21 18:23:12,795 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 511 selfloop transitions, 32 changer transitions 0/552 dead transitions. [2024-06-21 18:23:12,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 552 transitions, 9756 flow [2024-06-21 18:23:12,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:23:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:23:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-21 18:23:12,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42328042328042326 [2024-06-21 18:23:12,797 INFO L175 Difference]: Start difference. First operand has 279 places, 515 transitions, 8237 flow. Second operand 9 states and 160 transitions. [2024-06-21 18:23:12,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 552 transitions, 9756 flow [2024-06-21 18:23:13,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 552 transitions, 9544 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-21 18:23:13,748 INFO L231 Difference]: Finished difference. Result has 281 places, 525 transitions, 8346 flow [2024-06-21 18:23:13,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8036, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8346, PETRI_PLACES=281, PETRI_TRANSITIONS=525} [2024-06-21 18:23:13,749 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 238 predicate places. [2024-06-21 18:23:13,749 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 525 transitions, 8346 flow [2024-06-21 18:23:13,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-21 18:23:13,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:23:13,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:23:13,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-21 18:23:13,749 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:23:13,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:23:13,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1336310226, now seen corresponding path program 10 times [2024-06-21 18:23:13,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:23:13,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275727046] [2024-06-21 18:23:13,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:23:13,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:23:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:23:15,623 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-21 18:23:15,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:23:15,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275727046] [2024-06-21 18:23:15,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275727046] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:23:15,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:23:15,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:23:15,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936021845] [2024-06-21 18:23:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:23:15,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:23:15,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:23:15,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:23:15,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:23:15,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:23:15,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 525 transitions, 8346 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-21 18:23:15,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:23:15,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:23:15,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:23:17,472 INFO L124 PetriNetUnfolderBase]: 3790/5847 cut-off events. [2024-06-21 18:23:17,473 INFO L125 PetriNetUnfolderBase]: For 643418/643445 co-relation queries the response was YES. [2024-06-21 18:23:17,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60088 conditions, 5847 events. 3790/5847 cut-off events. For 643418/643445 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 32698 event pairs, 1247 based on Foata normal form. 20/5796 useless extension candidates. Maximal degree in co-relation 59958. Up to 5079 conditions per place. [2024-06-21 18:23:17,555 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 436 selfloop transitions, 108 changer transitions 0/567 dead transitions. [2024-06-21 18:23:17,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 567 transitions, 10373 flow [2024-06-21 18:23:17,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:23:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:23:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-21 18:23:17,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708994708994709 [2024-06-21 18:23:17,557 INFO L175 Difference]: Start difference. First operand has 281 places, 525 transitions, 8346 flow. Second operand 9 states and 178 transitions. [2024-06-21 18:23:17,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 567 transitions, 10373 flow [2024-06-21 18:23:18,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 567 transitions, 10265 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-21 18:23:18,849 INFO L231 Difference]: Finished difference. Result has 283 places, 531 transitions, 8652 flow [2024-06-21 18:23:18,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8238, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8652, PETRI_PLACES=283, PETRI_TRANSITIONS=531} [2024-06-21 18:23:18,849 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 240 predicate places. [2024-06-21 18:23:18,849 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 531 transitions, 8652 flow [2024-06-21 18:23:18,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-21 18:23:18,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:23:18,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:23:18,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-21 18:23:18,850 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:23:18,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:23:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash 989819492, now seen corresponding path program 11 times [2024-06-21 18:23:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:23:18,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102870498] [2024-06-21 18:23:18,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:23:18,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:23:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:23:20,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-21 18:23:20,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:23:20,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102870498] [2024-06-21 18:23:20,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102870498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:23:20,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:23:20,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:23:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869184603] [2024-06-21 18:23:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:23:20,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:23:20,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:23:20,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:23:20,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:23:21,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:23:21,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 531 transitions, 8652 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-21 18:23:21,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:23:21,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:23:21,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:23:22,807 INFO L124 PetriNetUnfolderBase]: 3817/5884 cut-off events. [2024-06-21 18:23:22,807 INFO L125 PetriNetUnfolderBase]: For 666489/666516 co-relation queries the response was YES. [2024-06-21 18:23:22,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61373 conditions, 5884 events. 3817/5884 cut-off events. For 666489/666516 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 32910 event pairs, 1247 based on Foata normal form. 18/5831 useless extension candidates. Maximal degree in co-relation 61243. Up to 5253 conditions per place. [2024-06-21 18:23:22,884 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 447 selfloop transitions, 94 changer transitions 0/564 dead transitions. [2024-06-21 18:23:22,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 564 transitions, 10274 flow [2024-06-21 18:23:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:23:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:23:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-21 18:23:22,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-21 18:23:22,886 INFO L175 Difference]: Start difference. First operand has 283 places, 531 transitions, 8652 flow. Second operand 10 states and 180 transitions. [2024-06-21 18:23:22,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 564 transitions, 10274 flow [2024-06-21 18:23:24,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 564 transitions, 9963 flow, removed 80 selfloop flow, removed 5 redundant places. [2024-06-21 18:23:24,149 INFO L231 Difference]: Finished difference. Result has 288 places, 534 transitions, 8642 flow [2024-06-21 18:23:24,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8367, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8642, PETRI_PLACES=288, PETRI_TRANSITIONS=534} [2024-06-21 18:23:24,150 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 245 predicate places. [2024-06-21 18:23:24,150 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 534 transitions, 8642 flow [2024-06-21 18:23:24,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-21 18:23:24,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:23:24,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:23:24,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-21 18:23:24,151 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:23:24,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:23:24,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1564389006, now seen corresponding path program 12 times [2024-06-21 18:23:24,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:23:24,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687573880] [2024-06-21 18:23:24,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:23:24,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:23:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:23:25,928 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-21 18:23:25,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:23:25,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687573880] [2024-06-21 18:23:25,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687573880] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:23:25,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:23:25,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:23:25,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098068803] [2024-06-21 18:23:25,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:23:25,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:23:25,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:23:25,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:23:25,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:23:26,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:23:26,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 534 transitions, 8642 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-21 18:23:26,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:23:26,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:23:26,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:23:27,714 INFO L124 PetriNetUnfolderBase]: 3810/5881 cut-off events. [2024-06-21 18:23:27,715 INFO L125 PetriNetUnfolderBase]: For 678933/678960 co-relation queries the response was YES. [2024-06-21 18:23:27,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61549 conditions, 5881 events. 3810/5881 cut-off events. For 678933/678960 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32965 event pairs, 1249 based on Foata normal form. 20/5830 useless extension candidates. Maximal degree in co-relation 61417. Up to 5268 conditions per place. [2024-06-21 18:23:27,804 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 482 selfloop transitions, 63 changer transitions 0/568 dead transitions. [2024-06-21 18:23:27,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 568 transitions, 10296 flow [2024-06-21 18:23:27,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:23:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:23:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-21 18:23:27,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-21 18:23:27,806 INFO L175 Difference]: Start difference. First operand has 288 places, 534 transitions, 8642 flow. Second operand 9 states and 171 transitions. [2024-06-21 18:23:27,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 568 transitions, 10296 flow [2024-06-21 18:23:29,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 568 transitions, 10057 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-21 18:23:29,150 INFO L231 Difference]: Finished difference. Result has 289 places, 537 transitions, 8615 flow [2024-06-21 18:23:29,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8403, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8615, PETRI_PLACES=289, PETRI_TRANSITIONS=537} [2024-06-21 18:23:29,150 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 246 predicate places. [2024-06-21 18:23:29,150 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 537 transitions, 8615 flow [2024-06-21 18:23:29,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-21 18:23:29,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:23:29,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:23:29,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-21 18:23:29,151 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:23:29,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:23:29,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1557771764, now seen corresponding path program 4 times [2024-06-21 18:23:29,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:23:29,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430884190] [2024-06-21 18:23:29,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:23:29,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:23:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:23:30,644 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-21 18:23:30,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:23:30,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430884190] [2024-06-21 18:23:30,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430884190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:23:30,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:23:30,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:23:30,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917144129] [2024-06-21 18:23:30,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:23:30,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:23:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:23:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:23:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:23:30,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:23:30,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 537 transitions, 8615 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-21 18:23:30,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:23:30,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:23:30,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:23:32,559 INFO L124 PetriNetUnfolderBase]: 4107/6235 cut-off events. [2024-06-21 18:23:32,559 INFO L125 PetriNetUnfolderBase]: For 674020/674031 co-relation queries the response was YES. [2024-06-21 18:23:32,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62741 conditions, 6235 events. 4107/6235 cut-off events. For 674020/674031 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 33939 event pairs, 1437 based on Foata normal form. 3/6219 useless extension candidates. Maximal degree in co-relation 62608. Up to 5872 conditions per place. [2024-06-21 18:23:32,640 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 506 selfloop transitions, 50 changer transitions 0/565 dead transitions. [2024-06-21 18:23:32,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 565 transitions, 9948 flow [2024-06-21 18:23:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:23:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:23:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-21 18:23:32,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-21 18:23:32,642 INFO L175 Difference]: Start difference. First operand has 289 places, 537 transitions, 8615 flow. Second operand 9 states and 161 transitions. [2024-06-21 18:23:32,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 565 transitions, 9948 flow [2024-06-21 18:23:34,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 565 transitions, 9706 flow, removed 48 selfloop flow, removed 7 redundant places. [2024-06-21 18:23:34,012 INFO L231 Difference]: Finished difference. Result has 291 places, 537 transitions, 8486 flow [2024-06-21 18:23:34,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8373, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8486, PETRI_PLACES=291, PETRI_TRANSITIONS=537} [2024-06-21 18:23:34,013 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 248 predicate places. [2024-06-21 18:23:34,013 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 537 transitions, 8486 flow [2024-06-21 18:23:34,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-21 18:23:34,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:23:34,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:23:34,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-21 18:23:34,013 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:23:34,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:23:34,014 INFO L85 PathProgramCache]: Analyzing trace with hash -846733412, now seen corresponding path program 3 times [2024-06-21 18:23:34,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:23:34,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94711622] [2024-06-21 18:23:34,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:23:34,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:23:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:23:35,372 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-21 18:23:35,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:23:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94711622] [2024-06-21 18:23:35,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94711622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:23:35,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:23:35,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:23:35,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878023531] [2024-06-21 18:23:35,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:23:35,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:23:35,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:23:35,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:23:35,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:23:35,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:23:35,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 537 transitions, 8486 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-21 18:23:35,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:23:35,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:23:35,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:23:37,030 INFO L124 PetriNetUnfolderBase]: 3858/5945 cut-off events. [2024-06-21 18:23:37,030 INFO L125 PetriNetUnfolderBase]: For 667106/667220 co-relation queries the response was YES. [2024-06-21 18:23:37,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59781 conditions, 5945 events. 3858/5945 cut-off events. For 667106/667220 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 33487 event pairs, 1437 based on Foata normal form. 46/5921 useless extension candidates. Maximal degree in co-relation 59647. Up to 5505 conditions per place. [2024-06-21 18:23:37,126 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 448 selfloop transitions, 13 changer transitions 0/545 dead transitions. [2024-06-21 18:23:37,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 545 transitions, 9454 flow [2024-06-21 18:23:37,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 18:23:37,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 18:23:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-21 18:23:37,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2024-06-21 18:23:37,127 INFO L175 Difference]: Start difference. First operand has 291 places, 537 transitions, 8486 flow. Second operand 6 states and 107 transitions. [2024-06-21 18:23:37,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 545 transitions, 9454 flow [2024-06-21 18:23:38,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 545 transitions, 9307 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-21 18:23:38,539 INFO L231 Difference]: Finished difference. Result has 290 places, 537 transitions, 8371 flow [2024-06-21 18:23:38,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8339, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8371, PETRI_PLACES=290, PETRI_TRANSITIONS=537} [2024-06-21 18:23:38,540 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 247 predicate places. [2024-06-21 18:23:38,540 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 537 transitions, 8371 flow [2024-06-21 18:23:38,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-21 18:23:38,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:23:38,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:23:38,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-21 18:23:38,540 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:23:38,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:23:38,540 INFO L85 PathProgramCache]: Analyzing trace with hash -853393700, now seen corresponding path program 1 times [2024-06-21 18:23:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:23:38,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294088395] [2024-06-21 18:23:38,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:23:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:23:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:23:40,331 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-21 18:23:40,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:23:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294088395] [2024-06-21 18:23:40,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294088395] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:23:40,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:23:40,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:23:40,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055766001] [2024-06-21 18:23:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:23:40,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:23:40,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:23:40,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:23:40,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:23:40,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-21 18:23:40,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 537 transitions, 8371 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-21 18:23:40,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:23:40,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-21 18:23:40,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:23:42,065 INFO L124 PetriNetUnfolderBase]: 4253/6384 cut-off events. [2024-06-21 18:23:42,065 INFO L125 PetriNetUnfolderBase]: For 674135/674135 co-relation queries the response was YES. [2024-06-21 18:23:42,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63149 conditions, 6384 events. 4253/6384 cut-off events. For 674135/674135 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 34071 event pairs, 1531 based on Foata normal form. 1/6384 useless extension candidates. Maximal degree in co-relation 63015. Up to 6263 conditions per place. [2024-06-21 18:23:42,156 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 534 selfloop transitions, 18 changer transitions 0/555 dead transitions. [2024-06-21 18:23:42,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 555 transitions, 9759 flow [2024-06-21 18:23:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 18:23:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 18:23:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-21 18:23:42,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4087301587301587 [2024-06-21 18:23:42,157 INFO L175 Difference]: Start difference. First operand has 290 places, 537 transitions, 8371 flow. Second operand 6 states and 103 transitions. [2024-06-21 18:23:42,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 555 transitions, 9759 flow [2024-06-21 18:23:43,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 555 transitions, 9705 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-21 18:23:43,767 INFO L231 Difference]: Finished difference. Result has 291 places, 543 transitions, 8447 flow [2024-06-21 18:23:43,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8317, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8447, PETRI_PLACES=291, PETRI_TRANSITIONS=543} [2024-06-21 18:23:43,768 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 248 predicate places. [2024-06-21 18:23:43,768 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 543 transitions, 8447 flow [2024-06-21 18:23:43,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-21 18:23:43,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:23:43,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:23:43,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-21 18:23:43,768 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:23:43,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:23:43,770 INFO L85 PathProgramCache]: Analyzing trace with hash -359356310, now seen corresponding path program 2 times [2024-06-21 18:23:43,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:23:43,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969033883] [2024-06-21 18:23:43,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:23:43,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:23:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:23:45,519 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-21 18:23:45,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:23:45,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969033883] [2024-06-21 18:23:45,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969033883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:23:45,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:23:45,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:23:45,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659098015] [2024-06-21 18:23:45,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:23:45,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:23:45,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:23:45,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:23:45,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:23:45,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-21 18:23:45,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 543 transitions, 8447 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-21 18:23:45,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:23:45,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-21 18:23:45,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:23:47,538 INFO L124 PetriNetUnfolderBase]: 4250/6381 cut-off events. [2024-06-21 18:23:47,538 INFO L125 PetriNetUnfolderBase]: For 690954/690957 co-relation queries the response was YES. [2024-06-21 18:23:47,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63678 conditions, 6381 events. 4250/6381 cut-off events. For 690954/690957 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 34062 event pairs, 1534 based on Foata normal form. 3/6382 useless extension candidates. Maximal degree in co-relation 63542. Up to 6260 conditions per place. [2024-06-21 18:23:47,635 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 530 selfloop transitions, 18 changer transitions 0/551 dead transitions. [2024-06-21 18:23:47,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 551 transitions, 9589 flow [2024-06-21 18:23:47,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 18:23:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 18:23:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-21 18:23:47,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2024-06-21 18:23:47,636 INFO L175 Difference]: Start difference. First operand has 291 places, 543 transitions, 8447 flow. Second operand 6 states and 99 transitions. [2024-06-21 18:23:47,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 551 transitions, 9589 flow [2024-06-21 18:23:49,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 551 transitions, 9540 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-06-21 18:23:49,521 INFO L231 Difference]: Finished difference. Result has 295 places, 543 transitions, 8442 flow [2024-06-21 18:23:49,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8398, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8442, PETRI_PLACES=295, PETRI_TRANSITIONS=543} [2024-06-21 18:23:49,522 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 252 predicate places. [2024-06-21 18:23:49,522 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 543 transitions, 8442 flow [2024-06-21 18:23:49,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-21 18:23:49,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:23:49,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:23:49,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-21 18:23:49,522 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:23:49,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:23:49,522 INFO L85 PathProgramCache]: Analyzing trace with hash -572033420, now seen corresponding path program 3 times [2024-06-21 18:23:49,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:23:49,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900733302] [2024-06-21 18:23:49,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:23:49,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:23:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:23:51,810 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-21 18:23:51,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:23:51,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900733302] [2024-06-21 18:23:51,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900733302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:23:51,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:23:51,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:23:51,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45684606] [2024-06-21 18:23:51,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:23:51,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:23:51,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:23:51,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:23:51,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:23:51,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:23:51,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 543 transitions, 8442 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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-21 18:23:51,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:23:51,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:23:51,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:23:54,045 INFO L124 PetriNetUnfolderBase]: 3821/5877 cut-off events. [2024-06-21 18:23:54,045 INFO L125 PetriNetUnfolderBase]: For 765606/765647 co-relation queries the response was YES. [2024-06-21 18:23:54,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62059 conditions, 5877 events. 3821/5877 cut-off events. For 765606/765647 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 32688 event pairs, 909 based on Foata normal form. 21/5831 useless extension candidates. Maximal degree in co-relation 61919. Up to 4834 conditions per place. [2024-06-21 18:23:54,133 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 394 selfloop transitions, 168 changer transitions 0/587 dead transitions. [2024-06-21 18:23:54,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 587 transitions, 10214 flow [2024-06-21 18:23:54,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-21 18:23:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-21 18:23:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 233 transitions. [2024-06-21 18:23:54,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4623015873015873 [2024-06-21 18:23:54,135 INFO L175 Difference]: Start difference. First operand has 295 places, 543 transitions, 8442 flow. Second operand 12 states and 233 transitions. [2024-06-21 18:23:54,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 587 transitions, 10214 flow [2024-06-21 18:23:55,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 587 transitions, 10150 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-21 18:23:55,892 INFO L231 Difference]: Finished difference. Result has 304 places, 543 transitions, 8722 flow [2024-06-21 18:23:55,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8378, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8722, PETRI_PLACES=304, PETRI_TRANSITIONS=543} [2024-06-21 18:23:55,893 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 261 predicate places. [2024-06-21 18:23:55,893 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 543 transitions, 8722 flow [2024-06-21 18:23:55,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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-21 18:23:55,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:23:55,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:23:55,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-21 18:23:55,893 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:23:55,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:23:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1861841558, now seen corresponding path program 4 times [2024-06-21 18:23:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:23:55,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321531274] [2024-06-21 18:23:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:23:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:23:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:23:58,899 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-21 18:23:58,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:23:58,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321531274] [2024-06-21 18:23:58,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321531274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:23:58,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:23:58,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:23:58,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665625385] [2024-06-21 18:23:58,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:23:58,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:23:58,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:23:58,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:23:58,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:23:59,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:23:59,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 543 transitions, 8722 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:23:59,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:23:59,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:23:59,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:24:00,953 INFO L124 PetriNetUnfolderBase]: 3882/5980 cut-off events. [2024-06-21 18:24:00,953 INFO L125 PetriNetUnfolderBase]: For 824695/824738 co-relation queries the response was YES. [2024-06-21 18:24:01,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63913 conditions, 5980 events. 3882/5980 cut-off events. For 824695/824738 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 33456 event pairs, 928 based on Foata normal form. 37/5944 useless extension candidates. Maximal degree in co-relation 63771. Up to 4781 conditions per place. [2024-06-21 18:24:01,037 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 408 selfloop transitions, 164 changer transitions 0/597 dead transitions. [2024-06-21 18:24:01,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 597 transitions, 10646 flow [2024-06-21 18:24:01,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 18:24:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 18:24:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 229 transitions. [2024-06-21 18:24:01,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49567099567099565 [2024-06-21 18:24:01,039 INFO L175 Difference]: Start difference. First operand has 304 places, 543 transitions, 8722 flow. Second operand 11 states and 229 transitions. [2024-06-21 18:24:01,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 597 transitions, 10646 flow [2024-06-21 18:24:02,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 597 transitions, 10304 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-21 18:24:02,849 INFO L231 Difference]: Finished difference. Result has 305 places, 544 transitions, 8782 flow [2024-06-21 18:24:02,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8388, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8782, PETRI_PLACES=305, PETRI_TRANSITIONS=544} [2024-06-21 18:24:02,850 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 262 predicate places. [2024-06-21 18:24:02,850 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 544 transitions, 8782 flow [2024-06-21 18:24:02,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:24:02,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:24:02,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:24:02,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-21 18:24:02,851 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:24:02,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:24:02,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1861969898, now seen corresponding path program 5 times [2024-06-21 18:24:02,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:24:02,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609413999] [2024-06-21 18:24:02,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:24:02,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:24:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:24:05,703 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-21 18:24:05,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:24:05,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609413999] [2024-06-21 18:24:05,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609413999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:24:05,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:24:05,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:24:05,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042559787] [2024-06-21 18:24:05,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:24:05,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:24:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:24:05,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:24:05,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:24:05,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:24:05,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 544 transitions, 8782 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:24:05,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:24:05,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:24:05,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:24:07,911 INFO L124 PetriNetUnfolderBase]: 3951/6097 cut-off events. [2024-06-21 18:24:07,911 INFO L125 PetriNetUnfolderBase]: For 852329/852370 co-relation queries the response was YES. [2024-06-21 18:24:07,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65518 conditions, 6097 events. 3951/6097 cut-off events. For 852329/852370 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 34413 event pairs, 895 based on Foata normal form. 37/6061 useless extension candidates. Maximal degree in co-relation 65375. Up to 4706 conditions per place. [2024-06-21 18:24:07,988 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 412 selfloop transitions, 166 changer transitions 0/603 dead transitions. [2024-06-21 18:24:07,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 603 transitions, 10773 flow [2024-06-21 18:24:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 18:24:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 18:24:07,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 233 transitions. [2024-06-21 18:24:07,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043290043290043 [2024-06-21 18:24:07,989 INFO L175 Difference]: Start difference. First operand has 305 places, 544 transitions, 8782 flow. Second operand 11 states and 233 transitions. [2024-06-21 18:24:07,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 603 transitions, 10773 flow [2024-06-21 18:24:09,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 603 transitions, 10431 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-21 18:24:09,807 INFO L231 Difference]: Finished difference. Result has 306 places, 545 transitions, 8837 flow [2024-06-21 18:24:09,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8444, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8837, PETRI_PLACES=306, PETRI_TRANSITIONS=545} [2024-06-21 18:24:09,808 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 263 predicate places. [2024-06-21 18:24:09,808 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 545 transitions, 8837 flow [2024-06-21 18:24:09,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:24:09,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:24:09,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:24:09,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-21 18:24:09,808 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:24:09,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:24:09,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1070199810, now seen corresponding path program 6 times [2024-06-21 18:24:09,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:24:09,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406272580] [2024-06-21 18:24:09,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:24:09,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:24:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:24:12,311 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-21 18:24:12,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:24:12,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406272580] [2024-06-21 18:24:12,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406272580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:24:12,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:24:12,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:24:12,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819027476] [2024-06-21 18:24:12,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:24:12,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:24:12,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:24:12,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:24:12,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:24:12,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:24:12,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 545 transitions, 8837 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-21 18:24:12,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:24:12,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:24:12,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:24:14,628 INFO L124 PetriNetUnfolderBase]: 4097/6344 cut-off events. [2024-06-21 18:24:14,628 INFO L125 PetriNetUnfolderBase]: For 859770/859797 co-relation queries the response was YES. [2024-06-21 18:24:14,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67729 conditions, 6344 events. 4097/6344 cut-off events. For 859770/859797 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 36227 event pairs, 1098 based on Foata normal form. 33/6303 useless extension candidates. Maximal degree in co-relation 67586. Up to 5456 conditions per place. [2024-06-21 18:24:14,720 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 478 selfloop transitions, 108 changer transitions 0/611 dead transitions. [2024-06-21 18:24:14,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 611 transitions, 11293 flow [2024-06-21 18:24:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-21 18:24:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-21 18:24:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 251 transitions. [2024-06-21 18:24:14,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4597069597069597 [2024-06-21 18:24:14,721 INFO L175 Difference]: Start difference. First operand has 306 places, 545 transitions, 8837 flow. Second operand 13 states and 251 transitions. [2024-06-21 18:24:14,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 611 transitions, 11293 flow [2024-06-21 18:24:16,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 611 transitions, 10924 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-21 18:24:16,722 INFO L231 Difference]: Finished difference. Result has 311 places, 555 transitions, 8968 flow [2024-06-21 18:24:16,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8486, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8968, PETRI_PLACES=311, PETRI_TRANSITIONS=555} [2024-06-21 18:24:16,722 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 268 predicate places. [2024-06-21 18:24:16,723 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 555 transitions, 8968 flow [2024-06-21 18:24:16,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-21 18:24:16,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:24:16,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:24:16,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-21 18:24:16,723 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:24:16,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:24:16,723 INFO L85 PathProgramCache]: Analyzing trace with hash 825191632, now seen corresponding path program 7 times [2024-06-21 18:24:16,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:24:16,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289724240] [2024-06-21 18:24:16,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:24:16,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:24:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:24:19,499 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-21 18:24:19,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:24:19,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289724240] [2024-06-21 18:24:19,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289724240] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:24:19,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:24:19,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:24:19,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801790514] [2024-06-21 18:24:19,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:24:19,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:24:19,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:24:19,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:24:19,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:24:19,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:24:19,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 555 transitions, 8968 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:24:19,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:24:19,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:24:19,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:24:21,825 INFO L124 PetriNetUnfolderBase]: 4150/6434 cut-off events. [2024-06-21 18:24:21,825 INFO L125 PetriNetUnfolderBase]: For 884133/884162 co-relation queries the response was YES. [2024-06-21 18:24:21,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68499 conditions, 6434 events. 4150/6434 cut-off events. For 884133/884162 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 36947 event pairs, 1132 based on Foata normal form. 29/6382 useless extension candidates. Maximal degree in co-relation 68354. Up to 5383 conditions per place. [2024-06-21 18:24:21,919 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 450 selfloop transitions, 128 changer transitions 0/603 dead transitions. [2024-06-21 18:24:21,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 603 transitions, 10842 flow [2024-06-21 18:24:21,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:24:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:24:21,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 207 transitions. [2024-06-21 18:24:21,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2024-06-21 18:24:21,920 INFO L175 Difference]: Start difference. First operand has 311 places, 555 transitions, 8968 flow. Second operand 10 states and 207 transitions. [2024-06-21 18:24:21,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 603 transitions, 10842 flow [2024-06-21 18:24:24,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 603 transitions, 10634 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-21 18:24:24,249 INFO L231 Difference]: Finished difference. Result has 313 places, 556 transitions, 9085 flow [2024-06-21 18:24:24,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8760, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9085, PETRI_PLACES=313, PETRI_TRANSITIONS=556} [2024-06-21 18:24:24,249 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 270 predicate places. [2024-06-21 18:24:24,249 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 556 transitions, 9085 flow [2024-06-21 18:24:24,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:24:24,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:24:24,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:24:24,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-21 18:24:24,250 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:24:24,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:24:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1074796800, now seen corresponding path program 8 times [2024-06-21 18:24:24,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:24:24,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862981145] [2024-06-21 18:24:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:24:24,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:24:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:24:26,934 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-21 18:24:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:24:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862981145] [2024-06-21 18:24:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862981145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:24:26,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:24:26,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:24:26,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120107726] [2024-06-21 18:24:26,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:24:26,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:24:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:24:26,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:24:26,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:24:27,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:24:27,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 556 transitions, 9085 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:24:27,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:24:27,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:24:27,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:24:29,276 INFO L124 PetriNetUnfolderBase]: 4217/6556 cut-off events. [2024-06-21 18:24:29,277 INFO L125 PetriNetUnfolderBase]: For 897438/897465 co-relation queries the response was YES. [2024-06-21 18:24:29,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69750 conditions, 6556 events. 4217/6556 cut-off events. For 897438/897465 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 37876 event pairs, 1053 based on Foata normal form. 29/6518 useless extension candidates. Maximal degree in co-relation 69604. Up to 4976 conditions per place. [2024-06-21 18:24:29,361 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 451 selfloop transitions, 133 changer transitions 0/609 dead transitions. [2024-06-21 18:24:29,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 609 transitions, 11270 flow [2024-06-21 18:24:29,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:24:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:24:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 211 transitions. [2024-06-21 18:24:29,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023809523809524 [2024-06-21 18:24:29,363 INFO L175 Difference]: Start difference. First operand has 313 places, 556 transitions, 9085 flow. Second operand 10 states and 211 transitions. [2024-06-21 18:24:29,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 609 transitions, 11270 flow [2024-06-21 18:24:31,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 609 transitions, 11001 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-21 18:24:31,207 INFO L231 Difference]: Finished difference. Result has 315 places, 557 transitions, 9145 flow [2024-06-21 18:24:31,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8816, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9145, PETRI_PLACES=315, PETRI_TRANSITIONS=557} [2024-06-21 18:24:31,208 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 272 predicate places. [2024-06-21 18:24:31,208 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 557 transitions, 9145 flow [2024-06-21 18:24:31,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:24:31,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:24:31,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:24:31,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-21 18:24:31,208 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:24:31,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:24:31,209 INFO L85 PathProgramCache]: Analyzing trace with hash 457124974, now seen corresponding path program 1 times [2024-06-21 18:24:31,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:24:31,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574253594] [2024-06-21 18:24:31,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:24:31,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:24:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:24:33,707 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-21 18:24:33,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:24:33,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574253594] [2024-06-21 18:24:33,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574253594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:24:33,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:24:33,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:24:33,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396653083] [2024-06-21 18:24:33,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:24:33,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:24:33,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:24:33,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:24:33,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:24:33,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:24:33,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 557 transitions, 9145 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:24:33,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:24:33,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:24:33,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:24:36,140 INFO L124 PetriNetUnfolderBase]: 4573/6995 cut-off events. [2024-06-21 18:24:36,141 INFO L125 PetriNetUnfolderBase]: For 876644/876664 co-relation queries the response was YES. [2024-06-21 18:24:36,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71909 conditions, 6995 events. 4573/6995 cut-off events. For 876644/876664 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 39571 event pairs, 1385 based on Foata normal form. 5/6964 useless extension candidates. Maximal degree in co-relation 71762. Up to 6503 conditions per place. [2024-06-21 18:24:36,252 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 491 selfloop transitions, 107 changer transitions 0/609 dead transitions. [2024-06-21 18:24:36,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 609 transitions, 11166 flow [2024-06-21 18:24:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-21 18:24:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-21 18:24:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 219 transitions. [2024-06-21 18:24:36,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2024-06-21 18:24:36,254 INFO L175 Difference]: Start difference. First operand has 315 places, 557 transitions, 9145 flow. Second operand 12 states and 219 transitions. [2024-06-21 18:24:36,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 609 transitions, 11166 flow [2024-06-21 18:24:38,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 609 transitions, 10787 flow, removed 39 selfloop flow, removed 8 redundant places. [2024-06-21 18:24:38,371 INFO L231 Difference]: Finished difference. Result has 320 places, 563 transitions, 9132 flow [2024-06-21 18:24:38,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8774, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9132, PETRI_PLACES=320, PETRI_TRANSITIONS=563} [2024-06-21 18:24:38,371 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 277 predicate places. [2024-06-21 18:24:38,371 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 563 transitions, 9132 flow [2024-06-21 18:24:38,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:24:38,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:24:38,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:24:38,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-21 18:24:38,372 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:24:38,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:24:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1501536936, now seen corresponding path program 9 times [2024-06-21 18:24:38,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:24:38,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251856804] [2024-06-21 18:24:38,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:24:38,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:24:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:24:41,427 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-21 18:24:41,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:24:41,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251856804] [2024-06-21 18:24:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251856804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:24:41,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:24:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:24:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613273035] [2024-06-21 18:24:41,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:24:41,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:24:41,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:24:41,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:24:41,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:24:41,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:24:41,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 563 transitions, 9132 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:24:41,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:24:41,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:24:41,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:24:43,575 INFO L124 PetriNetUnfolderBase]: 4134/6425 cut-off events. [2024-06-21 18:24:43,576 INFO L125 PetriNetUnfolderBase]: For 882856/882883 co-relation queries the response was YES. [2024-06-21 18:24:43,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66431 conditions, 6425 events. 4134/6425 cut-off events. For 882856/882883 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 36995 event pairs, 1117 based on Foata normal form. 37/6389 useless extension candidates. Maximal degree in co-relation 66282. Up to 5326 conditions per place. [2024-06-21 18:24:43,676 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 459 selfloop transitions, 119 changer transitions 0/605 dead transitions. [2024-06-21 18:24:43,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 605 transitions, 10663 flow [2024-06-21 18:24:43,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:24:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:24:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 204 transitions. [2024-06-21 18:24:43,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-21 18:24:43,678 INFO L175 Difference]: Start difference. First operand has 320 places, 563 transitions, 9132 flow. Second operand 10 states and 204 transitions. [2024-06-21 18:24:43,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 605 transitions, 10663 flow [2024-06-21 18:24:45,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 605 transitions, 10376 flow, removed 52 selfloop flow, removed 9 redundant places. [2024-06-21 18:24:45,971 INFO L231 Difference]: Finished difference. Result has 322 places, 563 transitions, 9154 flow [2024-06-21 18:24:45,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8845, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9154, PETRI_PLACES=322, PETRI_TRANSITIONS=563} [2024-06-21 18:24:45,971 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 279 predicate places. [2024-06-21 18:24:45,971 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 563 transitions, 9154 flow [2024-06-21 18:24:45,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:24:45,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:24:45,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:24:45,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-21 18:24:45,972 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:24:45,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:24:45,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1835048269, now seen corresponding path program 1 times [2024-06-21 18:24:45,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:24:45,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005555131] [2024-06-21 18:24:45,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:24:45,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:24:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:24:48,258 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-21 18:24:48,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:24:48,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005555131] [2024-06-21 18:24:48,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005555131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:24:48,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:24:48,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:24:48,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195322696] [2024-06-21 18:24:48,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:24:48,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:24:48,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:24:48,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:24:48,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:24:48,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:24:48,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 563 transitions, 9154 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-21 18:24:48,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:24:48,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:24:48,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:24:50,726 INFO L124 PetriNetUnfolderBase]: 4527/6908 cut-off events. [2024-06-21 18:24:50,726 INFO L125 PetriNetUnfolderBase]: For 858679/858698 co-relation queries the response was YES. [2024-06-21 18:24:50,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69783 conditions, 6908 events. 4527/6908 cut-off events. For 858679/858698 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 38728 event pairs, 1441 based on Foata normal form. 6/6882 useless extension candidates. Maximal degree in co-relation 69632. Up to 6386 conditions per place. [2024-06-21 18:24:50,815 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 484 selfloop transitions, 106 changer transitions 0/601 dead transitions. [2024-06-21 18:24:50,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 601 transitions, 10668 flow [2024-06-21 18:24:50,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:24:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:24:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-21 18:24:50,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-21 18:24:50,817 INFO L175 Difference]: Start difference. First operand has 322 places, 563 transitions, 9154 flow. Second operand 10 states and 188 transitions. [2024-06-21 18:24:50,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 601 transitions, 10668 flow [2024-06-21 18:24:52,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 601 transitions, 10300 flow, removed 10 selfloop flow, removed 12 redundant places. [2024-06-21 18:24:52,842 INFO L231 Difference]: Finished difference. Result has 320 places, 565 transitions, 9078 flow [2024-06-21 18:24:52,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8786, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9078, PETRI_PLACES=320, PETRI_TRANSITIONS=565} [2024-06-21 18:24:52,842 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 277 predicate places. [2024-06-21 18:24:52,843 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 565 transitions, 9078 flow [2024-06-21 18:24:52,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-21 18:24:52,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:24:52,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:24:52,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-21 18:24:52,843 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:24:52,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:24:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1835263750, now seen corresponding path program 10 times [2024-06-21 18:24:52,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:24:52,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104525326] [2024-06-21 18:24:52,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:24:52,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:24:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:24:55,873 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-21 18:24:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:24:55,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104525326] [2024-06-21 18:24:55,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104525326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:24:55,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:24:55,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:24:55,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690545288] [2024-06-21 18:24:55,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:24:55,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:24:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:24:55,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:24:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:24:56,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:24:56,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 565 transitions, 9078 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:24:56,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:24:56,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:24:56,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:24:58,323 INFO L124 PetriNetUnfolderBase]: 4253/6615 cut-off events. [2024-06-21 18:24:58,323 INFO L125 PetriNetUnfolderBase]: For 853166/853199 co-relation queries the response was YES. [2024-06-21 18:24:58,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68019 conditions, 6615 events. 4253/6615 cut-off events. For 853166/853199 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 38315 event pairs, 1002 based on Foata normal form. 39/6591 useless extension candidates. Maximal degree in co-relation 67868. Up to 5253 conditions per place. [2024-06-21 18:24:58,405 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 346 selfloop transitions, 242 changer transitions 0/615 dead transitions. [2024-06-21 18:24:58,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 615 transitions, 11062 flow [2024-06-21 18:24:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:24:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:24:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 210 transitions. [2024-06-21 18:24:58,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-21 18:24:58,407 INFO L175 Difference]: Start difference. First operand has 320 places, 565 transitions, 9078 flow. Second operand 10 states and 210 transitions. [2024-06-21 18:24:58,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 615 transitions, 11062 flow [2024-06-21 18:25:00,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 615 transitions, 10784 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-21 18:25:00,258 INFO L231 Difference]: Finished difference. Result has 322 places, 566 transitions, 9357 flow [2024-06-21 18:25:00,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8806, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9357, PETRI_PLACES=322, PETRI_TRANSITIONS=566} [2024-06-21 18:25:00,258 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 279 predicate places. [2024-06-21 18:25:00,258 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 566 transitions, 9357 flow [2024-06-21 18:25:00,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:25:00,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:25:00,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:25:00,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-21 18:25:00,259 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:25:00,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:25:00,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1840626130, now seen corresponding path program 11 times [2024-06-21 18:25:00,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:25:00,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244482624] [2024-06-21 18:25:00,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:25:00,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:25:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:25:03,324 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-21 18:25:03,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:25:03,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244482624] [2024-06-21 18:25:03,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244482624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:25:03,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:25:03,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:25:03,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223872113] [2024-06-21 18:25:03,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:25:03,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:25:03,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:25:03,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:25:03,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:25:03,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:25:03,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 566 transitions, 9357 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:25:03,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:25:03,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:25:03,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:25:05,646 INFO L124 PetriNetUnfolderBase]: 4327/6749 cut-off events. [2024-06-21 18:25:05,646 INFO L125 PetriNetUnfolderBase]: For 890260/890293 co-relation queries the response was YES. [2024-06-21 18:25:05,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70162 conditions, 6749 events. 4327/6749 cut-off events. For 890260/890293 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 39495 event pairs, 1022 based on Foata normal form. 39/6725 useless extension candidates. Maximal degree in co-relation 70010. Up to 5378 conditions per place. [2024-06-21 18:25:05,910 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 355 selfloop transitions, 234 changer transitions 0/616 dead transitions. [2024-06-21 18:25:05,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 616 transitions, 11343 flow [2024-06-21 18:25:05,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:25:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:25:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 212 transitions. [2024-06-21 18:25:05,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-06-21 18:25:05,912 INFO L175 Difference]: Start difference. First operand has 322 places, 566 transitions, 9357 flow. Second operand 10 states and 212 transitions. [2024-06-21 18:25:05,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 616 transitions, 11343 flow [2024-06-21 18:25:07,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 616 transitions, 10924 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-21 18:25:07,908 INFO L231 Difference]: Finished difference. Result has 325 places, 567 transitions, 9475 flow [2024-06-21 18:25:07,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8938, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9475, PETRI_PLACES=325, PETRI_TRANSITIONS=567} [2024-06-21 18:25:07,909 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 282 predicate places. [2024-06-21 18:25:07,909 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 567 transitions, 9475 flow [2024-06-21 18:25:07,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:25:07,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:25:07,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:25:07,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-21 18:25:07,910 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:25:07,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:25:07,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1840774000, now seen corresponding path program 12 times [2024-06-21 18:25:07,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:25:07,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220920389] [2024-06-21 18:25:07,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:25:07,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:25:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:25:11,346 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-21 18:25:11,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:25:11,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220920389] [2024-06-21 18:25:11,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220920389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:25:11,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:25:11,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:25:11,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973703560] [2024-06-21 18:25:11,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:25:11,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:25:11,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:25:11,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:25:11,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:25:11,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:25:11,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 567 transitions, 9475 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:25:11,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:25:11,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:25:11,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:25:13,679 INFO L124 PetriNetUnfolderBase]: 4499/7031 cut-off events. [2024-06-21 18:25:13,679 INFO L125 PetriNetUnfolderBase]: For 972486/972520 co-relation queries the response was YES. [2024-06-21 18:25:13,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74831 conditions, 7031 events. 4499/7031 cut-off events. For 972486/972520 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 41679 event pairs, 1050 based on Foata normal form. 35/6989 useless extension candidates. Maximal degree in co-relation 74678. Up to 5150 conditions per place. [2024-06-21 18:25:13,779 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 351 selfloop transitions, 243 changer transitions 0/621 dead transitions. [2024-06-21 18:25:13,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 621 transitions, 11803 flow [2024-06-21 18:25:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:25:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:25:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions. [2024-06-21 18:25:13,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-06-21 18:25:13,780 INFO L175 Difference]: Start difference. First operand has 325 places, 567 transitions, 9475 flow. Second operand 10 states and 217 transitions. [2024-06-21 18:25:13,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 621 transitions, 11803 flow [2024-06-21 18:25:16,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 621 transitions, 11312 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-21 18:25:16,468 INFO L231 Difference]: Finished difference. Result has 327 places, 569 transitions, 9602 flow [2024-06-21 18:25:16,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8984, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9602, PETRI_PLACES=327, PETRI_TRANSITIONS=569} [2024-06-21 18:25:16,468 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 284 predicate places. [2024-06-21 18:25:16,468 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 569 transitions, 9602 flow [2024-06-21 18:25:16,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:25:16,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:25:16,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:25:16,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-21 18:25:16,469 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:25:16,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:25:16,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1840770280, now seen corresponding path program 13 times [2024-06-21 18:25:16,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:25:16,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528530996] [2024-06-21 18:25:16,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:25:16,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:25:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:25:19,371 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-21 18:25:19,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:25:19,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528530996] [2024-06-21 18:25:19,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528530996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:25:19,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:25:19,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:25:19,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950456650] [2024-06-21 18:25:19,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:25:19,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:25:19,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:25:19,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:25:19,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:25:19,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-21 18:25:19,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 569 transitions, 9602 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:25:19,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:25:19,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-21 18:25:19,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:25:21,759 INFO L124 PetriNetUnfolderBase]: 4457/6970 cut-off events. [2024-06-21 18:25:21,760 INFO L125 PetriNetUnfolderBase]: For 944832/944866 co-relation queries the response was YES. [2024-06-21 18:25:21,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72894 conditions, 6970 events. 4457/6970 cut-off events. For 944832/944866 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 41340 event pairs, 1064 based on Foata normal form. 35/6929 useless extension candidates. Maximal degree in co-relation 72740. Up to 5498 conditions per place. [2024-06-21 18:25:21,857 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 343 selfloop transitions, 246 changer transitions 0/616 dead transitions. [2024-06-21 18:25:21,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 616 transitions, 11510 flow [2024-06-21 18:25:21,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:25:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:25:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-06-21 18:25:21,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2024-06-21 18:25:21,859 INFO L175 Difference]: Start difference. First operand has 327 places, 569 transitions, 9602 flow. Second operand 10 states and 214 transitions. [2024-06-21 18:25:21,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 616 transitions, 11510 flow [2024-06-21 18:25:24,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 616 transitions, 11166 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-21 18:25:24,247 INFO L231 Difference]: Finished difference. Result has 331 places, 569 transitions, 9757 flow [2024-06-21 18:25:24,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9258, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9757, PETRI_PLACES=331, PETRI_TRANSITIONS=569} [2024-06-21 18:25:24,248 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 288 predicate places. [2024-06-21 18:25:24,248 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 569 transitions, 9757 flow [2024-06-21 18:25:24,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-21 18:25:24,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:25:24,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:25:24,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-21 18:25:24,248 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:25:24,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:25:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1550580303, now seen corresponding path program 2 times [2024-06-21 18:25:24,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:25:24,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711703452] [2024-06-21 18:25:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:25:24,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:25:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:25:26,228 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-21 18:25:26,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:25:26,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711703452] [2024-06-21 18:25:26,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711703452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:25:26,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:25:26,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:25:26,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049078834] [2024-06-21 18:25:26,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:25:26,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:25:26,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:25:26,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:25:26,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:25:26,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:25:26,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 569 transitions, 9757 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-21 18:25:26,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:25:26,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:25:26,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:25:28,425 INFO L124 PetriNetUnfolderBase]: 4604/7191 cut-off events. [2024-06-21 18:25:28,426 INFO L125 PetriNetUnfolderBase]: For 859409/859456 co-relation queries the response was YES. [2024-06-21 18:25:28,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72757 conditions, 7191 events. 4604/7191 cut-off events. For 859409/859456 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 42645 event pairs, 1241 based on Foata normal form. 33/7179 useless extension candidates. Maximal degree in co-relation 72601. Up to 6617 conditions per place. [2024-06-21 18:25:28,545 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 448 selfloop transitions, 59 changer transitions 0/594 dead transitions. [2024-06-21 18:25:28,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 594 transitions, 11074 flow [2024-06-21 18:25:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:25:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:25:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-21 18:25:28,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-21 18:25:28,546 INFO L175 Difference]: Start difference. First operand has 331 places, 569 transitions, 9757 flow. Second operand 8 states and 149 transitions. [2024-06-21 18:25:28,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 594 transitions, 11074 flow [2024-06-21 18:25:31,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 594 transitions, 10567 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-21 18:25:31,499 INFO L231 Difference]: Finished difference. Result has 330 places, 575 transitions, 9441 flow [2024-06-21 18:25:31,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9250, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9441, PETRI_PLACES=330, PETRI_TRANSITIONS=575} [2024-06-21 18:25:31,499 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 287 predicate places. [2024-06-21 18:25:31,499 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 575 transitions, 9441 flow [2024-06-21 18:25:31,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-21 18:25:31,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:25:31,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:25:31,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-21 18:25:31,500 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:25:31,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:25:31,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2080060875, now seen corresponding path program 2 times [2024-06-21 18:25:31,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:25:31,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767549571] [2024-06-21 18:25:31,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:25:31,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:25:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:25:33,720 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-21 18:25:33,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:25:33,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767549571] [2024-06-21 18:25:33,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767549571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:25:33,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:25:33,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:25:33,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40578936] [2024-06-21 18:25:33,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:25:33,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:25:33,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:25:33,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:25:33,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:25:33,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:25:33,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 575 transitions, 9441 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:25:33,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:25:33,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:25:33,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:25:36,097 INFO L124 PetriNetUnfolderBase]: 4905/7557 cut-off events. [2024-06-21 18:25:36,097 INFO L125 PetriNetUnfolderBase]: For 917636/917654 co-relation queries the response was YES. [2024-06-21 18:25:36,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75786 conditions, 7557 events. 4905/7557 cut-off events. For 917636/917654 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 44026 event pairs, 1976 based on Foata normal form. 4/7524 useless extension candidates. Maximal degree in co-relation 75629. Up to 7084 conditions per place. [2024-06-21 18:25:36,206 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 509 selfloop transitions, 91 changer transitions 0/611 dead transitions. [2024-06-21 18:25:36,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 611 transitions, 10911 flow [2024-06-21 18:25:36,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:25:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:25:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-21 18:25:36,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-21 18:25:36,208 INFO L175 Difference]: Start difference. First operand has 330 places, 575 transitions, 9441 flow. Second operand 10 states and 180 transitions. [2024-06-21 18:25:36,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 611 transitions, 10911 flow [2024-06-21 18:25:38,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 611 transitions, 10798 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-21 18:25:38,794 INFO L231 Difference]: Finished difference. Result has 337 places, 580 transitions, 9634 flow [2024-06-21 18:25:38,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9328, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9634, PETRI_PLACES=337, PETRI_TRANSITIONS=580} [2024-06-21 18:25:38,795 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 294 predicate places. [2024-06-21 18:25:38,795 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 580 transitions, 9634 flow [2024-06-21 18:25:38,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:25:38,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:25:38,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:25:38,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-21 18:25:38,795 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:25:38,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:25:38,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1686110377, now seen corresponding path program 3 times [2024-06-21 18:25:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:25:38,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412305008] [2024-06-21 18:25:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:25:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:25:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:25:40,550 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-21 18:25:40,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:25:40,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412305008] [2024-06-21 18:25:40,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412305008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:25:40,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:25:40,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:25:40,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218064657] [2024-06-21 18:25:40,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:25:40,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:25:40,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:25:40,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:25:40,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:25:40,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:25:40,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 580 transitions, 9634 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:25:40,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:25:40,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:25:40,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:25:43,107 INFO L124 PetriNetUnfolderBase]: 4922/7576 cut-off events. [2024-06-21 18:25:43,107 INFO L125 PetriNetUnfolderBase]: For 943203/943220 co-relation queries the response was YES. [2024-06-21 18:25:43,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76706 conditions, 7576 events. 4922/7576 cut-off events. For 943203/943220 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 43965 event pairs, 2016 based on Foata normal form. 4/7546 useless extension candidates. Maximal degree in co-relation 76546. Up to 7263 conditions per place. [2024-06-21 18:25:43,238 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 578 selfloop transitions, 24 changer transitions 0/613 dead transitions. [2024-06-21 18:25:43,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 613 transitions, 11154 flow [2024-06-21 18:25:43,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 18:25:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 18:25:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2024-06-21 18:25:43,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3961038961038961 [2024-06-21 18:25:43,239 INFO L175 Difference]: Start difference. First operand has 337 places, 580 transitions, 9634 flow. Second operand 11 states and 183 transitions. [2024-06-21 18:25:43,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 613 transitions, 11154 flow [2024-06-21 18:25:46,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 613 transitions, 10780 flow, removed 50 selfloop flow, removed 9 redundant places. [2024-06-21 18:25:46,091 INFO L231 Difference]: Finished difference. Result has 339 places, 582 transitions, 9401 flow [2024-06-21 18:25:46,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9260, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9401, PETRI_PLACES=339, PETRI_TRANSITIONS=582} [2024-06-21 18:25:46,091 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 296 predicate places. [2024-06-21 18:25:46,092 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 582 transitions, 9401 flow [2024-06-21 18:25:46,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:25:46,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:25:46,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:25:46,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-21 18:25:46,092 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:25:46,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:25:46,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1682554578, now seen corresponding path program 2 times [2024-06-21 18:25:46,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:25:46,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061536955] [2024-06-21 18:25:46,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:25:46,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:25:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:25:47,956 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-21 18:25:47,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:25:47,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061536955] [2024-06-21 18:25:47,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061536955] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:25:47,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:25:47,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:25:47,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311030011] [2024-06-21 18:25:47,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:25:47,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:25:47,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:25:47,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:25:47,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:25:48,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:25:48,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 582 transitions, 9401 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:25:48,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:25:48,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:25:48,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:25:50,423 INFO L124 PetriNetUnfolderBase]: 4949/7613 cut-off events. [2024-06-21 18:25:50,423 INFO L125 PetriNetUnfolderBase]: For 965226/965245 co-relation queries the response was YES. [2024-06-21 18:25:50,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77204 conditions, 7613 events. 4949/7613 cut-off events. For 965226/965245 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 44190 event pairs, 2023 based on Foata normal form. 2/7581 useless extension candidates. Maximal degree in co-relation 77044. Up to 7177 conditions per place. [2024-06-21 18:25:50,527 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 554 selfloop transitions, 54 changer transitions 0/619 dead transitions. [2024-06-21 18:25:50,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 619 transitions, 11317 flow [2024-06-21 18:25:50,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:25:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:25:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-21 18:25:50,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-21 18:25:50,529 INFO L175 Difference]: Start difference. First operand has 339 places, 582 transitions, 9401 flow. Second operand 10 states and 174 transitions. [2024-06-21 18:25:50,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 619 transitions, 11317 flow [2024-06-21 18:25:53,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 619 transitions, 11163 flow, removed 39 selfloop flow, removed 12 redundant places. [2024-06-21 18:25:53,171 INFO L231 Difference]: Finished difference. Result has 337 places, 588 transitions, 9533 flow [2024-06-21 18:25:53,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9247, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9533, PETRI_PLACES=337, PETRI_TRANSITIONS=588} [2024-06-21 18:25:53,171 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 294 predicate places. [2024-06-21 18:25:53,172 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 588 transitions, 9533 flow [2024-06-21 18:25:53,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:25:53,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:25:53,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:25:53,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-21 18:25:53,172 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:25:53,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:25:53,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1523904936, now seen corresponding path program 3 times [2024-06-21 18:25:53,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:25:53,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730758165] [2024-06-21 18:25:53,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:25:53,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:25:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:25:55,200 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-21 18:25:55,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:25:55,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730758165] [2024-06-21 18:25:55,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730758165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:25:55,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:25:55,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:25:55,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016042983] [2024-06-21 18:25:55,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:25:55,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:25:55,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:25:55,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:25:55,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:25:55,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:25:55,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 588 transitions, 9533 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:25:55,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:25:55,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:25:55,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:25:57,586 INFO L124 PetriNetUnfolderBase]: 4960/7629 cut-off events. [2024-06-21 18:25:57,587 INFO L125 PetriNetUnfolderBase]: For 986334/986353 co-relation queries the response was YES. [2024-06-21 18:25:57,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77623 conditions, 7629 events. 4960/7629 cut-off events. For 986334/986353 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 44307 event pairs, 2012 based on Foata normal form. 2/7597 useless extension candidates. Maximal degree in co-relation 77463. Up to 7028 conditions per place. [2024-06-21 18:25:57,705 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 514 selfloop transitions, 99 changer transitions 0/624 dead transitions. [2024-06-21 18:25:57,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 624 transitions, 11413 flow [2024-06-21 18:25:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:25:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:25:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-21 18:25:57,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2024-06-21 18:25:57,707 INFO L175 Difference]: Start difference. First operand has 337 places, 588 transitions, 9533 flow. Second operand 10 states and 177 transitions. [2024-06-21 18:25:57,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 624 transitions, 11413 flow [2024-06-21 18:26:00,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 624 transitions, 11279 flow, removed 43 selfloop flow, removed 7 redundant places. [2024-06-21 18:26:00,561 INFO L231 Difference]: Finished difference. Result has 340 places, 591 transitions, 9699 flow [2024-06-21 18:26:00,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9403, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9699, PETRI_PLACES=340, PETRI_TRANSITIONS=591} [2024-06-21 18:26:00,561 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 297 predicate places. [2024-06-21 18:26:00,561 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 591 transitions, 9699 flow [2024-06-21 18:26:00,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:26:00,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:26:00,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:26:00,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-21 18:26:00,562 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:26:00,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:26:00,562 INFO L85 PathProgramCache]: Analyzing trace with hash -643294194, now seen corresponding path program 4 times [2024-06-21 18:26:00,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:26:00,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719172650] [2024-06-21 18:26:00,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:26:00,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:26:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:26:02,437 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-21 18:26:02,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:26:02,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719172650] [2024-06-21 18:26:02,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719172650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:26:02,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:26:02,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:26:02,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138333788] [2024-06-21 18:26:02,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:26:02,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:26:02,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:26:02,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:26:02,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:26:02,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:26:02,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 591 transitions, 9699 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:26:02,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:26:02,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:26:02,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:26:04,977 INFO L124 PetriNetUnfolderBase]: 5017/7713 cut-off events. [2024-06-21 18:26:04,977 INFO L125 PetriNetUnfolderBase]: For 987492/987511 co-relation queries the response was YES. [2024-06-21 18:26:05,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78573 conditions, 7713 events. 5017/7713 cut-off events. For 987492/987511 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 44880 event pairs, 2030 based on Foata normal form. 2/7681 useless extension candidates. Maximal degree in co-relation 78412. Up to 7355 conditions per place. [2024-06-21 18:26:05,090 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 588 selfloop transitions, 43 changer transitions 0/642 dead transitions. [2024-06-21 18:26:05,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 642 transitions, 11580 flow [2024-06-21 18:26:05,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:26:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:26:05,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-21 18:26:05,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-21 18:26:05,100 INFO L175 Difference]: Start difference. First operand has 340 places, 591 transitions, 9699 flow. Second operand 9 states and 162 transitions. [2024-06-21 18:26:05,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 642 transitions, 11580 flow [2024-06-21 18:26:08,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 642 transitions, 11101 flow, removed 42 selfloop flow, removed 10 redundant places. [2024-06-21 18:26:08,987 INFO L231 Difference]: Finished difference. Result has 340 places, 611 transitions, 9756 flow [2024-06-21 18:26:08,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9280, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9756, PETRI_PLACES=340, PETRI_TRANSITIONS=611} [2024-06-21 18:26:08,987 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 297 predicate places. [2024-06-21 18:26:08,988 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 611 transitions, 9756 flow [2024-06-21 18:26:08,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:26:08,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:26:08,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:26:08,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-21 18:26:08,988 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:26:08,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:26:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1251419846, now seen corresponding path program 14 times [2024-06-21 18:26:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:26:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57178323] [2024-06-21 18:26:08,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:26:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:26:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:26:11,107 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-21 18:26:11,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:26:11,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57178323] [2024-06-21 18:26:11,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57178323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:26:11,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:26:11,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:26:11,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731377145] [2024-06-21 18:26:11,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:26:11,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:26:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:26:11,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:26:11,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:26:11,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:26:11,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 611 transitions, 9756 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-21 18:26:11,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:26:11,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:26:11,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:26:13,582 INFO L124 PetriNetUnfolderBase]: 4672/7336 cut-off events. [2024-06-21 18:26:13,582 INFO L125 PetriNetUnfolderBase]: For 1064288/1064315 co-relation queries the response was YES. [2024-06-21 18:26:13,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77384 conditions, 7336 events. 4672/7336 cut-off events. For 1064288/1064315 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 44314 event pairs, 1757 based on Foata normal form. 25/7271 useless extension candidates. Maximal degree in co-relation 77222. Up to 6524 conditions per place. [2024-06-21 18:26:13,704 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 553 selfloop transitions, 72 changer transitions 0/652 dead transitions. [2024-06-21 18:26:13,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 652 transitions, 11736 flow [2024-06-21 18:26:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:26:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:26:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-21 18:26:13,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45476190476190476 [2024-06-21 18:26:13,705 INFO L175 Difference]: Start difference. First operand has 340 places, 611 transitions, 9756 flow. Second operand 10 states and 191 transitions. [2024-06-21 18:26:13,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 652 transitions, 11736 flow [2024-06-21 18:26:16,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 652 transitions, 11656 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-21 18:26:16,865 INFO L231 Difference]: Finished difference. Result has 344 places, 612 transitions, 9897 flow [2024-06-21 18:26:16,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9676, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9897, PETRI_PLACES=344, PETRI_TRANSITIONS=612} [2024-06-21 18:26:16,865 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 301 predicate places. [2024-06-21 18:26:16,865 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 612 transitions, 9897 flow [2024-06-21 18:26:16,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-21 18:26:16,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:26:16,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:26:16,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-21 18:26:16,866 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:26:16,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:26:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1524058758, now seen corresponding path program 15 times [2024-06-21 18:26:16,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:26:16,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579811611] [2024-06-21 18:26:16,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:26:16,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:26:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:26:19,449 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-21 18:26:19,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:26:19,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579811611] [2024-06-21 18:26:19,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579811611] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:26:19,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:26:19,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:26:19,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581904592] [2024-06-21 18:26:19,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:26:19,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:26:19,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:26:19,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:26:19,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:26:19,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:26:19,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 612 transitions, 9897 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-21 18:26:19,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:26:19,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:26:19,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:26:22,026 INFO L124 PetriNetUnfolderBase]: 4983/7838 cut-off events. [2024-06-21 18:26:22,026 INFO L125 PetriNetUnfolderBase]: For 1184207/1184234 co-relation queries the response was YES. [2024-06-21 18:26:22,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85047 conditions, 7838 events. 4983/7838 cut-off events. For 1184207/1184234 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 48100 event pairs, 1784 based on Foata normal form. 25/7769 useless extension candidates. Maximal degree in co-relation 84884. Up to 6402 conditions per place. [2024-06-21 18:26:22,173 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 518 selfloop transitions, 132 changer transitions 0/677 dead transitions. [2024-06-21 18:26:22,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 677 transitions, 12720 flow [2024-06-21 18:26:22,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:26:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:26:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2024-06-21 18:26:22,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738095238095238 [2024-06-21 18:26:22,174 INFO L175 Difference]: Start difference. First operand has 344 places, 612 transitions, 9897 flow. Second operand 10 states and 199 transitions. [2024-06-21 18:26:22,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 677 transitions, 12720 flow [2024-06-21 18:26:25,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 677 transitions, 12506 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-21 18:26:25,795 INFO L231 Difference]: Finished difference. Result has 348 places, 627 transitions, 10537 flow [2024-06-21 18:26:25,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9722, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10537, PETRI_PLACES=348, PETRI_TRANSITIONS=627} [2024-06-21 18:26:25,796 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 305 predicate places. [2024-06-21 18:26:25,796 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 627 transitions, 10537 flow [2024-06-21 18:26:25,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-21 18:26:25,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:26:25,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:26:25,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-21 18:26:25,796 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:26:25,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:26:25,797 INFO L85 PathProgramCache]: Analyzing trace with hash -892377954, now seen corresponding path program 5 times [2024-06-21 18:26:25,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:26:25,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628417420] [2024-06-21 18:26:25,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:26:25,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:26:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:26:27,591 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-21 18:26:27,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:26:27,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628417420] [2024-06-21 18:26:27,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628417420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:26:27,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:26:27,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:26:27,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767860362] [2024-06-21 18:26:27,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:26:27,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:26:27,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:26:27,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:26:27,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:26:27,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:26:27,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 627 transitions, 10537 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:26:27,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:26:27,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:26:27,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:26:30,337 INFO L124 PetriNetUnfolderBase]: 5415/8359 cut-off events. [2024-06-21 18:26:30,337 INFO L125 PetriNetUnfolderBase]: For 1139123/1139142 co-relation queries the response was YES. [2024-06-21 18:26:30,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88169 conditions, 8359 events. 5415/8359 cut-off events. For 1139123/1139142 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 49729 event pairs, 2118 based on Foata normal form. 2/8327 useless extension candidates. Maximal degree in co-relation 88003. Up to 7969 conditions per place. [2024-06-21 18:26:30,474 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 598 selfloop transitions, 54 changer transitions 0/663 dead transitions. [2024-06-21 18:26:30,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 663 transitions, 12156 flow [2024-06-21 18:26:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 18:26:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 18:26:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2024-06-21 18:26:30,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-21 18:26:30,476 INFO L175 Difference]: Start difference. First operand has 348 places, 627 transitions, 10537 flow. Second operand 11 states and 187 transitions. [2024-06-21 18:26:30,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 663 transitions, 12156 flow [2024-06-21 18:26:34,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 663 transitions, 11926 flow, removed 56 selfloop flow, removed 5 redundant places. [2024-06-21 18:26:34,072 INFO L231 Difference]: Finished difference. Result has 354 places, 627 transitions, 10446 flow [2024-06-21 18:26:34,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10309, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10446, PETRI_PLACES=354, PETRI_TRANSITIONS=627} [2024-06-21 18:26:34,072 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 311 predicate places. [2024-06-21 18:26:34,072 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 627 transitions, 10446 flow [2024-06-21 18:26:34,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:26:34,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:26:34,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:26:34,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-21 18:26:34,073 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:26:34,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:26:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1524055038, now seen corresponding path program 16 times [2024-06-21 18:26:34,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:26:34,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936301334] [2024-06-21 18:26:34,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:26:34,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:26:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:26:36,874 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-21 18:26:36,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:26:36,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936301334] [2024-06-21 18:26:36,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936301334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:26:36,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:26:36,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:26:36,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822132911] [2024-06-21 18:26:36,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:26:36,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:26:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:26:36,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:26:36,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:26:37,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:26:37,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 627 transitions, 10446 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-21 18:26:37,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:26:37,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:26:37,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:26:39,790 INFO L124 PetriNetUnfolderBase]: 5052/7948 cut-off events. [2024-06-21 18:26:39,790 INFO L125 PetriNetUnfolderBase]: For 1228368/1228395 co-relation queries the response was YES. [2024-06-21 18:26:39,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86497 conditions, 7948 events. 5052/7948 cut-off events. For 1228368/1228395 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 48852 event pairs, 1810 based on Foata normal form. 25/7883 useless extension candidates. Maximal degree in co-relation 86329. Up to 6984 conditions per place. [2024-06-21 18:26:39,919 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 519 selfloop transitions, 125 changer transitions 0/671 dead transitions. [2024-06-21 18:26:39,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 671 transitions, 12528 flow [2024-06-21 18:26:39,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:26:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:26:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-06-21 18:26:39,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-21 18:26:39,921 INFO L175 Difference]: Start difference. First operand has 354 places, 627 transitions, 10446 flow. Second operand 10 states and 196 transitions. [2024-06-21 18:26:39,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 671 transitions, 12528 flow [2024-06-21 18:26:44,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 671 transitions, 12445 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-21 18:26:44,033 INFO L231 Difference]: Finished difference. Result has 355 places, 628 transitions, 10687 flow [2024-06-21 18:26:44,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10363, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10687, PETRI_PLACES=355, PETRI_TRANSITIONS=628} [2024-06-21 18:26:44,034 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 312 predicate places. [2024-06-21 18:26:44,034 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 628 transitions, 10687 flow [2024-06-21 18:26:44,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-21 18:26:44,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:26:44,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:26:44,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-21 18:26:44,035 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:26:44,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:26:44,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1508135837, now seen corresponding path program 4 times [2024-06-21 18:26:44,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:26:44,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430597040] [2024-06-21 18:26:44,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:26:44,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:26:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:26:45,865 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-21 18:26:45,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:26:45,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430597040] [2024-06-21 18:26:45,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430597040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:26:45,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:26:45,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 18:26:45,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764728633] [2024-06-21 18:26:45,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:26:45,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 18:26:45,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:26:45,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 18:26:45,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-21 18:26:45,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:26:45,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 628 transitions, 10687 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-21 18:26:45,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:26:45,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:26:45,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:26:48,747 INFO L124 PetriNetUnfolderBase]: 5524/8539 cut-off events. [2024-06-21 18:26:48,747 INFO L125 PetriNetUnfolderBase]: For 1197180/1197199 co-relation queries the response was YES. [2024-06-21 18:26:48,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90566 conditions, 8539 events. 5524/8539 cut-off events. For 1197180/1197199 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 51215 event pairs, 2125 based on Foata normal form. 4/8509 useless extension candidates. Maximal degree in co-relation 90397. Up to 8215 conditions per place. [2024-06-21 18:26:48,859 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 616 selfloop transitions, 31 changer transitions 0/658 dead transitions. [2024-06-21 18:26:48,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 658 transitions, 12268 flow [2024-06-21 18:26:48,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:26:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:26:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-21 18:26:48,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4023809523809524 [2024-06-21 18:26:48,861 INFO L175 Difference]: Start difference. First operand has 355 places, 628 transitions, 10687 flow. Second operand 10 states and 169 transitions. [2024-06-21 18:26:48,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 658 transitions, 12268 flow [2024-06-21 18:26:53,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 658 transitions, 12030 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-21 18:26:53,115 INFO L231 Difference]: Finished difference. Result has 358 places, 630 transitions, 10613 flow [2024-06-21 18:26:53,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10449, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10613, PETRI_PLACES=358, PETRI_TRANSITIONS=630} [2024-06-21 18:26:53,115 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 315 predicate places. [2024-06-21 18:26:53,116 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 630 transitions, 10613 flow [2024-06-21 18:26:53,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-21 18:26:53,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:26:53,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:26:53,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-21 18:26:53,116 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:26:53,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:26:53,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1517332607, now seen corresponding path program 5 times [2024-06-21 18:26:53,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:26:53,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587588263] [2024-06-21 18:26:53,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:26:53,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:26:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:26:54,824 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-21 18:26:54,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:26:54,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587588263] [2024-06-21 18:26:54,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587588263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:26:54,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:26:54,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:26:54,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841045522] [2024-06-21 18:26:54,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:26:54,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:26:54,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:26:54,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:26:54,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:26:54,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:26:54,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 630 transitions, 10613 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:26:54,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:26:54,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:26:54,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:26:57,579 INFO L124 PetriNetUnfolderBase]: 5541/8566 cut-off events. [2024-06-21 18:26:57,579 INFO L125 PetriNetUnfolderBase]: For 1218168/1218189 co-relation queries the response was YES. [2024-06-21 18:26:57,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90772 conditions, 8566 events. 5541/8566 cut-off events. For 1218168/1218189 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 51354 event pairs, 2144 based on Foata normal form. 4/8536 useless extension candidates. Maximal degree in co-relation 90602. Up to 8244 conditions per place. [2024-06-21 18:26:57,718 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 619 selfloop transitions, 34 changer transitions 0/664 dead transitions. [2024-06-21 18:26:57,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 664 transitions, 12265 flow [2024-06-21 18:26:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:26:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:26:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-21 18:26:57,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2024-06-21 18:26:57,720 INFO L175 Difference]: Start difference. First operand has 358 places, 630 transitions, 10613 flow. Second operand 10 states and 176 transitions. [2024-06-21 18:26:57,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 664 transitions, 12265 flow [2024-06-21 18:27:02,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 664 transitions, 12121 flow, removed 43 selfloop flow, removed 8 redundant places. [2024-06-21 18:27:02,378 INFO L231 Difference]: Finished difference. Result has 360 places, 632 transitions, 10642 flow [2024-06-21 18:27:02,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10469, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10642, PETRI_PLACES=360, PETRI_TRANSITIONS=632} [2024-06-21 18:27:02,379 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 317 predicate places. [2024-06-21 18:27:02,379 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 632 transitions, 10642 flow [2024-06-21 18:27:02,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:27:02,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:27:02,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:27:02,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-21 18:27:02,380 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:27:02,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:27:02,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1251627608, now seen corresponding path program 6 times [2024-06-21 18:27:02,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:27:02,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438283506] [2024-06-21 18:27:02,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:27:02,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:27:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:27:04,312 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-21 18:27:04,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:27:04,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438283506] [2024-06-21 18:27:04,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438283506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:27:04,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:27:04,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:27:04,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215595738] [2024-06-21 18:27:04,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:27:04,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:27:04,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:27:04,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:27:04,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:27:04,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:27:04,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 632 transitions, 10642 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:27:04,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:27:04,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:27:04,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:27:07,141 INFO L124 PetriNetUnfolderBase]: 5552/8576 cut-off events. [2024-06-21 18:27:07,141 INFO L125 PetriNetUnfolderBase]: For 1231582/1231605 co-relation queries the response was YES. [2024-06-21 18:27:07,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90909 conditions, 8576 events. 5552/8576 cut-off events. For 1231582/1231605 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 51420 event pairs, 2115 based on Foata normal form. 4/8546 useless extension candidates. Maximal degree in co-relation 90738. Up to 8092 conditions per place. [2024-06-21 18:27:07,308 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 581 selfloop transitions, 81 changer transitions 0/673 dead transitions. [2024-06-21 18:27:07,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 673 transitions, 12420 flow [2024-06-21 18:27:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:27:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:27:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-06-21 18:27:07,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119047619047619 [2024-06-21 18:27:07,310 INFO L175 Difference]: Start difference. First operand has 360 places, 632 transitions, 10642 flow. Second operand 10 states and 173 transitions. [2024-06-21 18:27:07,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 673 transitions, 12420 flow [2024-06-21 18:27:11,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 673 transitions, 12231 flow, removed 69 selfloop flow, removed 7 redundant places. [2024-06-21 18:27:11,930 INFO L231 Difference]: Finished difference. Result has 364 places, 640 transitions, 10803 flow [2024-06-21 18:27:11,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10453, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10803, PETRI_PLACES=364, PETRI_TRANSITIONS=640} [2024-06-21 18:27:11,930 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 321 predicate places. [2024-06-21 18:27:11,930 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 640 transitions, 10803 flow [2024-06-21 18:27:11,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:27:11,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:27:11,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:27:11,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-21 18:27:11,931 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:27:11,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:27:11,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1251635327, now seen corresponding path program 6 times [2024-06-21 18:27:11,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:27:11,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913050118] [2024-06-21 18:27:11,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:27:11,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:27:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:27:13,924 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-21 18:27:13,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:27:13,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913050118] [2024-06-21 18:27:13,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913050118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:27:13,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:27:13,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:27:13,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980977852] [2024-06-21 18:27:13,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:27:13,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:27:13,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:27:13,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:27:13,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:27:14,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:27:14,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 640 transitions, 10803 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:27:14,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:27:14,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:27:14,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:27:17,010 INFO L124 PetriNetUnfolderBase]: 5580/8626 cut-off events. [2024-06-21 18:27:17,010 INFO L125 PetriNetUnfolderBase]: For 1259387/1259410 co-relation queries the response was YES. [2024-06-21 18:27:17,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91630 conditions, 8626 events. 5580/8626 cut-off events. For 1259387/1259410 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 51851 event pairs, 2122 based on Foata normal form. 4/8596 useless extension candidates. Maximal degree in co-relation 91457. Up to 8251 conditions per place. [2024-06-21 18:27:17,145 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 613 selfloop transitions, 49 changer transitions 0/673 dead transitions. [2024-06-21 18:27:17,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 673 transitions, 12445 flow [2024-06-21 18:27:17,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:27:17,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:27:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-21 18:27:17,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-21 18:27:17,146 INFO L175 Difference]: Start difference. First operand has 364 places, 640 transitions, 10803 flow. Second operand 10 states and 170 transitions. [2024-06-21 18:27:17,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 673 transitions, 12445 flow [2024-06-21 18:27:21,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 673 transitions, 12344 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-21 18:27:21,474 INFO L231 Difference]: Finished difference. Result has 367 places, 644 transitions, 10925 flow [2024-06-21 18:27:21,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10702, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10925, PETRI_PLACES=367, PETRI_TRANSITIONS=644} [2024-06-21 18:27:21,475 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 324 predicate places. [2024-06-21 18:27:21,475 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 644 transitions, 10925 flow [2024-06-21 18:27:21,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:27:21,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:27:21,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:27:21,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-21 18:27:21,476 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:27:21,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:27:21,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1518340746, now seen corresponding path program 7 times [2024-06-21 18:27:21,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:27:21,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602422761] [2024-06-21 18:27:21,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:27:21,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:27:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:27:23,509 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-21 18:27:23,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:27:23,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602422761] [2024-06-21 18:27:23,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602422761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:27:23,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:27:23,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:27:23,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422665267] [2024-06-21 18:27:23,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:27:23,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:27:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:27:23,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:27:23,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:27:23,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:27:23,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 644 transitions, 10925 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:27:23,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:27:23,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:27:23,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:27:26,372 INFO L124 PetriNetUnfolderBase]: 5604/8656 cut-off events. [2024-06-21 18:27:26,373 INFO L125 PetriNetUnfolderBase]: For 1254599/1254624 co-relation queries the response was YES. [2024-06-21 18:27:26,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91957 conditions, 8656 events. 5604/8656 cut-off events. For 1254599/1254624 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 51926 event pairs, 2124 based on Foata normal form. 4/8626 useless extension candidates. Maximal degree in co-relation 91784. Up to 7984 conditions per place. [2024-06-21 18:27:26,527 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 552 selfloop transitions, 128 changer transitions 0/691 dead transitions. [2024-06-21 18:27:26,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 691 transitions, 13128 flow [2024-06-21 18:27:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:27:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:27:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-21 18:27:26,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2024-06-21 18:27:26,529 INFO L175 Difference]: Start difference. First operand has 367 places, 644 transitions, 10925 flow. Second operand 10 states and 178 transitions. [2024-06-21 18:27:26,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 691 transitions, 13128 flow [2024-06-21 18:27:30,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 691 transitions, 12889 flow, removed 46 selfloop flow, removed 9 redundant places. [2024-06-21 18:27:30,849 INFO L231 Difference]: Finished difference. Result has 368 places, 651 transitions, 11099 flow [2024-06-21 18:27:30,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10686, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11099, PETRI_PLACES=368, PETRI_TRANSITIONS=651} [2024-06-21 18:27:30,850 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 325 predicate places. [2024-06-21 18:27:30,850 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 651 transitions, 11099 flow [2024-06-21 18:27:30,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:27:30,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:27:30,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:27:30,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-21 18:27:30,850 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:27:30,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:27:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1876284459, now seen corresponding path program 7 times [2024-06-21 18:27:30,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:27:30,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364425657] [2024-06-21 18:27:30,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:27:30,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:27:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:27:33,070 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-21 18:27:33,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:27:33,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364425657] [2024-06-21 18:27:33,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364425657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:27:33,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:27:33,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:27:33,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770115237] [2024-06-21 18:27:33,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:27:33,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:27:33,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:27:33,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:27:33,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:27:33,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:27:33,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 651 transitions, 11099 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:27:33,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:27:33,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:27:33,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:27:35,899 INFO L124 PetriNetUnfolderBase]: 5596/8653 cut-off events. [2024-06-21 18:27:35,899 INFO L125 PetriNetUnfolderBase]: For 1268290/1268315 co-relation queries the response was YES. [2024-06-21 18:27:36,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91796 conditions, 8653 events. 5596/8653 cut-off events. For 1268290/1268315 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 52077 event pairs, 2137 based on Foata normal form. 4/8623 useless extension candidates. Maximal degree in co-relation 91623. Up to 8264 conditions per place. [2024-06-21 18:27:36,067 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 616 selfloop transitions, 58 changer transitions 0/685 dead transitions. [2024-06-21 18:27:36,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 685 transitions, 12764 flow [2024-06-21 18:27:36,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:27:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:27:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-21 18:27:36,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2024-06-21 18:27:36,069 INFO L175 Difference]: Start difference. First operand has 368 places, 651 transitions, 11099 flow. Second operand 10 states and 177 transitions. [2024-06-21 18:27:36,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 685 transitions, 12764 flow [2024-06-21 18:27:40,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 685 transitions, 12373 flow, removed 47 selfloop flow, removed 9 redundant places. [2024-06-21 18:27:40,610 INFO L231 Difference]: Finished difference. Result has 369 places, 653 transitions, 10938 flow [2024-06-21 18:27:40,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10708, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10938, PETRI_PLACES=369, PETRI_TRANSITIONS=653} [2024-06-21 18:27:40,611 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 326 predicate places. [2024-06-21 18:27:40,611 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 653 transitions, 10938 flow [2024-06-21 18:27:40,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:27:40,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:27:40,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:27:40,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-21 18:27:40,611 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:27:40,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:27:40,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1518542556, now seen corresponding path program 8 times [2024-06-21 18:27:40,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:27:40,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8905610] [2024-06-21 18:27:40,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:27:40,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:27:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:27:42,602 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-21 18:27:42,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:27:42,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8905610] [2024-06-21 18:27:42,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8905610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:27:42,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:27:42,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:27:42,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66384337] [2024-06-21 18:27:42,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:27:42,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:27:42,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:27:42,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:27:42,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:27:42,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:27:42,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 653 transitions, 10938 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:27:42,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:27:42,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:27:42,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:27:45,301 INFO L124 PetriNetUnfolderBase]: 5591/8639 cut-off events. [2024-06-21 18:27:45,302 INFO L125 PetriNetUnfolderBase]: For 1283260/1283287 co-relation queries the response was YES. [2024-06-21 18:27:45,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91417 conditions, 8639 events. 5591/8639 cut-off events. For 1283260/1283287 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 51817 event pairs, 2144 based on Foata normal form. 2/8607 useless extension candidates. Maximal degree in co-relation 91245. Up to 7967 conditions per place. [2024-06-21 18:27:45,442 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 552 selfloop transitions, 128 changer transitions 0/691 dead transitions. [2024-06-21 18:27:45,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 691 transitions, 12698 flow [2024-06-21 18:27:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:27:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:27:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-21 18:27:45,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2024-06-21 18:27:45,444 INFO L175 Difference]: Start difference. First operand has 369 places, 653 transitions, 10938 flow. Second operand 10 states and 178 transitions. [2024-06-21 18:27:45,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 691 transitions, 12698 flow [2024-06-21 18:27:49,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 691 transitions, 12353 flow, removed 71 selfloop flow, removed 10 redundant places. [2024-06-21 18:27:49,674 INFO L231 Difference]: Finished difference. Result has 369 places, 653 transitions, 10861 flow [2024-06-21 18:27:49,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10593, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10861, PETRI_PLACES=369, PETRI_TRANSITIONS=653} [2024-06-21 18:27:49,674 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 326 predicate places. [2024-06-21 18:27:49,674 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 653 transitions, 10861 flow [2024-06-21 18:27:49,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-21 18:27:49,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:27:49,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:27:49,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-21 18:27:49,675 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:27:49,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:27:49,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1523910888, now seen corresponding path program 17 times [2024-06-21 18:27:49,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:27:49,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304444371] [2024-06-21 18:27:49,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:27:49,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:27:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:27:51,891 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-21 18:27:51,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:27:51,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304444371] [2024-06-21 18:27:51,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304444371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:27:51,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:27:51,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:27:51,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694263541] [2024-06-21 18:27:51,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:27:51,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:27:51,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:27:51,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:27:51,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:27:52,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:27:52,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 653 transitions, 10861 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-21 18:27:52,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:27:52,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:27:52,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:27:54,625 INFO L124 PetriNetUnfolderBase]: 5209/8195 cut-off events. [2024-06-21 18:27:54,626 INFO L125 PetriNetUnfolderBase]: For 1401972/1402007 co-relation queries the response was YES. [2024-06-21 18:27:54,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90086 conditions, 8195 events. 5209/8195 cut-off events. For 1401972/1402007 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 50748 event pairs, 1846 based on Foata normal form. 27/8120 useless extension candidates. Maximal degree in co-relation 89913. Up to 7384 conditions per place. [2024-06-21 18:27:54,753 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 558 selfloop transitions, 109 changer transitions 0/694 dead transitions. [2024-06-21 18:27:54,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 694 transitions, 12674 flow [2024-06-21 18:27:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:27:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:27:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-21 18:27:54,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45476190476190476 [2024-06-21 18:27:54,756 INFO L175 Difference]: Start difference. First operand has 369 places, 653 transitions, 10861 flow. Second operand 10 states and 191 transitions. [2024-06-21 18:27:54,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 694 transitions, 12674 flow [2024-06-21 18:27:59,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 694 transitions, 12312 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-21 18:27:59,176 INFO L231 Difference]: Finished difference. Result has 370 places, 657 transitions, 10899 flow [2024-06-21 18:27:59,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10499, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10899, PETRI_PLACES=370, PETRI_TRANSITIONS=657} [2024-06-21 18:27:59,176 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 327 predicate places. [2024-06-21 18:27:59,176 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 657 transitions, 10899 flow [2024-06-21 18:27:59,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-21 18:27:59,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:27:59,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:27:59,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-21 18:27:59,177 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:27:59,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:27:59,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1518548508, now seen corresponding path program 18 times [2024-06-21 18:27:59,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:27:59,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714680362] [2024-06-21 18:27:59,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:27:59,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:27:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:28:01,393 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-21 18:28:01,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:28:01,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714680362] [2024-06-21 18:28:01,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714680362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:28:01,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:28:01,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:28:01,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640468989] [2024-06-21 18:28:01,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:28:01,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:28:01,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:28:01,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:28:01,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:28:01,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:28:01,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 657 transitions, 10899 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-21 18:28:01,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:28:01,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:28:01,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:28:04,232 INFO L124 PetriNetUnfolderBase]: 5248/8264 cut-off events. [2024-06-21 18:28:04,233 INFO L125 PetriNetUnfolderBase]: For 1437889/1437924 co-relation queries the response was YES. [2024-06-21 18:28:04,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90626 conditions, 8264 events. 5248/8264 cut-off events. For 1437889/1437924 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 51287 event pairs, 1866 based on Foata normal form. 27/8193 useless extension candidates. Maximal degree in co-relation 90451. Up to 7449 conditions per place. [2024-06-21 18:28:04,366 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 568 selfloop transitions, 102 changer transitions 0/697 dead transitions. [2024-06-21 18:28:04,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 697 transitions, 12666 flow [2024-06-21 18:28:04,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:28:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:28:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-21 18:28:04,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-21 18:28:04,368 INFO L175 Difference]: Start difference. First operand has 370 places, 657 transitions, 10899 flow. Second operand 10 states and 192 transitions. [2024-06-21 18:28:04,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 697 transitions, 12666 flow [2024-06-21 18:28:08,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 697 transitions, 12341 flow, removed 60 selfloop flow, removed 7 redundant places. [2024-06-21 18:28:08,168 INFO L231 Difference]: Finished difference. Result has 374 places, 658 transitions, 10872 flow [2024-06-21 18:28:08,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10574, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10872, PETRI_PLACES=374, PETRI_TRANSITIONS=658} [2024-06-21 18:28:08,169 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 331 predicate places. [2024-06-21 18:28:08,169 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 658 transitions, 10872 flow [2024-06-21 18:28:08,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-21 18:28:08,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:28:08,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:28:08,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-21 18:28:08,170 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:28:08,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:28:08,170 INFO L85 PathProgramCache]: Analyzing trace with hash -478930469, now seen corresponding path program 3 times [2024-06-21 18:28:08,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:28:08,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452234108] [2024-06-21 18:28:08,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:28:08,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:28:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:28:09,646 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-21 18:28:09,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:28:09,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452234108] [2024-06-21 18:28:09,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452234108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:28:09,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:28:09,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:28:09,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533858317] [2024-06-21 18:28:09,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:28:09,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:28:09,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:28:09,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:28:09,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:28:09,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:28:09,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 658 transitions, 10872 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-21 18:28:09,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:28:09,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:28:09,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:28:12,147 INFO L124 PetriNetUnfolderBase]: 5431/8531 cut-off events. [2024-06-21 18:28:12,147 INFO L125 PetriNetUnfolderBase]: For 1357581/1357711 co-relation queries the response was YES. [2024-06-21 18:28:12,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90480 conditions, 8531 events. 5431/8531 cut-off events. For 1357581/1357711 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 53262 event pairs, 2149 based on Foata normal form. 49/8479 useless extension candidates. Maximal degree in co-relation 90303. Up to 7999 conditions per place. [2024-06-21 18:28:12,304 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 553 selfloop transitions, 26 changer transitions 0/677 dead transitions. [2024-06-21 18:28:12,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 677 transitions, 12371 flow [2024-06-21 18:28:12,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:28:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:28:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-21 18:28:12,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-21 18:28:12,306 INFO L175 Difference]: Start difference. First operand has 374 places, 658 transitions, 10872 flow. Second operand 7 states and 126 transitions. [2024-06-21 18:28:12,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 677 transitions, 12371 flow [2024-06-21 18:28:16,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 677 transitions, 12042 flow, removed 28 selfloop flow, removed 9 redundant places. [2024-06-21 18:28:16,370 INFO L231 Difference]: Finished difference. Result has 374 places, 667 transitions, 10744 flow [2024-06-21 18:28:16,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10543, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10744, PETRI_PLACES=374, PETRI_TRANSITIONS=667} [2024-06-21 18:28:16,371 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 331 predicate places. [2024-06-21 18:28:16,371 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 667 transitions, 10744 flow [2024-06-21 18:28:16,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-21 18:28:16,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:28:16,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:28:16,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-21 18:28:16,371 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:28:16,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:28:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash -478484999, now seen corresponding path program 4 times [2024-06-21 18:28:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:28:16,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369198833] [2024-06-21 18:28:16,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:28:16,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:28:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:28:17,777 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-21 18:28:17,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:28:17,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369198833] [2024-06-21 18:28:17,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369198833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:28:17,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:28:17,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:28:17,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936546594] [2024-06-21 18:28:17,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:28:17,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:28:17,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:28:17,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:28:17,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:28:17,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:28:17,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 667 transitions, 10744 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-21 18:28:17,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:28:17,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:28:17,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:28:20,310 INFO L124 PetriNetUnfolderBase]: 5425/8523 cut-off events. [2024-06-21 18:28:20,310 INFO L125 PetriNetUnfolderBase]: For 1366138/1366254 co-relation queries the response was YES. [2024-06-21 18:28:20,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90043 conditions, 8523 events. 5425/8523 cut-off events. For 1366138/1366254 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 53233 event pairs, 2141 based on Foata normal form. 50/8472 useless extension candidates. Maximal degree in co-relation 89862. Up to 8008 conditions per place. [2024-06-21 18:28:20,455 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 562 selfloop transitions, 16 changer transitions 0/676 dead transitions. [2024-06-21 18:28:20,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 676 transitions, 11948 flow [2024-06-21 18:28:20,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:28:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:28:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-21 18:28:20,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41156462585034015 [2024-06-21 18:28:20,456 INFO L175 Difference]: Start difference. First operand has 374 places, 667 transitions, 10744 flow. Second operand 7 states and 121 transitions. [2024-06-21 18:28:20,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 676 transitions, 11948 flow [2024-06-21 18:28:25,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 676 transitions, 11879 flow, removed 31 selfloop flow, removed 2 redundant places. [2024-06-21 18:28:25,233 INFO L231 Difference]: Finished difference. Result has 379 places, 667 transitions, 10713 flow [2024-06-21 18:28:25,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10675, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10713, PETRI_PLACES=379, PETRI_TRANSITIONS=667} [2024-06-21 18:28:25,234 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 336 predicate places. [2024-06-21 18:28:25,234 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 667 transitions, 10713 flow [2024-06-21 18:28:25,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-21 18:28:25,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:28:25,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:28:25,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-21 18:28:25,234 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:28:25,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:28:25,235 INFO L85 PathProgramCache]: Analyzing trace with hash -685549344, now seen corresponding path program 1 times [2024-06-21 18:28:25,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:28:25,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2955669] [2024-06-21 18:28:25,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:28:25,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:28:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:28:27,240 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-21 18:28:27,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:28:27,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2955669] [2024-06-21 18:28:27,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2955669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:28:27,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:28:27,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:28:27,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433540894] [2024-06-21 18:28:27,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:28:27,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:28:27,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:28:27,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:28:27,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:28:27,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-21 18:28:27,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 667 transitions, 10713 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:28:27,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:28:27,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-21 18:28:27,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:28:30,200 INFO L124 PetriNetUnfolderBase]: 5883/9043 cut-off events. [2024-06-21 18:28:30,200 INFO L125 PetriNetUnfolderBase]: For 1372322/1372322 co-relation queries the response was YES. [2024-06-21 18:28:30,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94589 conditions, 9043 events. 5883/9043 cut-off events. For 1372322/1372322 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 54083 event pairs, 2273 based on Foata normal form. 1/9043 useless extension candidates. Maximal degree in co-relation 94405. Up to 8893 conditions per place. [2024-06-21 18:28:30,363 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 658 selfloop transitions, 29 changer transitions 0/690 dead transitions. [2024-06-21 18:28:30,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 690 transitions, 12467 flow [2024-06-21 18:28:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:28:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:28:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-21 18:28:30,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-21 18:28:30,364 INFO L175 Difference]: Start difference. First operand has 379 places, 667 transitions, 10713 flow. Second operand 7 states and 119 transitions. [2024-06-21 18:28:30,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 690 transitions, 12467 flow [2024-06-21 18:28:35,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 690 transitions, 12403 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-21 18:28:35,246 INFO L231 Difference]: Finished difference. Result has 381 places, 675 transitions, 10844 flow [2024-06-21 18:28:35,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10649, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10844, PETRI_PLACES=381, PETRI_TRANSITIONS=675} [2024-06-21 18:28:35,246 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 338 predicate places. [2024-06-21 18:28:35,246 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 675 transitions, 10844 flow [2024-06-21 18:28:35,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:28:35,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:28:35,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:28:35,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-21 18:28:35,247 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:28:35,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:28:35,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1229867298, now seen corresponding path program 2 times [2024-06-21 18:28:35,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:28:35,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630305174] [2024-06-21 18:28:35,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:28:35,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:28:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:28:37,267 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-21 18:28:37,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:28:37,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630305174] [2024-06-21 18:28:37,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630305174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:28:37,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:28:37,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:28:37,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667361191] [2024-06-21 18:28:37,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:28:37,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:28:37,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:28:37,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:28:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:28:37,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-21 18:28:37,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 675 transitions, 10844 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:28:37,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:28:37,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-21 18:28:37,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:28:40,290 INFO L124 PetriNetUnfolderBase]: 5888/9050 cut-off events. [2024-06-21 18:28:40,290 INFO L125 PetriNetUnfolderBase]: For 1399089/1399089 co-relation queries the response was YES. [2024-06-21 18:28:40,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95591 conditions, 9050 events. 5888/9050 cut-off events. For 1399089/1399089 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 54133 event pairs, 2273 based on Foata normal form. 1/9050 useless extension candidates. Maximal degree in co-relation 95404. Up to 8899 conditions per place. [2024-06-21 18:28:40,423 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 657 selfloop transitions, 31 changer transitions 0/691 dead transitions. [2024-06-21 18:28:40,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 691 transitions, 12533 flow [2024-06-21 18:28:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:28:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:28:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-21 18:28:40,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3979591836734694 [2024-06-21 18:28:40,425 INFO L175 Difference]: Start difference. First operand has 381 places, 675 transitions, 10844 flow. Second operand 7 states and 117 transitions. [2024-06-21 18:28:40,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 691 transitions, 12533 flow [2024-06-21 18:28:46,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 691 transitions, 12490 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-21 18:28:46,237 INFO L231 Difference]: Finished difference. Result has 386 places, 678 transitions, 10914 flow [2024-06-21 18:28:46,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10811, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10914, PETRI_PLACES=386, PETRI_TRANSITIONS=678} [2024-06-21 18:28:46,237 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 343 predicate places. [2024-06-21 18:28:46,238 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 678 transitions, 10914 flow [2024-06-21 18:28:46,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:28:46,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:28:46,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:28:46,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-21 18:28:46,238 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:28:46,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:28:46,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1073967967, now seen corresponding path program 1 times [2024-06-21 18:28:46,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:28:46,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458065424] [2024-06-21 18:28:46,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:28:46,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:28:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:28:48,298 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-21 18:28:48,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:28:48,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458065424] [2024-06-21 18:28:48,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458065424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:28:48,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:28:48,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:28:48,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419800683] [2024-06-21 18:28:48,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:28:48,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:28:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:28:48,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:28:48,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:28:48,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-21 18:28:48,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 678 transitions, 10914 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:28:48,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:28:48,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-21 18:28:48,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:28:51,533 INFO L124 PetriNetUnfolderBase]: 5903/9070 cut-off events. [2024-06-21 18:28:51,533 INFO L125 PetriNetUnfolderBase]: For 1431617/1431617 co-relation queries the response was YES. [2024-06-21 18:28:51,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96063 conditions, 9070 events. 5903/9070 cut-off events. For 1431617/1431617 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 54223 event pairs, 2284 based on Foata normal form. 3/9072 useless extension candidates. Maximal degree in co-relation 95872. Up to 8905 conditions per place. [2024-06-21 18:28:51,673 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 669 selfloop transitions, 29 changer transitions 0/701 dead transitions. [2024-06-21 18:28:51,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 701 transitions, 12690 flow [2024-06-21 18:28:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:28:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:28:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-21 18:28:51,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2024-06-21 18:28:51,674 INFO L175 Difference]: Start difference. First operand has 386 places, 678 transitions, 10914 flow. Second operand 7 states and 123 transitions. [2024-06-21 18:28:51,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 701 transitions, 12690 flow [2024-06-21 18:28:56,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 701 transitions, 12638 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-21 18:28:56,709 INFO L231 Difference]: Finished difference. Result has 390 places, 684 transitions, 11022 flow [2024-06-21 18:28:56,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10862, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11022, PETRI_PLACES=390, PETRI_TRANSITIONS=684} [2024-06-21 18:28:56,710 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 347 predicate places. [2024-06-21 18:28:56,710 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 684 transitions, 11022 flow [2024-06-21 18:28:56,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:28:56,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:28:56,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:28:56,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-21 18:28:56,710 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:28:56,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:28:56,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1744865245, now seen corresponding path program 2 times [2024-06-21 18:28:56,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:28:56,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539654375] [2024-06-21 18:28:56,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:28:56,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:28:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:28:58,780 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-21 18:28:58,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:28:58,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539654375] [2024-06-21 18:28:58,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539654375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:28:58,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:28:58,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:28:58,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544203027] [2024-06-21 18:28:58,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:28:58,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:28:58,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:28:58,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:28:58,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:28:58,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-21 18:28:58,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 684 transitions, 11022 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:28:58,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:28:58,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-21 18:28:58,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:29:01,696 INFO L124 PetriNetUnfolderBase]: 5918/9092 cut-off events. [2024-06-21 18:29:01,696 INFO L125 PetriNetUnfolderBase]: For 1459311/1459314 co-relation queries the response was YES. [2024-06-21 18:29:01,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96841 conditions, 9092 events. 5918/9092 cut-off events. For 1459311/1459314 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 54298 event pairs, 2284 based on Foata normal form. 5/9095 useless extension candidates. Maximal degree in co-relation 96647. Up to 8919 conditions per place. [2024-06-21 18:29:01,865 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 665 selfloop transitions, 33 changer transitions 0/701 dead transitions. [2024-06-21 18:29:01,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 701 transitions, 12728 flow [2024-06-21 18:29:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:29:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:29:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-21 18:29:01,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3979591836734694 [2024-06-21 18:29:01,866 INFO L175 Difference]: Start difference. First operand has 390 places, 684 transitions, 11022 flow. Second operand 7 states and 117 transitions. [2024-06-21 18:29:01,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 701 transitions, 12728 flow [2024-06-21 18:29:07,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 701 transitions, 12673 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-21 18:29:07,600 INFO L231 Difference]: Finished difference. Result has 393 places, 687 transitions, 11093 flow [2024-06-21 18:29:07,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10971, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11093, PETRI_PLACES=393, PETRI_TRANSITIONS=687} [2024-06-21 18:29:07,601 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 350 predicate places. [2024-06-21 18:29:07,601 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 687 transitions, 11093 flow [2024-06-21 18:29:07,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:29:07,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:29:07,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:29:07,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-21 18:29:07,601 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:29:07,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:29:07,602 INFO L85 PathProgramCache]: Analyzing trace with hash -478745957, now seen corresponding path program 3 times [2024-06-21 18:29:07,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:29:07,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303553723] [2024-06-21 18:29:07,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:29:07,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:29:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:29:09,638 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-21 18:29:09,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:29:09,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303553723] [2024-06-21 18:29:09,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303553723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:29:09,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:29:09,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:29:09,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159021045] [2024-06-21 18:29:09,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:29:09,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:29:09,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:29:09,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:29:09,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:29:09,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-21 18:29:09,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 687 transitions, 11093 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:29:09,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:29:09,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-21 18:29:09,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:29:12,691 INFO L124 PetriNetUnfolderBase]: 5909/9080 cut-off events. [2024-06-21 18:29:12,691 INFO L125 PetriNetUnfolderBase]: For 1472670/1472673 co-relation queries the response was YES. [2024-06-21 18:29:12,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96762 conditions, 9080 events. 5909/9080 cut-off events. For 1472670/1472673 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 54297 event pairs, 2275 based on Foata normal form. 5/9083 useless extension candidates. Maximal degree in co-relation 96565. Up to 8912 conditions per place. [2024-06-21 18:29:12,857 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 667 selfloop transitions, 32 changer transitions 0/702 dead transitions. [2024-06-21 18:29:12,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 702 transitions, 12569 flow [2024-06-21 18:29:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:29:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:29:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-21 18:29:12,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-21 18:29:12,858 INFO L175 Difference]: Start difference. First operand has 393 places, 687 transitions, 11093 flow. Second operand 7 states and 119 transitions. [2024-06-21 18:29:12,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 702 transitions, 12569 flow [2024-06-21 18:29:18,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 702 transitions, 12441 flow, removed 48 selfloop flow, removed 3 redundant places. [2024-06-21 18:29:18,069 INFO L231 Difference]: Finished difference. Result has 397 places, 687 transitions, 11037 flow [2024-06-21 18:29:18,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10965, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11037, PETRI_PLACES=397, PETRI_TRANSITIONS=687} [2024-06-21 18:29:18,069 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 354 predicate places. [2024-06-21 18:29:18,069 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 687 transitions, 11037 flow [2024-06-21 18:29:18,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:29:18,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:29:18,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:29:18,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-21 18:29:18,070 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:29:18,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:29:18,070 INFO L85 PathProgramCache]: Analyzing trace with hash -478746174, now seen corresponding path program 3 times [2024-06-21 18:29:18,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:29:18,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168649451] [2024-06-21 18:29:18,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:29:18,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:29:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:29:20,079 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-21 18:29:20,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:29:20,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168649451] [2024-06-21 18:29:20,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168649451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:29:20,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:29:20,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:29:20,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754526149] [2024-06-21 18:29:20,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:29:20,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:29:20,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:29:20,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:29:20,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:29:20,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-21 18:29:20,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 687 transitions, 11037 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:29:20,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:29:20,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-21 18:29:20,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:29:23,043 INFO L124 PetriNetUnfolderBase]: 5906/9077 cut-off events. [2024-06-21 18:29:23,043 INFO L125 PetriNetUnfolderBase]: For 1481667/1481673 co-relation queries the response was YES. [2024-06-21 18:29:23,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96698 conditions, 9077 events. 5906/9077 cut-off events. For 1481667/1481673 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 54346 event pairs, 2263 based on Foata normal form. 5/9078 useless extension candidates. Maximal degree in co-relation 96498. Up to 8926 conditions per place. [2024-06-21 18:29:23,222 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 662 selfloop transitions, 31 changer transitions 0/696 dead transitions. [2024-06-21 18:29:23,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 696 transitions, 12471 flow [2024-06-21 18:29:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:29:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:29:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-21 18:29:23,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3843537414965986 [2024-06-21 18:29:23,224 INFO L175 Difference]: Start difference. First operand has 397 places, 687 transitions, 11037 flow. Second operand 7 states and 113 transitions. [2024-06-21 18:29:23,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 696 transitions, 12471 flow [2024-06-21 18:29:28,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 696 transitions, 12411 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-21 18:29:28,766 INFO L231 Difference]: Finished difference. Result has 401 places, 687 transitions, 11047 flow [2024-06-21 18:29:28,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10977, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11047, PETRI_PLACES=401, PETRI_TRANSITIONS=687} [2024-06-21 18:29:28,767 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 358 predicate places. [2024-06-21 18:29:28,767 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 687 transitions, 11047 flow [2024-06-21 18:29:28,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:29:28,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:29:28,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:29:28,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-21 18:29:28,767 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:29:28,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:29:28,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1136049193, now seen corresponding path program 1 times [2024-06-21 18:29:28,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:29:28,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233119204] [2024-06-21 18:29:28,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:29:28,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:29:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:29:30,408 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-21 18:29:30,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:29:30,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233119204] [2024-06-21 18:29:30,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233119204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:29:30,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:29:30,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:29:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370929423] [2024-06-21 18:29:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:29:30,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:29:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:29:30,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:29:30,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:29:30,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:29:30,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 687 transitions, 11047 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-21 18:29:30,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:29:30,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:29:30,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:29:33,352 INFO L124 PetriNetUnfolderBase]: 5710/8853 cut-off events. [2024-06-21 18:29:33,353 INFO L125 PetriNetUnfolderBase]: For 1519977/1520041 co-relation queries the response was YES. [2024-06-21 18:29:33,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95380 conditions, 8853 events. 5710/8853 cut-off events. For 1519977/1520041 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 53977 event pairs, 1709 based on Foata normal form. 42/8843 useless extension candidates. Maximal degree in co-relation 95177. Up to 8364 conditions per place. [2024-06-21 18:29:33,497 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 611 selfloop transitions, 71 changer transitions 0/732 dead transitions. [2024-06-21 18:29:33,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 732 transitions, 13020 flow [2024-06-21 18:29:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:29:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:29:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-21 18:29:33,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-21 18:29:33,499 INFO L175 Difference]: Start difference. First operand has 401 places, 687 transitions, 11047 flow. Second operand 8 states and 150 transitions. [2024-06-21 18:29:33,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 732 transitions, 13020 flow [2024-06-21 18:29:38,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 732 transitions, 12964 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-21 18:29:38,393 INFO L231 Difference]: Finished difference. Result has 405 places, 708 transitions, 11451 flow [2024-06-21 18:29:38,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10991, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11451, PETRI_PLACES=405, PETRI_TRANSITIONS=708} [2024-06-21 18:29:38,393 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 362 predicate places. [2024-06-21 18:29:38,393 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 708 transitions, 11451 flow [2024-06-21 18:29:38,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-21 18:29:38,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:29:38,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:29:38,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-21 18:29:38,394 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:29:38,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:29:38,394 INFO L85 PathProgramCache]: Analyzing trace with hash -32274789, now seen corresponding path program 1 times [2024-06-21 18:29:38,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:29:38,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72123763] [2024-06-21 18:29:38,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:29:38,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:29:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:29:40,559 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-21 18:29:40,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:29:40,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72123763] [2024-06-21 18:29:40,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72123763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:29:40,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:29:40,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:29:40,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256531413] [2024-06-21 18:29:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:29:40,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:29:40,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:29:40,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:29:40,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:29:40,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:29:40,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 708 transitions, 11451 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 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-21 18:29:40,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:29:40,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:29:40,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:29:43,876 INFO L124 PetriNetUnfolderBase]: 5858/9049 cut-off events. [2024-06-21 18:29:43,876 INFO L125 PetriNetUnfolderBase]: For 1624005/1624020 co-relation queries the response was YES. [2024-06-21 18:29:44,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99156 conditions, 9049 events. 5858/9049 cut-off events. For 1624005/1624020 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 54832 event pairs, 1611 based on Foata normal form. 6/9018 useless extension candidates. Maximal degree in co-relation 98951. Up to 8527 conditions per place. [2024-06-21 18:29:44,054 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 627 selfloop transitions, 109 changer transitions 0/758 dead transitions. [2024-06-21 18:29:44,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 758 transitions, 13378 flow [2024-06-21 18:29:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-21 18:29:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-21 18:29:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 232 transitions. [2024-06-21 18:29:44,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4249084249084249 [2024-06-21 18:29:44,056 INFO L175 Difference]: Start difference. First operand has 405 places, 708 transitions, 11451 flow. Second operand 13 states and 232 transitions. [2024-06-21 18:29:44,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 758 transitions, 13378 flow [2024-06-21 18:29:49,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 758 transitions, 13263 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-06-21 18:29:49,549 INFO L231 Difference]: Finished difference. Result has 414 places, 710 transitions, 11670 flow [2024-06-21 18:29:49,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11336, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11670, PETRI_PLACES=414, PETRI_TRANSITIONS=710} [2024-06-21 18:29:49,550 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 371 predicate places. [2024-06-21 18:29:49,550 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 710 transitions, 11670 flow [2024-06-21 18:29:49,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 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-21 18:29:49,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:29:49,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:29:49,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-21 18:29:49,550 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:29:49,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:29:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash -171013827, now seen corresponding path program 2 times [2024-06-21 18:29:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:29:49,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362937042] [2024-06-21 18:29:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:29:49,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:29:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:29:51,921 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-21 18:29:51,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:29:51,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362937042] [2024-06-21 18:29:51,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362937042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:29:51,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:29:51,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:29:51,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752842607] [2024-06-21 18:29:51,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:29:51,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:29:51,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:29:51,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:29:51,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:29:52,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:29:52,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 710 transitions, 11670 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-21 18:29:52,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:29:52,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:29:52,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:29:54,913 INFO L124 PetriNetUnfolderBase]: 5732/8887 cut-off events. [2024-06-21 18:29:54,913 INFO L125 PetriNetUnfolderBase]: For 1583545/1583609 co-relation queries the response was YES. [2024-06-21 18:29:55,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97549 conditions, 8887 events. 5732/8887 cut-off events. For 1583545/1583609 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 54224 event pairs, 1712 based on Foata normal form. 42/8877 useless extension candidates. Maximal degree in co-relation 97343. Up to 8397 conditions per place. [2024-06-21 18:29:55,096 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 614 selfloop transitions, 75 changer transitions 0/739 dead transitions. [2024-06-21 18:29:55,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 739 transitions, 13476 flow [2024-06-21 18:29:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:29:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:29:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-21 18:29:55,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034013605442177 [2024-06-21 18:29:55,098 INFO L175 Difference]: Start difference. First operand has 414 places, 710 transitions, 11670 flow. Second operand 7 states and 148 transitions. [2024-06-21 18:29:55,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 739 transitions, 13476 flow [2024-06-21 18:30:02,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 739 transitions, 13174 flow, removed 50 selfloop flow, removed 10 redundant places. [2024-06-21 18:30:02,740 INFO L231 Difference]: Finished difference. Result has 411 places, 713 transitions, 11586 flow [2024-06-21 18:30:02,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11368, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11586, PETRI_PLACES=411, PETRI_TRANSITIONS=713} [2024-06-21 18:30:02,741 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 368 predicate places. [2024-06-21 18:30:02,741 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 713 transitions, 11586 flow [2024-06-21 18:30:02,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-21 18:30:02,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:30:02,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:30:02,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-21 18:30:02,742 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:30:02,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:30:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash 392346693, now seen corresponding path program 3 times [2024-06-21 18:30:02,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:30:02,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169467897] [2024-06-21 18:30:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:30:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:30:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:30:05,168 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-21 18:30:05,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:30:05,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169467897] [2024-06-21 18:30:05,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169467897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:30:05,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:30:05,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:30:05,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905440207] [2024-06-21 18:30:05,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:30:05,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:30:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:30:05,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:30:05,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:30:05,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:30:05,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 713 transitions, 11586 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-21 18:30:05,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:30:05,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:30:05,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:30:08,011 INFO L124 PetriNetUnfolderBase]: 5752/8920 cut-off events. [2024-06-21 18:30:08,012 INFO L125 PetriNetUnfolderBase]: For 1611189/1611239 co-relation queries the response was YES. [2024-06-21 18:30:08,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97712 conditions, 8920 events. 5752/8920 cut-off events. For 1611189/1611239 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 54372 event pairs, 1748 based on Foata normal form. 30/8902 useless extension candidates. Maximal degree in co-relation 97506. Up to 8483 conditions per place. [2024-06-21 18:30:08,175 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 622 selfloop transitions, 73 changer transitions 0/745 dead transitions. [2024-06-21 18:30:08,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 745 transitions, 13282 flow [2024-06-21 18:30:08,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:30:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:30:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-21 18:30:08,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-21 18:30:08,176 INFO L175 Difference]: Start difference. First operand has 411 places, 713 transitions, 11586 flow. Second operand 8 states and 150 transitions. [2024-06-21 18:30:08,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 745 transitions, 13282 flow [2024-06-21 18:30:15,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 745 transitions, 13131 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-21 18:30:15,072 INFO L231 Difference]: Finished difference. Result has 416 places, 725 transitions, 11773 flow [2024-06-21 18:30:15,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11452, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11773, PETRI_PLACES=416, PETRI_TRANSITIONS=725} [2024-06-21 18:30:15,072 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 373 predicate places. [2024-06-21 18:30:15,072 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 725 transitions, 11773 flow [2024-06-21 18:30:15,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-21 18:30:15,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:30:15,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:30:15,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-21 18:30:15,073 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:30:15,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:30:15,073 INFO L85 PathProgramCache]: Analyzing trace with hash -696809595, now seen corresponding path program 2 times [2024-06-21 18:30:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:30:15,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108634417] [2024-06-21 18:30:15,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:30:15,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:30:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:30:17,768 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-21 18:30:17,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:30:17,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108634417] [2024-06-21 18:30:17,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108634417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:30:17,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:30:17,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-21 18:30:17,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922646591] [2024-06-21 18:30:17,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:30:17,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-21 18:30:17,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:30:17,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-21 18:30:17,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-21 18:30:17,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:30:17,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 725 transitions, 11773 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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-21 18:30:17,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:30:17,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:30:17,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:30:21,259 INFO L124 PetriNetUnfolderBase]: 5926/9130 cut-off events. [2024-06-21 18:30:21,259 INFO L125 PetriNetUnfolderBase]: For 1677833/1677851 co-relation queries the response was YES. [2024-06-21 18:30:21,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100470 conditions, 9130 events. 5926/9130 cut-off events. For 1677833/1677851 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 54978 event pairs, 1435 based on Foata normal form. 14/9129 useless extension candidates. Maximal degree in co-relation 100262. Up to 8704 conditions per place. [2024-06-21 18:30:21,425 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 673 selfloop transitions, 84 changer transitions 0/784 dead transitions. [2024-06-21 18:30:21,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 784 transitions, 13951 flow [2024-06-21 18:30:21,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 18:30:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 18:30:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-06-21 18:30:21,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-21 18:30:21,427 INFO L175 Difference]: Start difference. First operand has 416 places, 725 transitions, 11773 flow. Second operand 11 states and 196 transitions. [2024-06-21 18:30:21,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 784 transitions, 13951 flow [2024-06-21 18:30:28,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 784 transitions, 13785 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-21 18:30:28,726 INFO L231 Difference]: Finished difference. Result has 424 places, 748 transitions, 12318 flow [2024-06-21 18:30:28,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11607, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12318, PETRI_PLACES=424, PETRI_TRANSITIONS=748} [2024-06-21 18:30:28,726 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 381 predicate places. [2024-06-21 18:30:28,727 INFO L495 AbstractCegarLoop]: Abstraction has has 424 places, 748 transitions, 12318 flow [2024-06-21 18:30:28,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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-21 18:30:28,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:30:28,727 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-21 18:30:28,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-21 18:30:28,727 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:30:28,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:30:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1218490158, now seen corresponding path program 1 times [2024-06-21 18:30:28,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:30:28,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424287018] [2024-06-21 18:30:28,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:30:28,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:30:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:30:32,074 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-21 18:30:32,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:30:32,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424287018] [2024-06-21 18:30:32,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424287018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:30:32,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:30:32,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:30:32,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817527286] [2024-06-21 18:30:32,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:30:32,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:30:32,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:30:32,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:30:32,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:30:32,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:30:32,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 748 transitions, 12318 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 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-21 18:30:32,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:30:32,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:30:32,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:30:35,179 INFO L124 PetriNetUnfolderBase]: 5849/9060 cut-off events. [2024-06-21 18:30:35,179 INFO L125 PetriNetUnfolderBase]: For 1698120/1698187 co-relation queries the response was YES. [2024-06-21 18:30:35,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100802 conditions, 9060 events. 5849/9060 cut-off events. For 1698120/1698187 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 55361 event pairs, 1725 based on Foata normal form. 44/9052 useless extension candidates. Maximal degree in co-relation 100591. Up to 8409 conditions per place. [2024-06-21 18:30:35,354 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 647 selfloop transitions, 108 changer transitions 0/805 dead transitions. [2024-06-21 18:30:35,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 805 transitions, 14972 flow [2024-06-21 18:30:35,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:30:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:30:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2024-06-21 18:30:35,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894179894179894 [2024-06-21 18:30:35,355 INFO L175 Difference]: Start difference. First operand has 424 places, 748 transitions, 12318 flow. Second operand 9 states and 185 transitions. [2024-06-21 18:30:35,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 805 transitions, 14972 flow [2024-06-21 18:30:41,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 805 transitions, 14738 flow, removed 64 selfloop flow, removed 6 redundant places. [2024-06-21 18:30:41,927 INFO L231 Difference]: Finished difference. Result has 429 places, 767 transitions, 12693 flow [2024-06-21 18:30:41,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12084, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12693, PETRI_PLACES=429, PETRI_TRANSITIONS=767} [2024-06-21 18:30:41,928 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 386 predicate places. [2024-06-21 18:30:41,928 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 767 transitions, 12693 flow [2024-06-21 18:30:41,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 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-21 18:30:41,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:30:41,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:30:41,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-21 18:30:41,928 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:30:41,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:30:41,928 INFO L85 PathProgramCache]: Analyzing trace with hash 816675527, now seen corresponding path program 1 times [2024-06-21 18:30:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:30:41,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837990924] [2024-06-21 18:30:41,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:30:41,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:30:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:30:44,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-21 18:30:44,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:30:44,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837990924] [2024-06-21 18:30:44,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837990924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:30:44,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:30:44,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:30:44,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500143564] [2024-06-21 18:30:44,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:30:44,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:30:44,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:30:44,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:30:44,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:30:44,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-21 18:30:44,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 767 transitions, 12693 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:30:44,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:30:44,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-21 18:30:44,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:30:47,762 INFO L124 PetriNetUnfolderBase]: 6081/9309 cut-off events. [2024-06-21 18:30:47,762 INFO L125 PetriNetUnfolderBase]: For 1729100/1729106 co-relation queries the response was YES. [2024-06-21 18:30:47,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104107 conditions, 9309 events. 6081/9309 cut-off events. For 1729100/1729106 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 55527 event pairs, 1828 based on Foata normal form. 5/9312 useless extension candidates. Maximal degree in co-relation 103893. Up to 9100 conditions per place. [2024-06-21 18:30:47,911 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 744 selfloop transitions, 57 changer transitions 0/804 dead transitions. [2024-06-21 18:30:47,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 804 transitions, 15339 flow [2024-06-21 18:30:47,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:30:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:30:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-21 18:30:47,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-21 18:30:47,913 INFO L175 Difference]: Start difference. First operand has 429 places, 767 transitions, 12693 flow. Second operand 8 states and 143 transitions. [2024-06-21 18:30:47,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 804 transitions, 15339 flow [2024-06-21 18:30:54,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 804 transitions, 15245 flow, removed 41 selfloop flow, removed 2 redundant places. [2024-06-21 18:30:54,533 INFO L231 Difference]: Finished difference. Result has 435 places, 780 transitions, 13006 flow [2024-06-21 18:30:54,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12607, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13006, PETRI_PLACES=435, PETRI_TRANSITIONS=780} [2024-06-21 18:30:54,534 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 392 predicate places. [2024-06-21 18:30:54,534 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 780 transitions, 13006 flow [2024-06-21 18:30:54,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:30:54,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:30:54,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:30:54,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-21 18:30:54,534 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:30:54,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:30:54,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1052159647, now seen corresponding path program 3 times [2024-06-21 18:30:54,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:30:54,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19830395] [2024-06-21 18:30:54,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:30:54,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:30:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:30:57,208 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-21 18:30:57,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:30:57,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19830395] [2024-06-21 18:30:57,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19830395] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:30:57,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:30:57,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-21 18:30:57,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318610678] [2024-06-21 18:30:57,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:30:57,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-21 18:30:57,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:30:57,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-21 18:30:57,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-21 18:30:57,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:30:57,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 780 transitions, 13006 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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-21 18:30:57,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:30:57,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:30:57,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:31:01,376 INFO L124 PetriNetUnfolderBase]: 6136/9431 cut-off events. [2024-06-21 18:31:01,376 INFO L125 PetriNetUnfolderBase]: For 1815949/1815974 co-relation queries the response was YES. [2024-06-21 18:31:01,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106438 conditions, 9431 events. 6136/9431 cut-off events. For 1815949/1815974 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 56888 event pairs, 1384 based on Foata normal form. 15/9425 useless extension candidates. Maximal degree in co-relation 106221. Up to 8101 conditions per place. [2024-06-21 18:31:01,602 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 493 selfloop transitions, 357 changer transitions 0/881 dead transitions. [2024-06-21 18:31:01,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 881 transitions, 15838 flow [2024-06-21 18:31:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 18:31:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 18:31:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2024-06-21 18:31:01,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-21 18:31:01,603 INFO L175 Difference]: Start difference. First operand has 435 places, 780 transitions, 13006 flow. Second operand 11 states and 210 transitions. [2024-06-21 18:31:01,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 881 transitions, 15838 flow [2024-06-21 18:31:07,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 881 transitions, 15725 flow, removed 49 selfloop flow, removed 2 redundant places. [2024-06-21 18:31:07,930 INFO L231 Difference]: Finished difference. Result has 446 places, 832 transitions, 14532 flow [2024-06-21 18:31:07,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12893, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=305, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14532, PETRI_PLACES=446, PETRI_TRANSITIONS=832} [2024-06-21 18:31:07,931 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 403 predicate places. [2024-06-21 18:31:07,931 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 832 transitions, 14532 flow [2024-06-21 18:31:07,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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-21 18:31:07,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:31:07,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:31:07,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-21 18:31:07,931 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:31:07,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:31:07,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1224649537, now seen corresponding path program 4 times [2024-06-21 18:31:07,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:31:07,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385494789] [2024-06-21 18:31:07,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:31:07,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:31:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:31:10,679 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-21 18:31:10,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:31:10,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385494789] [2024-06-21 18:31:10,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385494789] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:31:10,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:31:10,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-21 18:31:10,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32367871] [2024-06-21 18:31:10,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:31:10,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-21 18:31:10,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:31:10,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-21 18:31:10,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-21 18:31:10,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:31:10,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 832 transitions, 14532 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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-21 18:31:10,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:31:10,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:31:10,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:31:14,863 INFO L124 PetriNetUnfolderBase]: 6153/9459 cut-off events. [2024-06-21 18:31:14,864 INFO L125 PetriNetUnfolderBase]: For 1863968/1863993 co-relation queries the response was YES. [2024-06-21 18:31:14,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109597 conditions, 9459 events. 6153/9459 cut-off events. For 1863968/1863993 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 57102 event pairs, 1404 based on Foata normal form. 15/9453 useless extension candidates. Maximal degree in co-relation 109376. Up to 8128 conditions per place. [2024-06-21 18:31:15,045 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 506 selfloop transitions, 345 changer transitions 0/882 dead transitions. [2024-06-21 18:31:15,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 882 transitions, 16757 flow [2024-06-21 18:31:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 18:31:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 18:31:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2024-06-21 18:31:15,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.461038961038961 [2024-06-21 18:31:15,047 INFO L175 Difference]: Start difference. First operand has 446 places, 832 transitions, 14532 flow. Second operand 11 states and 213 transitions. [2024-06-21 18:31:15,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 882 transitions, 16757 flow [2024-06-21 18:31:22,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 882 transitions, 16214 flow, removed 94 selfloop flow, removed 4 redundant places. [2024-06-21 18:31:22,086 INFO L231 Difference]: Finished difference. Result has 454 places, 835 transitions, 14849 flow [2024-06-21 18:31:22,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14005, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=832, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=342, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14849, PETRI_PLACES=454, PETRI_TRANSITIONS=835} [2024-06-21 18:31:22,087 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 411 predicate places. [2024-06-21 18:31:22,087 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 835 transitions, 14849 flow [2024-06-21 18:31:22,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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-21 18:31:22,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:31:22,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:31:22,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-21 18:31:22,087 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:31:22,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:31:22,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1398416021, now seen corresponding path program 5 times [2024-06-21 18:31:22,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:31:22,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676567844] [2024-06-21 18:31:22,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:31:22,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:31:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:31:24,440 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-21 18:31:24,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:31:24,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676567844] [2024-06-21 18:31:24,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676567844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:31:24,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:31:24,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-21 18:31:24,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303485557] [2024-06-21 18:31:24,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:31:24,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 18:31:24,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:31:24,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 18:31:24,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-21 18:31:24,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:31:24,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 835 transitions, 14849 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 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-21 18:31:24,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:31:24,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:31:24,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:31:28,593 INFO L124 PetriNetUnfolderBase]: 6203/9532 cut-off events. [2024-06-21 18:31:28,593 INFO L125 PetriNetUnfolderBase]: For 1937432/1937458 co-relation queries the response was YES. [2024-06-21 18:31:28,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111186 conditions, 9532 events. 6203/9532 cut-off events. For 1937432/1937458 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 57673 event pairs, 1380 based on Foata normal form. 15/9516 useless extension candidates. Maximal degree in co-relation 110963. Up to 8052 conditions per place. [2024-06-21 18:31:28,757 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 489 selfloop transitions, 370 changer transitions 0/890 dead transitions. [2024-06-21 18:31:28,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 890 transitions, 17595 flow [2024-06-21 18:31:28,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 18:31:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 18:31:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-21 18:31:28,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4588744588744589 [2024-06-21 18:31:28,759 INFO L175 Difference]: Start difference. First operand has 454 places, 835 transitions, 14849 flow. Second operand 11 states and 212 transitions. [2024-06-21 18:31:28,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 890 transitions, 17595 flow [2024-06-21 18:31:37,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 890 transitions, 16793 flow, removed 65 selfloop flow, removed 8 redundant places. [2024-06-21 18:31:37,667 INFO L231 Difference]: Finished difference. Result has 457 places, 839 transitions, 15043 flow [2024-06-21 18:31:37,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14047, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=368, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15043, PETRI_PLACES=457, PETRI_TRANSITIONS=839} [2024-06-21 18:31:37,668 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 414 predicate places. [2024-06-21 18:31:37,668 INFO L495 AbstractCegarLoop]: Abstraction has has 457 places, 839 transitions, 15043 flow [2024-06-21 18:31:37,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 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-21 18:31:37,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:31:37,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:31:37,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-21 18:31:37,668 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:31:37,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:31:37,669 INFO L85 PathProgramCache]: Analyzing trace with hash 162663015, now seen corresponding path program 6 times [2024-06-21 18:31:37,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:31:37,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422757765] [2024-06-21 18:31:37,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:31:37,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:31:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:31:40,554 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-21 18:31:40,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:31:40,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422757765] [2024-06-21 18:31:40,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422757765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:31:40,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:31:40,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-21 18:31:40,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652584806] [2024-06-21 18:31:40,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:31:40,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-21 18:31:40,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:31:40,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-21 18:31:40,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-21 18:31:40,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:31:40,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 839 transitions, 15043 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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-21 18:31:40,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:31:40,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:31:40,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:31:45,240 INFO L124 PetriNetUnfolderBase]: 6187/9513 cut-off events. [2024-06-21 18:31:45,241 INFO L125 PetriNetUnfolderBase]: For 1935644/1935670 co-relation queries the response was YES. [2024-06-21 18:31:45,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110674 conditions, 9513 events. 6187/9513 cut-off events. For 1935644/1935670 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 57498 event pairs, 1387 based on Foata normal form. 15/9507 useless extension candidates. Maximal degree in co-relation 110450. Up to 8182 conditions per place. [2024-06-21 18:31:45,431 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 505 selfloop transitions, 351 changer transitions 0/887 dead transitions. [2024-06-21 18:31:45,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 887 transitions, 17133 flow [2024-06-21 18:31:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 18:31:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 18:31:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-21 18:31:45,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4588744588744589 [2024-06-21 18:31:45,432 INFO L175 Difference]: Start difference. First operand has 457 places, 839 transitions, 15043 flow. Second operand 11 states and 212 transitions. [2024-06-21 18:31:45,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 887 transitions, 17133 flow [2024-06-21 18:31:53,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 887 transitions, 16501 flow, removed 116 selfloop flow, removed 7 redundant places. [2024-06-21 18:31:53,628 INFO L231 Difference]: Finished difference. Result has 461 places, 839 transitions, 15120 flow [2024-06-21 18:31:53,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14411, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=839, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=351, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15120, PETRI_PLACES=461, PETRI_TRANSITIONS=839} [2024-06-21 18:31:53,629 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 418 predicate places. [2024-06-21 18:31:53,629 INFO L495 AbstractCegarLoop]: Abstraction has has 461 places, 839 transitions, 15120 flow [2024-06-21 18:31:53,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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-21 18:31:53,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:31:53,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:31:53,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-21 18:31:53,629 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:31:53,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:31:53,629 INFO L85 PathProgramCache]: Analyzing trace with hash 823341767, now seen corresponding path program 2 times [2024-06-21 18:31:53,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:31:53,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369831007] [2024-06-21 18:31:53,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:31:53,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:31:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:31:55,639 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-21 18:31:55,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:31:55,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369831007] [2024-06-21 18:31:55,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369831007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:31:55,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:31:55,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:31:55,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922230322] [2024-06-21 18:31:55,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:31:55,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:31:55,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:31:55,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:31:55,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:31:55,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-21 18:31:55,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 839 transitions, 15120 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:31:55,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:31:55,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-21 18:31:55,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:31:59,583 INFO L124 PetriNetUnfolderBase]: 6267/9588 cut-off events. [2024-06-21 18:31:59,583 INFO L125 PetriNetUnfolderBase]: For 1896097/1896103 co-relation queries the response was YES. [2024-06-21 18:31:59,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110946 conditions, 9588 events. 6267/9588 cut-off events. For 1896097/1896103 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 57476 event pairs, 1804 based on Foata normal form. 5/9591 useless extension candidates. Maximal degree in co-relation 110720. Up to 9379 conditions per place. [2024-06-21 18:31:59,773 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 797 selfloop transitions, 59 changer transitions 0/859 dead transitions. [2024-06-21 18:31:59,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 859 transitions, 17372 flow [2024-06-21 18:31:59,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:31:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:31:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-21 18:31:59,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-21 18:31:59,775 INFO L175 Difference]: Start difference. First operand has 461 places, 839 transitions, 15120 flow. Second operand 8 states and 138 transitions. [2024-06-21 18:31:59,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 859 transitions, 17372 flow [2024-06-21 18:32:07,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 859 transitions, 16635 flow, removed 31 selfloop flow, removed 10 redundant places. [2024-06-21 18:32:07,813 INFO L231 Difference]: Finished difference. Result has 459 places, 839 transitions, 14508 flow [2024-06-21 18:32:07,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14383, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=839, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=780, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=14508, PETRI_PLACES=459, PETRI_TRANSITIONS=839} [2024-06-21 18:32:07,814 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 416 predicate places. [2024-06-21 18:32:07,814 INFO L495 AbstractCegarLoop]: Abstraction has has 459 places, 839 transitions, 14508 flow [2024-06-21 18:32:07,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:32:07,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:32:07,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:32:07,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-21 18:32:07,814 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:32:07,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:32:07,815 INFO L85 PathProgramCache]: Analyzing trace with hash 823350695, now seen corresponding path program 1 times [2024-06-21 18:32:07,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:32:07,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113205586] [2024-06-21 18:32:07,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:32:07,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:32:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:32:10,382 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-21 18:32:10,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:32:10,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113205586] [2024-06-21 18:32:10,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113205586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:32:10,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:32:10,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:32:10,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524086369] [2024-06-21 18:32:10,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:32:10,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:32:10,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:32:10,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:32:10,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:32:10,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:32:10,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 839 transitions, 14508 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-21 18:32:10,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:32:10,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:32:10,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:32:14,060 INFO L124 PetriNetUnfolderBase]: 5844/9140 cut-off events. [2024-06-21 18:32:14,060 INFO L125 PetriNetUnfolderBase]: For 1947447/1947493 co-relation queries the response was YES. [2024-06-21 18:32:14,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106630 conditions, 9140 events. 5844/9140 cut-off events. For 1947447/1947493 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 56795 event pairs, 1404 based on Foata normal form. 37/9117 useless extension candidates. Maximal degree in co-relation 106404. Up to 8392 conditions per place. [2024-06-21 18:32:14,442 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 655 selfloop transitions, 99 changer transitions 0/866 dead transitions. [2024-06-21 18:32:14,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 866 transitions, 16447 flow [2024-06-21 18:32:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:32:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:32:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-21 18:32:14,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417989417989418 [2024-06-21 18:32:14,445 INFO L175 Difference]: Start difference. First operand has 459 places, 839 transitions, 14508 flow. Second operand 9 states and 167 transitions. [2024-06-21 18:32:14,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 866 transitions, 16447 flow [2024-06-21 18:32:22,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 866 transitions, 16313 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-21 18:32:22,507 INFO L231 Difference]: Finished difference. Result has 463 places, 844 transitions, 14680 flow [2024-06-21 18:32:22,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14374, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=839, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=745, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14680, PETRI_PLACES=463, PETRI_TRANSITIONS=844} [2024-06-21 18:32:22,508 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 420 predicate places. [2024-06-21 18:32:22,508 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 844 transitions, 14680 flow [2024-06-21 18:32:22,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-21 18:32:22,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:32:22,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:32:22,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-21 18:32:22,508 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:32:22,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:32:22,509 INFO L85 PathProgramCache]: Analyzing trace with hash 823337799, now seen corresponding path program 4 times [2024-06-21 18:32:22,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:32:22,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020308733] [2024-06-21 18:32:22,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:32:22,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:32:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:32:24,867 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-21 18:32:24,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:32:24,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020308733] [2024-06-21 18:32:24,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020308733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:32:24,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:32:24,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:32:24,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827281998] [2024-06-21 18:32:24,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:32:24,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:32:24,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:32:24,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:32:24,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:32:24,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-21 18:32:24,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 844 transitions, 14680 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-21 18:32:24,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:32:24,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-21 18:32:24,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:32:28,452 INFO L124 PetriNetUnfolderBase]: 6076/9388 cut-off events. [2024-06-21 18:32:28,452 INFO L125 PetriNetUnfolderBase]: For 1955741/1955763 co-relation queries the response was YES. [2024-06-21 18:32:28,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109223 conditions, 9388 events. 6076/9388 cut-off events. For 1955741/1955763 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 57242 event pairs, 1435 based on Foata normal form. 14/9360 useless extension candidates. Maximal degree in co-relation 108996. Up to 8956 conditions per place. [2024-06-21 18:32:28,785 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 736 selfloop transitions, 73 changer transitions 0/863 dead transitions. [2024-06-21 18:32:28,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 863 transitions, 16468 flow [2024-06-21 18:32:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:32:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:32:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-21 18:32:28,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43154761904761907 [2024-06-21 18:32:28,786 INFO L175 Difference]: Start difference. First operand has 463 places, 844 transitions, 14680 flow. Second operand 8 states and 145 transitions. [2024-06-21 18:32:28,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 863 transitions, 16468 flow [2024-06-21 18:32:37,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 863 transitions, 16241 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-21 18:32:37,358 INFO L231 Difference]: Finished difference. Result has 466 places, 848 transitions, 14727 flow [2024-06-21 18:32:37,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14453, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=771, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=14727, PETRI_PLACES=466, PETRI_TRANSITIONS=848} [2024-06-21 18:32:37,358 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 423 predicate places. [2024-06-21 18:32:37,358 INFO L495 AbstractCegarLoop]: Abstraction has has 466 places, 848 transitions, 14727 flow [2024-06-21 18:32:37,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-21 18:32:37,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:32:37,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:32:37,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-21 18:32:37,359 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:32:37,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:32:37,359 INFO L85 PathProgramCache]: Analyzing trace with hash 644229595, now seen corresponding path program 7 times [2024-06-21 18:32:37,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:32:37,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212372654] [2024-06-21 18:32:37,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:32:37,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:32:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:32:39,838 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-21 18:32:39,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:32:39,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212372654] [2024-06-21 18:32:39,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212372654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:32:39,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:32:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-21 18:32:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492019763] [2024-06-21 18:32:39,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:32:39,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-21 18:32:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:32:39,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-21 18:32:39,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-21 18:32:40,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-21 18:32:40,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 848 transitions, 14727 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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-21 18:32:40,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:32:40,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-21 18:32:40,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:32:44,055 INFO L124 PetriNetUnfolderBase]: 6265/9641 cut-off events. [2024-06-21 18:32:44,055 INFO L125 PetriNetUnfolderBase]: For 2062105/2062113 co-relation queries the response was YES. [2024-06-21 18:32:44,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112193 conditions, 9641 events. 6265/9641 cut-off events. For 2062105/2062113 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 58595 event pairs, 2234 based on Foata normal form. 4/9609 useless extension candidates. Maximal degree in co-relation 111964. Up to 9213 conditions per place. [2024-06-21 18:32:44,352 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 783 selfloop transitions, 74 changer transitions 0/889 dead transitions. [2024-06-21 18:32:44,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 889 transitions, 16868 flow [2024-06-21 18:32:44,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-21 18:32:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-21 18:32:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-21 18:32:44,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2024-06-21 18:32:44,354 INFO L175 Difference]: Start difference. First operand has 466 places, 848 transitions, 14727 flow. Second operand 10 states and 176 transitions. [2024-06-21 18:32:44,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 889 transitions, 16868 flow [2024-06-21 18:32:52,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 889 transitions, 16723 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-21 18:32:52,758 INFO L231 Difference]: Finished difference. Result has 473 places, 860 transitions, 15069 flow [2024-06-21 18:32:52,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14582, PETRI_DIFFERENCE_MINUEND_PLACES=462, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=848, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=774, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15069, PETRI_PLACES=473, PETRI_TRANSITIONS=860} [2024-06-21 18:32:52,759 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 430 predicate places. [2024-06-21 18:32:52,759 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 860 transitions, 15069 flow [2024-06-21 18:32:52,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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-21 18:32:52,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:32:52,759 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-21 18:32:52,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-21 18:32:52,759 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:32:52,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:32:52,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1968725900, now seen corresponding path program 1 times [2024-06-21 18:32:52,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:32:52,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772415365] [2024-06-21 18:32:52,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:32:52,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:32:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:32:55,099 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-21 18:32:55,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:32:55,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772415365] [2024-06-21 18:32:55,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772415365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:32:55,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:32:55,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:32:55,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744307923] [2024-06-21 18:32:55,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:32:55,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:32:55,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:32:55,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:32:55,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:32:55,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-21 18:32:55,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 860 transitions, 15069 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-21 18:32:55,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:32:55,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-21 18:32:55,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:32:59,188 INFO L124 PetriNetUnfolderBase]: 6358/9723 cut-off events. [2024-06-21 18:32:59,188 INFO L125 PetriNetUnfolderBase]: For 2026667/2026673 co-relation queries the response was YES. [2024-06-21 18:32:59,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112656 conditions, 9723 events. 6358/9723 cut-off events. For 2026667/2026673 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 58387 event pairs, 1817 based on Foata normal form. 5/9726 useless extension candidates. Maximal degree in co-relation 112425. Up to 9455 conditions per place. [2024-06-21 18:32:59,386 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 823 selfloop transitions, 79 changer transitions 0/905 dead transitions. [2024-06-21 18:32:59,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 905 transitions, 18008 flow [2024-06-21 18:32:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 18:32:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 18:32:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-21 18:32:59,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-21 18:32:59,387 INFO L175 Difference]: Start difference. First operand has 473 places, 860 transitions, 15069 flow. Second operand 9 states and 154 transitions. [2024-06-21 18:32:59,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 905 transitions, 18008 flow [2024-06-21 18:33:08,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 905 transitions, 17702 flow, removed 61 selfloop flow, removed 8 redundant places. [2024-06-21 18:33:08,453 INFO L231 Difference]: Finished difference. Result has 477 places, 883 transitions, 15369 flow [2024-06-21 18:33:08,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14763, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=789, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15369, PETRI_PLACES=477, PETRI_TRANSITIONS=883} [2024-06-21 18:33:08,453 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 434 predicate places. [2024-06-21 18:33:08,453 INFO L495 AbstractCegarLoop]: Abstraction has has 477 places, 883 transitions, 15369 flow [2024-06-21 18:33:08,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-21 18:33:08,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:33:08,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:33:08,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-21 18:33:08,454 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-21 18:33:08,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:33:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1796647993, now seen corresponding path program 3 times [2024-06-21 18:33:08,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:33:08,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064560380] [2024-06-21 18:33:08,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:33:08,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:33:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:33:10,113 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-21 18:33:10,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:33:10,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064560380] [2024-06-21 18:33:10,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064560380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:33:10,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:33:10,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:33:10,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407227645] [2024-06-21 18:33:10,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:33:10,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:33:10,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:33:10,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:33:10,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:33:10,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-21 18:33:10,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 883 transitions, 15369 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-21 18:33:10,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:33:10,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-21 18:33:10,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:33:13,856 INFO L124 PetriNetUnfolderBase]: 6386/9786 cut-off events. [2024-06-21 18:33:13,856 INFO L125 PetriNetUnfolderBase]: For 2070869/2070872 co-relation queries the response was YES. [2024-06-21 18:33:14,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113538 conditions, 9786 events. 6386/9786 cut-off events. For 2070869/2070872 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 59098 event pairs, 2341 based on Foata normal form. 4/9788 useless extension candidates. Maximal degree in co-relation 113303. Up to 9573 conditions per place. [2024-06-21 18:33:14,053 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 851 selfloop transitions, 62 changer transitions 0/916 dead transitions. [2024-06-21 18:33:14,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 916 transitions, 18007 flow [2024-06-21 18:33:14,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:33:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:33:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-21 18:33:14,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2024-06-21 18:33:14,054 INFO L175 Difference]: Start difference. First operand has 477 places, 883 transitions, 15369 flow. Second operand 7 states and 123 transitions. [2024-06-21 18:33:14,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 916 transitions, 18007 flow Killed by 15