./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix009.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix009.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 76401ed0 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/mix009.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix009.opt.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-76401ed-m [2024-06-20 18:25:20,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 18:25:21,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 18:25:21,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 18:25:21,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 18:25:21,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 18:25:21,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 18:25:21,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 18:25:21,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 18:25:21,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 18:25:21,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 18:25:21,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 18:25:21,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 18:25:21,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 18:25:21,100 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 18:25:21,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 18:25:21,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 18:25:21,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 18:25:21,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 18:25:21,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 18:25:21,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 18:25:21,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 18:25:21,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 18:25:21,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 18:25:21,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 18:25:21,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 18:25:21,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 18:25:21,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 18:25:21,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 18:25:21,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 18:25:21,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 18:25:21,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 18:25:21,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:25:21,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 18:25:21,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 18:25:21,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 18:25:21,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 18:25:21,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 18:25:21,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 18:25:21,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 18:25:21,117 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 18:25:21,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 18:25:21,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 18:25:21,118 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-20 18:25:21,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 18:25:21,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 18:25:21,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 18:25:21,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 18:25:21,537 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 18:25:21,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009.opt.i [2024-06-20 18:25:23,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 18:25:23,580 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 18:25:23,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.opt.i [2024-06-20 18:25:23,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdd239ebf/43bf66b3a2844710bb52e6907303a7b3/FLAG9f4475002 [2024-06-20 18:25:23,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdd239ebf/43bf66b3a2844710bb52e6907303a7b3 [2024-06-20 18:25:23,658 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 18:25:23,659 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 18:25:23,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix009.opt.yml/witness.yml [2024-06-20 18:25:23,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 18:25:23,886 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 18:25:23,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 18:25:23,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 18:25:23,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 18:25:23,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:25:23" (1/2) ... [2024-06-20 18:25:23,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3edb96a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:25:23, skipping insertion in model container [2024-06-20 18:25:23,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:25:23" (1/2) ... [2024-06-20 18:25:23,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@461ded8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:25:23, skipping insertion in model container [2024-06-20 18:25:23,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:25:23" (2/2) ... [2024-06-20 18:25:23,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3edb96a6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:25:23, skipping insertion in model container [2024-06-20 18:25:23,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:25:23" (2/2) ... [2024-06-20 18:25:23,901 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 18:25:24,046 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 18:25:24,047 INFO L97 edCorrectnessWitness]: Location invariant before [L835-L835] ((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )x) - (long long )z >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-20 18:25:24,048 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] ((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )x) - (long long )z >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-20 18:25:24,048 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 18:25:24,049 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-20 18:25:24,116 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 18:25:24,716 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:25:24,725 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 18:25:25,154 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:25:25,211 INFO L206 MainTranslator]: Completed translation [2024-06-20 18:25:25,215 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:25:25 WrapperNode [2024-06-20 18:25:25,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 18:25:25,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 18:25:25,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 18:25:25,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 18:25:25,221 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 20.06 06:25:25" (1/1) ... [2024-06-20 18:25:25,285 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 20.06 06:25:25" (1/1) ... [2024-06-20 18:25:25,481 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-06-20 18:25:25,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 18:25:25,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 18:25:25,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 18:25:25,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 18:25:25,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:25:25" (1/1) ... [2024-06-20 18:25:25,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:25:25" (1/1) ... [2024-06-20 18:25:25,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:25:25" (1/1) ... [2024-06-20 18:25:25,618 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-20 18:25:25,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:25:25" (1/1) ... [2024-06-20 18:25:25,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:25:25" (1/1) ... [2024-06-20 18:25:25,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:25:25" (1/1) ... [2024-06-20 18:25:25,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:25:25" (1/1) ... [2024-06-20 18:25:25,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:25:25" (1/1) ... [2024-06-20 18:25:25,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:25:25" (1/1) ... [2024-06-20 18:25:25,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 18:25:25,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 18:25:25,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 18:25:25,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 18:25:25,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:25:25" (1/1) ... [2024-06-20 18:25:25,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:25:25,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:25:25,750 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-20 18:25:25,798 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-20 18:25:25,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 18:25:25,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 18:25:25,831 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 18:25:25,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 18:25:25,831 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 18:25:25,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 18:25:25,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 18:25:25,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 18:25:25,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 18:25:25,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 18:25:25,833 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 18:25:26,035 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 18:25:26,037 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 18:25:27,462 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 18:25:27,463 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 18:25:27,846 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 18:25:27,847 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 18:25:27,848 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:25:27 BoogieIcfgContainer [2024-06-20 18:25:27,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 18:25:27,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 18:25:27,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 18:25:27,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 18:25:27,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 06:25:23" (1/4) ... [2024-06-20 18:25:27,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c861b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:25:27, skipping insertion in model container [2024-06-20 18:25:27,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:25:23" (2/4) ... [2024-06-20 18:25:27,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c861b64 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:25:27, skipping insertion in model container [2024-06-20 18:25:27,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:25:25" (3/4) ... [2024-06-20 18:25:27,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c861b64 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:25:27, skipping insertion in model container [2024-06-20 18:25:27,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:25:27" (4/4) ... [2024-06-20 18:25:27,864 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.opt.i [2024-06-20 18:25:27,893 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 18:25:27,893 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-20 18:25:27,893 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 18:25:28,039 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 18:25:28,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-20 18:25:28,166 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-20 18:25:28,166 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:25:28,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 18:25:28,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-20 18:25:28,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-20 18:25:28,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 18:25:28,205 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;@aca592d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 18:25:28,206 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-20 18:25:28,229 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 18:25:28,230 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-20 18:25:28,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:25:28,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:25:28,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 18:25:28,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:25:28,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:25:28,238 INFO L85 PathProgramCache]: Analyzing trace with hash 364831899, now seen corresponding path program 1 times [2024-06-20 18:25:28,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:25:28,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403436338] [2024-06-20 18:25:28,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:25:28,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:25:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:25:37,741 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-20 18:25:37,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:25:37,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403436338] [2024-06-20 18:25:37,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403436338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:25:37,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:25:37,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 18:25:37,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997911124] [2024-06-20 18:25:37,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:25:37,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 18:25:37,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:25:37,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 18:25:37,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 18:25:37,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-06-20 18:25:37,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:37,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:25:37,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-06-20 18:25:37,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:25:38,360 INFO L124 PetriNetUnfolderBase]: 162/316 cut-off events. [2024-06-20 18:25:38,376 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-20 18:25:38,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 316 events. 162/316 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1286 event pairs, 97 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 616. Up to 288 conditions per place. [2024-06-20 18:25:38,382 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 21 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-20 18:25:38,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 117 flow [2024-06-20 18:25:38,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 18:25:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 18:25:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-06-20 18:25:38,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2024-06-20 18:25:38,392 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 59 transitions. [2024-06-20 18:25:38,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 117 flow [2024-06-20 18:25:38,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-20 18:25:38,406 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-20 18:25:38,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-20 18:25:38,410 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-20 18:25:38,410 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-20 18:25:38,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:38,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:25:38,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:25:38,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 18:25:38,412 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:25:38,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:25:38,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1583835590, now seen corresponding path program 1 times [2024-06-20 18:25:38,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:25:38,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545423557] [2024-06-20 18:25:38,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:25:38,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:25:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:25:45,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-20 18:25:45,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:25:45,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545423557] [2024-06-20 18:25:45,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545423557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:25:45,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:25:45,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 18:25:45,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542465252] [2024-06-20 18:25:45,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:25:45,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 18:25:45,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:25:45,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 18:25:45,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 18:25:45,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-20 18:25:45,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:45,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:25:45,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-20 18:25:45,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:25:46,160 INFO L124 PetriNetUnfolderBase]: 186/346 cut-off events. [2024-06-20 18:25:46,161 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-06-20 18:25:46,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 346 events. 186/346 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1381 event pairs, 94 based on Foata normal form. 2/345 useless extension candidates. Maximal degree in co-relation 776. Up to 319 conditions per place. [2024-06-20 18:25:46,166 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 26 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-20 18:25:46,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 161 flow [2024-06-20 18:25:46,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 18:25:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 18:25:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2024-06-20 18:25:46,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5703125 [2024-06-20 18:25:46,169 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 73 transitions. [2024-06-20 18:25:46,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 161 flow [2024-06-20 18:25:46,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 18:25:46,173 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-20 18:25:46,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-20 18:25:46,174 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-20 18:25:46,175 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-20 18:25:46,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:46,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:25:46,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:25:46,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 18:25:46,176 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:25:46,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:25:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1854262106, now seen corresponding path program 1 times [2024-06-20 18:25:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:25:46,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645748945] [2024-06-20 18:25:46,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:25:46,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:25:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:25:52,542 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-20 18:25:52,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:25:52,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645748945] [2024-06-20 18:25:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645748945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:25:52,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:25:52,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 18:25:52,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717296710] [2024-06-20 18:25:52,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:25:52,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 18:25:52,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:25:52,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 18:25:52,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-20 18:25:52,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-20 18:25:52,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:52,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:25:52,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-20 18:25:52,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:25:53,146 INFO L124 PetriNetUnfolderBase]: 219/397 cut-off events. [2024-06-20 18:25:53,160 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2024-06-20 18:25:53,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 397 events. 219/397 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1503 event pairs, 99 based on Foata normal form. 2/396 useless extension candidates. Maximal degree in co-relation 989. Up to 366 conditions per place. [2024-06-20 18:25:53,163 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 31 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-20 18:25:53,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 211 flow [2024-06-20 18:25:53,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:25:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:25:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-06-20 18:25:53,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-06-20 18:25:53,167 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 85 transitions. [2024-06-20 18:25:53,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 211 flow [2024-06-20 18:25:53,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-20 18:25:53,169 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-20 18:25:53,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-20 18:25:53,170 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-20 18:25:53,171 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-20 18:25:53,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:53,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:25:53,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:25:53,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 18:25:53,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:25:53,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:25:53,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1592138219, now seen corresponding path program 1 times [2024-06-20 18:25:53,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:25:53,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828009652] [2024-06-20 18:25:53,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:25:53,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:25:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:25:59,592 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-20 18:25:59,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:25:59,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828009652] [2024-06-20 18:25:59,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828009652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:25:59,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:25:59,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:25:59,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523435899] [2024-06-20 18:25:59,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:25:59,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 18:25:59,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:25:59,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 18:25:59,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-20 18:25:59,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-20 18:25:59,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 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-20 18:25:59,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:25:59,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-20 18:25:59,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:00,199 INFO L124 PetriNetUnfolderBase]: 216/392 cut-off events. [2024-06-20 18:26:00,200 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2024-06-20 18:26:00,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 392 events. 216/392 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1498 event pairs, 78 based on Foata normal form. 2/392 useless extension candidates. Maximal degree in co-relation 1067. Up to 352 conditions per place. [2024-06-20 18:26:00,202 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 35 selfloop transitions, 9 changer transitions 0/48 dead transitions. [2024-06-20 18:26:00,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 259 flow [2024-06-20 18:26:00,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:26:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:26:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-20 18:26:00,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-06-20 18:26:00,204 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 6 states and 100 transitions. [2024-06-20 18:26:00,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 259 flow [2024-06-20 18:26:00,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 244 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-20 18:26:00,223 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 145 flow [2024-06-20 18:26:00,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2024-06-20 18:26:00,224 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-20 18:26:00,224 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 145 flow [2024-06-20 18:26:00,224 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-20 18:26:00,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:00,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:00,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 18:26:00,225 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:26:00,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash 465574693, now seen corresponding path program 1 times [2024-06-20 18:26:00,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:00,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067874859] [2024-06-20 18:26:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:00,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:06,826 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-20 18:26:06,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:06,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067874859] [2024-06-20 18:26:06,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067874859] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:06,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:06,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:26:06,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854762926] [2024-06-20 18:26:06,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:06,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:26:06,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:06,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:26:06,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:26:06,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-20 18:26:06,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 145 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:06,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:06,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-20 18:26:06,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:07,497 INFO L124 PetriNetUnfolderBase]: 213/387 cut-off events. [2024-06-20 18:26:07,497 INFO L125 PetriNetUnfolderBase]: For 580/580 co-relation queries the response was YES. [2024-06-20 18:26:07,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 387 events. 213/387 cut-off events. For 580/580 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1451 event pairs, 57 based on Foata normal form. 2/387 useless extension candidates. Maximal degree in co-relation 1135. Up to 338 conditions per place. [2024-06-20 18:26:07,515 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 39 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2024-06-20 18:26:07,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 307 flow [2024-06-20 18:26:07,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:26:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:26:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-20 18:26:07,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133928571428571 [2024-06-20 18:26:07,524 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 145 flow. Second operand 7 states and 115 transitions. [2024-06-20 18:26:07,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 307 flow [2024-06-20 18:26:07,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 286 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-20 18:26:07,530 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 169 flow [2024-06-20 18:26:07,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=169, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-06-20 18:26:07,537 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-20 18:26:07,537 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 169 flow [2024-06-20 18:26:07,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:07,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:07,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:07,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 18:26:07,539 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:26:07,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:07,552 INFO L85 PathProgramCache]: Analyzing trace with hash 22408742, now seen corresponding path program 1 times [2024-06-20 18:26:07,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:07,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552354117] [2024-06-20 18:26:07,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:15,773 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-20 18:26:15,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:15,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552354117] [2024-06-20 18:26:15,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552354117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:15,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:15,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:26:15,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17571674] [2024-06-20 18:26:15,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:15,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 18:26:15,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:15,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 18:26:15,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-20 18:26:15,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-20 18:26:15,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:15,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:15,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-20 18:26:15,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:16,107 INFO L124 PetriNetUnfolderBase]: 165/333 cut-off events. [2024-06-20 18:26:16,107 INFO L125 PetriNetUnfolderBase]: For 675/675 co-relation queries the response was YES. [2024-06-20 18:26:16,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 333 events. 165/333 cut-off events. For 675/675 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1328 event pairs, 46 based on Foata normal form. 1/332 useless extension candidates. Maximal degree in co-relation 1016. Up to 291 conditions per place. [2024-06-20 18:26:16,109 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 29 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2024-06-20 18:26:16,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 257 flow [2024-06-20 18:26:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:26:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:26:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-06-20 18:26:16,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-06-20 18:26:16,110 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 169 flow. Second operand 5 states and 74 transitions. [2024-06-20 18:26:16,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 257 flow [2024-06-20 18:26:16,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 230 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 18:26:16,112 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 169 flow [2024-06-20 18:26:16,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2024-06-20 18:26:16,114 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-20 18:26:16,114 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 169 flow [2024-06-20 18:26:16,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:16,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:16,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:16,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 18:26:16,115 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:26:16,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash 694672028, now seen corresponding path program 1 times [2024-06-20 18:26:16,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:16,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904291421] [2024-06-20 18:26:16,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:16,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:24,085 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-20 18:26:24,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:24,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904291421] [2024-06-20 18:26:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904291421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:24,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:24,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:26:24,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639109546] [2024-06-20 18:26:24,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:24,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:26:24,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:24,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:26:24,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:26:24,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-20 18:26:24,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 169 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-20 18:26:24,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:24,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-20 18:26:24,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:24,476 INFO L124 PetriNetUnfolderBase]: 163/330 cut-off events. [2024-06-20 18:26:24,476 INFO L125 PetriNetUnfolderBase]: For 829/829 co-relation queries the response was YES. [2024-06-20 18:26:24,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 330 events. 163/330 cut-off events. For 829/829 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1293 event pairs, 45 based on Foata normal form. 1/329 useless extension candidates. Maximal degree in co-relation 1045. Up to 285 conditions per place. [2024-06-20 18:26:24,478 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 30 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-20 18:26:24,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 267 flow [2024-06-20 18:26:24,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:26:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:26:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2024-06-20 18:26:24,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2024-06-20 18:26:24,479 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 169 flow. Second operand 6 states and 86 transitions. [2024-06-20 18:26:24,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 267 flow [2024-06-20 18:26:24,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 256 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-20 18:26:24,481 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 191 flow [2024-06-20 18:26:24,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-06-20 18:26:24,482 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2024-06-20 18:26:24,482 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 191 flow [2024-06-20 18:26:24,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-20 18:26:24,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:24,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:24,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 18:26:24,483 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:26:24,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:24,483 INFO L85 PathProgramCache]: Analyzing trace with hash 459579635, now seen corresponding path program 1 times [2024-06-20 18:26:24,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:24,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965278138] [2024-06-20 18:26:24,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:24,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:31,659 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-20 18:26:31,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:31,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965278138] [2024-06-20 18:26:31,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965278138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:31,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:31,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:26:31,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099302653] [2024-06-20 18:26:31,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:31,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:26:31,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:31,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:26:31,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:26:31,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:26:31,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:31,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:31,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:26:31,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:32,082 INFO L124 PetriNetUnfolderBase]: 193/366 cut-off events. [2024-06-20 18:26:32,082 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2024-06-20 18:26:32,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 366 events. 193/366 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1399 event pairs, 53 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 1266. Up to 331 conditions per place. [2024-06-20 18:26:32,084 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 36 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2024-06-20 18:26:32,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 309 flow [2024-06-20 18:26:32,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:26:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:26:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-20 18:26:32,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-20 18:26:32,086 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 191 flow. Second operand 6 states and 84 transitions. [2024-06-20 18:26:32,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 309 flow [2024-06-20 18:26:32,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 292 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 18:26:32,088 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 207 flow [2024-06-20 18:26:32,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-06-20 18:26:32,089 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-06-20 18:26:32,089 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 207 flow [2024-06-20 18:26:32,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:32,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:32,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:32,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 18:26:32,089 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:26:32,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:32,090 INFO L85 PathProgramCache]: Analyzing trace with hash 59987525, now seen corresponding path program 2 times [2024-06-20 18:26:32,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:32,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300665362] [2024-06-20 18:26:32,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:32,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:39,047 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-20 18:26:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:39,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300665362] [2024-06-20 18:26:39,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300665362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:39,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:39,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:26:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310892062] [2024-06-20 18:26:39,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:39,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:26:39,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:39,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:26:39,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:26:39,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:26:39,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 207 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:39,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:39,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:26:39,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:39,512 INFO L124 PetriNetUnfolderBase]: 191/363 cut-off events. [2024-06-20 18:26:39,512 INFO L125 PetriNetUnfolderBase]: For 1476/1476 co-relation queries the response was YES. [2024-06-20 18:26:39,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 363 events. 191/363 cut-off events. For 1476/1476 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1404 event pairs, 53 based on Foata normal form. 1/362 useless extension candidates. Maximal degree in co-relation 1324. Up to 322 conditions per place. [2024-06-20 18:26:39,515 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 35 selfloop transitions, 12 changer transitions 0/52 dead transitions. [2024-06-20 18:26:39,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 337 flow [2024-06-20 18:26:39,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:26:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:26:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-20 18:26:39,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-20 18:26:39,516 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 207 flow. Second operand 7 states and 96 transitions. [2024-06-20 18:26:39,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 337 flow [2024-06-20 18:26:39,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 320 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 18:26:39,519 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 235 flow [2024-06-20 18:26:39,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-06-20 18:26:39,520 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2024-06-20 18:26:39,520 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 235 flow [2024-06-20 18:26:39,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:39,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:39,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:39,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 18:26:39,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:26:39,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:39,521 INFO L85 PathProgramCache]: Analyzing trace with hash 740713892, now seen corresponding path program 1 times [2024-06-20 18:26:39,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:39,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874494043] [2024-06-20 18:26:39,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:39,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:43,796 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-20 18:26:43,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:43,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874494043] [2024-06-20 18:26:43,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874494043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:43,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:43,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:26:43,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009358675] [2024-06-20 18:26:43,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:43,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:26:43,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:43,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:26:43,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:26:43,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:26:43,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 235 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 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-20 18:26:43,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:43,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:26:43,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:44,261 INFO L124 PetriNetUnfolderBase]: 204/372 cut-off events. [2024-06-20 18:26:44,262 INFO L125 PetriNetUnfolderBase]: For 1811/1811 co-relation queries the response was YES. [2024-06-20 18:26:44,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 372 events. 204/372 cut-off events. For 1811/1811 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1361 event pairs, 31 based on Foata normal form. 4/374 useless extension candidates. Maximal degree in co-relation 1409. Up to 305 conditions per place. [2024-06-20 18:26:44,264 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 47 selfloop transitions, 12 changer transitions 0/63 dead transitions. [2024-06-20 18:26:44,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 395 flow [2024-06-20 18:26:44,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:26:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:26:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2024-06-20 18:26:44,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45703125 [2024-06-20 18:26:44,265 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 235 flow. Second operand 8 states and 117 transitions. [2024-06-20 18:26:44,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 395 flow [2024-06-20 18:26:44,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 366 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 18:26:44,267 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 222 flow [2024-06-20 18:26:44,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-06-20 18:26:44,268 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2024-06-20 18:26:44,268 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 222 flow [2024-06-20 18:26:44,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 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-20 18:26:44,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:44,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:44,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 18:26:44,269 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:26:44,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1361888085, now seen corresponding path program 1 times [2024-06-20 18:26:44,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:44,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634597729] [2024-06-20 18:26:44,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:44,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:50,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-20 18:26:50,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:50,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634597729] [2024-06-20 18:26:50,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634597729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:50,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:50,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:26:50,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324103763] [2024-06-20 18:26:50,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:50,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:26:50,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:50,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:26:50,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:26:50,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:26:50,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:50,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:50,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:26:50,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:50,689 INFO L124 PetriNetUnfolderBase]: 207/377 cut-off events. [2024-06-20 18:26:50,689 INFO L125 PetriNetUnfolderBase]: For 2123/2123 co-relation queries the response was YES. [2024-06-20 18:26:50,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 377 events. 207/377 cut-off events. For 2123/2123 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1386 event pairs, 48 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 1476. Up to 343 conditions per place. [2024-06-20 18:26:50,692 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 43 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2024-06-20 18:26:50,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 372 flow [2024-06-20 18:26:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:26:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:26:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-20 18:26:50,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 18:26:50,694 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 222 flow. Second operand 7 states and 91 transitions. [2024-06-20 18:26:50,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 372 flow [2024-06-20 18:26:50,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 56 transitions, 340 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 18:26:50,696 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 231 flow [2024-06-20 18:26:50,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=231, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-06-20 18:26:50,697 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2024-06-20 18:26:50,697 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 231 flow [2024-06-20 18:26:50,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:50,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:50,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:50,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 18:26:50,698 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:26:50,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1623438693, now seen corresponding path program 2 times [2024-06-20 18:26:50,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:50,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12490954] [2024-06-20 18:26:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:50,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:58,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-20 18:26:58,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:58,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12490954] [2024-06-20 18:26:58,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12490954] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:58,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:58,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:26:58,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691919407] [2024-06-20 18:26:58,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:58,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:26:58,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:58,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:26:58,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:26:58,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:26:58,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 231 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:58,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:58,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:26:58,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:58,537 INFO L124 PetriNetUnfolderBase]: 210/382 cut-off events. [2024-06-20 18:26:58,538 INFO L125 PetriNetUnfolderBase]: For 2548/2548 co-relation queries the response was YES. [2024-06-20 18:26:58,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1569 conditions, 382 events. 210/382 cut-off events. For 2548/2548 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1402 event pairs, 48 based on Foata normal form. 1/381 useless extension candidates. Maximal degree in co-relation 1544. Up to 342 conditions per place. [2024-06-20 18:26:58,541 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 39 selfloop transitions, 13 changer transitions 0/55 dead transitions. [2024-06-20 18:26:58,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 375 flow [2024-06-20 18:26:58,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:26:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:26:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-20 18:26:58,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2024-06-20 18:26:58,542 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 231 flow. Second operand 7 states and 90 transitions. [2024-06-20 18:26:58,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 375 flow [2024-06-20 18:26:58,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 350 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 18:26:58,545 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 257 flow [2024-06-20 18:26:58,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=257, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-06-20 18:26:58,546 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2024-06-20 18:26:58,546 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 257 flow [2024-06-20 18:26:58,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:58,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:58,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:58,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 18:26:58,547 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:26:58,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1623438941, now seen corresponding path program 1 times [2024-06-20 18:26:58,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:58,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240531427] [2024-06-20 18:26:58,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:27:08,009 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-20 18:27:08,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:27:08,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240531427] [2024-06-20 18:27:08,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240531427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:27:08,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:27:08,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:27:08,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273801607] [2024-06-20 18:27:08,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:27:08,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:27:08,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:27:08,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:27:08,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:27:08,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:27:08,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 257 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:08,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:27:08,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:27:08,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:27:08,461 INFO L124 PetriNetUnfolderBase]: 200/374 cut-off events. [2024-06-20 18:27:08,462 INFO L125 PetriNetUnfolderBase]: For 2997/2997 co-relation queries the response was YES. [2024-06-20 18:27:08,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1585 conditions, 374 events. 200/374 cut-off events. For 2997/2997 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1406 event pairs, 47 based on Foata normal form. 1/373 useless extension candidates. Maximal degree in co-relation 1559. Up to 328 conditions per place. [2024-06-20 18:27:08,464 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 40 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2024-06-20 18:27:08,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 391 flow [2024-06-20 18:27:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:27:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:27:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2024-06-20 18:27:08,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2024-06-20 18:27:08,465 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 257 flow. Second operand 7 states and 94 transitions. [2024-06-20 18:27:08,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 391 flow [2024-06-20 18:27:08,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 356 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-20 18:27:08,468 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 261 flow [2024-06-20 18:27:08,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2024-06-20 18:27:08,468 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2024-06-20 18:27:08,469 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 261 flow [2024-06-20 18:27:08,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:08,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:27:08,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:27:08,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 18:27:08,469 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:27:08,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:27:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash 137999389, now seen corresponding path program 2 times [2024-06-20 18:27:08,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:27:08,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044932956] [2024-06-20 18:27:08,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:27:08,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:27:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:27:16,411 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-20 18:27:16,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:27:16,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044932956] [2024-06-20 18:27:16,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044932956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:27:16,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:27:16,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:27:16,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788607081] [2024-06-20 18:27:16,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:27:16,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:27:16,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:27:16,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:27:16,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:27:16,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:27:16,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 261 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:16,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:27:16,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:27:16,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:27:16,776 INFO L124 PetriNetUnfolderBase]: 203/380 cut-off events. [2024-06-20 18:27:16,777 INFO L125 PetriNetUnfolderBase]: For 3452/3455 co-relation queries the response was YES. [2024-06-20 18:27:16,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 380 events. 203/380 cut-off events. For 3452/3455 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1432 event pairs, 51 based on Foata normal form. 3/380 useless extension candidates. Maximal degree in co-relation 1641. Up to 317 conditions per place. [2024-06-20 18:27:16,779 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 17 changer transitions 0/60 dead transitions. [2024-06-20 18:27:16,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 443 flow [2024-06-20 18:27:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:27:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:27:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-20 18:27:16,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42410714285714285 [2024-06-20 18:27:16,780 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 261 flow. Second operand 7 states and 95 transitions. [2024-06-20 18:27:16,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 443 flow [2024-06-20 18:27:16,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 60 transitions, 420 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-20 18:27:16,783 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 323 flow [2024-06-20 18:27:16,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=323, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-06-20 18:27:16,784 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2024-06-20 18:27:16,784 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 323 flow [2024-06-20 18:27:16,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:16,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:27:16,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:27:16,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 18:27:16,785 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:27:16,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:27:16,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1859614301, now seen corresponding path program 3 times [2024-06-20 18:27:16,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:27:16,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7995282] [2024-06-20 18:27:16,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:27:16,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:27:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:27:25,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-20 18:27:25,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:27:25,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7995282] [2024-06-20 18:27:25,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7995282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:27:25,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:27:25,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:27:25,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503442041] [2024-06-20 18:27:25,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:27:25,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:27:25,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:27:25,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:27:25,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:27:25,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:27:25,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 323 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:25,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:27:25,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:27:25,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:27:25,894 INFO L124 PetriNetUnfolderBase]: 201/377 cut-off events. [2024-06-20 18:27:25,894 INFO L125 PetriNetUnfolderBase]: For 3911/3914 co-relation queries the response was YES. [2024-06-20 18:27:25,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1737 conditions, 377 events. 201/377 cut-off events. For 3911/3914 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1425 event pairs, 51 based on Foata normal form. 3/377 useless extension candidates. Maximal degree in co-relation 1708. Up to 324 conditions per place. [2024-06-20 18:27:25,897 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 40 selfloop transitions, 13 changer transitions 0/60 dead transitions. [2024-06-20 18:27:25,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 452 flow [2024-06-20 18:27:25,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:27:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:27:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-20 18:27:25,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41517857142857145 [2024-06-20 18:27:25,898 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 323 flow. Second operand 7 states and 93 transitions. [2024-06-20 18:27:25,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 452 flow [2024-06-20 18:27:25,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 423 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-20 18:27:25,901 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 334 flow [2024-06-20 18:27:25,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=334, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2024-06-20 18:27:25,902 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-20 18:27:25,902 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 334 flow [2024-06-20 18:27:25,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:25,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:27:25,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:27:25,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 18:27:25,903 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:27:25,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:27:25,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1859614053, now seen corresponding path program 3 times [2024-06-20 18:27:25,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:27:25,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733023215] [2024-06-20 18:27:25,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:27:25,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:27:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:27:33,174 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-20 18:27:33,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:27:33,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733023215] [2024-06-20 18:27:33,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733023215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:27:33,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:27:33,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:27:33,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457843769] [2024-06-20 18:27:33,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:27:33,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:27:33,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:27:33,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:27:33,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:27:33,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:27:33,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 334 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:33,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:27:33,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:27:33,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:27:33,598 INFO L124 PetriNetUnfolderBase]: 212/386 cut-off events. [2024-06-20 18:27:33,599 INFO L125 PetriNetUnfolderBase]: For 4333/4333 co-relation queries the response was YES. [2024-06-20 18:27:33,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1830 conditions, 386 events. 212/386 cut-off events. For 4333/4333 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1405 event pairs, 47 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 1799. Up to 337 conditions per place. [2024-06-20 18:27:33,602 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 45 selfloop transitions, 18 changer transitions 0/66 dead transitions. [2024-06-20 18:27:33,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 506 flow [2024-06-20 18:27:33,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:27:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:27:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-20 18:27:33,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-20 18:27:33,604 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 334 flow. Second operand 8 states and 101 transitions. [2024-06-20 18:27:33,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 506 flow [2024-06-20 18:27:33,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 479 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-20 18:27:33,609 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 372 flow [2024-06-20 18:27:33,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2024-06-20 18:27:33,609 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2024-06-20 18:27:33,610 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 372 flow [2024-06-20 18:27:33,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:33,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:27:33,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:27:33,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 18:27:33,613 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:27:33,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:27:33,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1859921883, now seen corresponding path program 1 times [2024-06-20 18:27:33,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:27:33,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115270348] [2024-06-20 18:27:33,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:27:33,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:27:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:27:43,002 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-20 18:27:43,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:27:43,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115270348] [2024-06-20 18:27:43,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115270348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:27:43,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:27:43,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:27:43,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474439661] [2024-06-20 18:27:43,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:27:43,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:27:43,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:27:43,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:27:43,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:27:43,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:27:43,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 372 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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-20 18:27:43,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:27:43,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:27:43,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:27:43,446 INFO L124 PetriNetUnfolderBase]: 196/369 cut-off events. [2024-06-20 18:27:43,447 INFO L125 PetriNetUnfolderBase]: For 4746/4746 co-relation queries the response was YES. [2024-06-20 18:27:43,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 369 events. 196/369 cut-off events. For 4746/4746 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1390 event pairs, 46 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 1766. Up to 328 conditions per place. [2024-06-20 18:27:43,449 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 45 selfloop transitions, 11 changer transitions 0/64 dead transitions. [2024-06-20 18:27:43,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 64 transitions, 510 flow [2024-06-20 18:27:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:27:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:27:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-20 18:27:43,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-20 18:27:43,450 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 372 flow. Second operand 7 states and 92 transitions. [2024-06-20 18:27:43,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 64 transitions, 510 flow [2024-06-20 18:27:43,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 461 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 18:27:43,454 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 365 flow [2024-06-20 18:27:43,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=365, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2024-06-20 18:27:43,455 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2024-06-20 18:27:43,455 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 365 flow [2024-06-20 18:27:43,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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-20 18:27:43,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:27:43,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:27:43,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 18:27:43,456 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:27:43,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:27:43,456 INFO L85 PathProgramCache]: Analyzing trace with hash -731147096, now seen corresponding path program 1 times [2024-06-20 18:27:43,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:27:43,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803133261] [2024-06-20 18:27:43,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:27:43,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:27:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:27:50,896 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-20 18:27:50,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:27:50,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803133261] [2024-06-20 18:27:50,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803133261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:27:50,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:27:50,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:27:50,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33257338] [2024-06-20 18:27:50,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:27:50,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:27:50,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:27:50,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:27:50,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:27:51,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:27:51,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 365 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:51,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:27:51,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:27:51,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:27:51,389 INFO L124 PetriNetUnfolderBase]: 216/395 cut-off events. [2024-06-20 18:27:51,389 INFO L125 PetriNetUnfolderBase]: For 5481/5481 co-relation queries the response was YES. [2024-06-20 18:27:51,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1969 conditions, 395 events. 216/395 cut-off events. For 5481/5481 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1474 event pairs, 45 based on Foata normal form. 2/395 useless extension candidates. Maximal degree in co-relation 1936. Up to 347 conditions per place. [2024-06-20 18:27:51,392 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 62 selfloop transitions, 12 changer transitions 0/77 dead transitions. [2024-06-20 18:27:51,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 77 transitions, 577 flow [2024-06-20 18:27:51,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:27:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:27:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-20 18:27:51,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-20 18:27:51,394 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 365 flow. Second operand 8 states and 105 transitions. [2024-06-20 18:27:51,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 77 transitions, 577 flow [2024-06-20 18:27:51,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 77 transitions, 534 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 18:27:51,398 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 373 flow [2024-06-20 18:27:51,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=373, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2024-06-20 18:27:51,398 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2024-06-20 18:27:51,399 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 373 flow [2024-06-20 18:27:51,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:51,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:27:51,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:27:51,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 18:27:51,399 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:27:51,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:27:51,400 INFO L85 PathProgramCache]: Analyzing trace with hash -731141299, now seen corresponding path program 1 times [2024-06-20 18:27:51,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:27:51,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476270699] [2024-06-20 18:27:51,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:27:51,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:27:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:27:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:27:59,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:27:59,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476270699] [2024-06-20 18:27:59,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476270699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:27:59,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:27:59,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:27:59,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844233112] [2024-06-20 18:27:59,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:27:59,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:27:59,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:27:59,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:27:59,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:27:59,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:27:59,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 59 transitions, 373 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:59,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:27:59,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:27:59,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:27:59,672 INFO L124 PetriNetUnfolderBase]: 219/400 cut-off events. [2024-06-20 18:27:59,673 INFO L125 PetriNetUnfolderBase]: For 5976/5976 co-relation queries the response was YES. [2024-06-20 18:27:59,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2051 conditions, 400 events. 219/400 cut-off events. For 5976/5976 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1497 event pairs, 44 based on Foata normal form. 1/399 useless extension candidates. Maximal degree in co-relation 2018. Up to 361 conditions per place. [2024-06-20 18:27:59,675 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 60 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2024-06-20 18:27:59,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 75 transitions, 567 flow [2024-06-20 18:27:59,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:27:59,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:27:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-20 18:27:59,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-20 18:27:59,677 INFO L175 Difference]: Start difference. First operand has 72 places, 59 transitions, 373 flow. Second operand 8 states and 101 transitions. [2024-06-20 18:27:59,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 75 transitions, 567 flow [2024-06-20 18:27:59,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 75 transitions, 532 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 18:27:59,681 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 387 flow [2024-06-20 18:27:59,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=387, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2024-06-20 18:27:59,682 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 43 predicate places. [2024-06-20 18:27:59,682 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 387 flow [2024-06-20 18:27:59,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:59,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:27:59,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:27:59,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 18:27:59,682 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:27:59,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:27:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash -731141516, now seen corresponding path program 2 times [2024-06-20 18:27:59,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:27:59,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385166777] [2024-06-20 18:27:59,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:27:59,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:27:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:28:06,845 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-20 18:28:06,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:28:06,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385166777] [2024-06-20 18:28:06,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385166777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:28:06,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:28:06,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:28:06,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641906722] [2024-06-20 18:28:06,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:28:06,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:28:06,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:28:06,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:28:06,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:28:06,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:28:06,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 387 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:06,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:28:06,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:28:06,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:28:07,342 INFO L124 PetriNetUnfolderBase]: 225/412 cut-off events. [2024-06-20 18:28:07,343 INFO L125 PetriNetUnfolderBase]: For 6865/6865 co-relation queries the response was YES. [2024-06-20 18:28:07,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2148 conditions, 412 events. 225/412 cut-off events. For 6865/6865 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1565 event pairs, 44 based on Foata normal form. 2/412 useless extension candidates. Maximal degree in co-relation 2114. Up to 353 conditions per place. [2024-06-20 18:28:07,345 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 61 selfloop transitions, 15 changer transitions 0/79 dead transitions. [2024-06-20 18:28:07,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 603 flow [2024-06-20 18:28:07,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:28:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:28:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-20 18:28:07,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-20 18:28:07,347 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 387 flow. Second operand 8 states and 105 transitions. [2024-06-20 18:28:07,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 603 flow [2024-06-20 18:28:07,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 79 transitions, 570 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 18:28:07,351 INFO L231 Difference]: Finished difference. Result has 76 places, 63 transitions, 415 flow [2024-06-20 18:28:07,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=415, PETRI_PLACES=76, PETRI_TRANSITIONS=63} [2024-06-20 18:28:07,351 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2024-06-20 18:28:07,351 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 415 flow [2024-06-20 18:28:07,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:07,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:28:07,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:28:07,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 18:28:07,352 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:28:07,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:28:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash -725577326, now seen corresponding path program 3 times [2024-06-20 18:28:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:28:07,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119549050] [2024-06-20 18:28:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:28:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:28:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:28:14,631 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-20 18:28:14,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:28:14,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119549050] [2024-06-20 18:28:14,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119549050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:28:14,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:28:14,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:28:14,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678561417] [2024-06-20 18:28:14,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:28:14,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:28:14,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:28:14,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:28:14,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:28:14,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:28:14,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 63 transitions, 415 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:14,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:28:14,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:28:14,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:28:15,117 INFO L124 PetriNetUnfolderBase]: 231/424 cut-off events. [2024-06-20 18:28:15,117 INFO L125 PetriNetUnfolderBase]: For 7789/7789 co-relation queries the response was YES. [2024-06-20 18:28:15,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 424 events. 231/424 cut-off events. For 7789/7789 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1642 event pairs, 44 based on Foata normal form. 2/424 useless extension candidates. Maximal degree in co-relation 2247. Up to 351 conditions per place. [2024-06-20 18:28:15,120 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 56 selfloop transitions, 19 changer transitions 0/78 dead transitions. [2024-06-20 18:28:15,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 78 transitions, 625 flow [2024-06-20 18:28:15,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:28:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:28:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-20 18:28:15,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 18:28:15,122 INFO L175 Difference]: Start difference. First operand has 76 places, 63 transitions, 415 flow. Second operand 8 states and 104 transitions. [2024-06-20 18:28:15,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 78 transitions, 625 flow [2024-06-20 18:28:15,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 78 transitions, 580 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-20 18:28:15,126 INFO L231 Difference]: Finished difference. Result has 78 places, 65 transitions, 443 flow [2024-06-20 18:28:15,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=443, PETRI_PLACES=78, PETRI_TRANSITIONS=65} [2024-06-20 18:28:15,127 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 47 predicate places. [2024-06-20 18:28:15,127 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 443 flow [2024-06-20 18:28:15,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:15,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:28:15,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:28:15,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 18:28:15,127 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:28:15,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:28:15,128 INFO L85 PathProgramCache]: Analyzing trace with hash -725577109, now seen corresponding path program 2 times [2024-06-20 18:28:15,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:28:15,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393824142] [2024-06-20 18:28:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:28:15,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:28:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:28:24,385 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-20 18:28:24,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:28:24,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393824142] [2024-06-20 18:28:24,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393824142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:28:24,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:28:24,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:28:24,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158873939] [2024-06-20 18:28:24,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:28:24,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:28:24,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:28:24,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:28:24,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:28:24,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:28:24,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 443 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:24,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:28:24,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:28:24,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:28:24,854 INFO L124 PetriNetUnfolderBase]: 234/429 cut-off events. [2024-06-20 18:28:24,854 INFO L125 PetriNetUnfolderBase]: For 8312/8312 co-relation queries the response was YES. [2024-06-20 18:28:24,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2357 conditions, 429 events. 234/429 cut-off events. For 8312/8312 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1667 event pairs, 44 based on Foata normal form. 1/428 useless extension candidates. Maximal degree in co-relation 2321. Up to 380 conditions per place. [2024-06-20 18:28:24,857 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 60 selfloop transitions, 15 changer transitions 0/78 dead transitions. [2024-06-20 18:28:24,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 78 transitions, 639 flow [2024-06-20 18:28:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:28:24,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:28:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-20 18:28:24,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-20 18:28:24,858 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 443 flow. Second operand 8 states and 100 transitions. [2024-06-20 18:28:24,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 78 transitions, 639 flow [2024-06-20 18:28:24,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 78 transitions, 582 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-20 18:28:24,862 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 445 flow [2024-06-20 18:28:24,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=445, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2024-06-20 18:28:24,863 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-06-20 18:28:24,863 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 445 flow [2024-06-20 18:28:24,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:24,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:28:24,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:28:24,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 18:28:24,864 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:28:24,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:28:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash -725569669, now seen corresponding path program 3 times [2024-06-20 18:28:24,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:28:24,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931154] [2024-06-20 18:28:24,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:28:24,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:28:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:28:32,721 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-20 18:28:32,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:28:32,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931154] [2024-06-20 18:28:32,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:28:32,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:28:32,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:28:32,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971914521] [2024-06-20 18:28:32,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:28:32,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:28:32,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:28:32,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:28:32,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:28:32,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:28:32,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 445 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:32,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:28:32,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:28:32,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:28:33,150 INFO L124 PetriNetUnfolderBase]: 237/434 cut-off events. [2024-06-20 18:28:33,150 INFO L125 PetriNetUnfolderBase]: For 8923/8923 co-relation queries the response was YES. [2024-06-20 18:28:33,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2407 conditions, 434 events. 237/434 cut-off events. For 8923/8923 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1684 event pairs, 44 based on Foata normal form. 1/433 useless extension candidates. Maximal degree in co-relation 2370. Up to 376 conditions per place. [2024-06-20 18:28:33,153 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 57 selfloop transitions, 20 changer transitions 0/80 dead transitions. [2024-06-20 18:28:33,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 80 transitions, 649 flow [2024-06-20 18:28:33,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:28:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:28:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-20 18:28:33,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-20 18:28:33,154 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 445 flow. Second operand 8 states and 101 transitions. [2024-06-20 18:28:33,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 80 transitions, 649 flow [2024-06-20 18:28:33,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 80 transitions, 606 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 18:28:33,159 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 475 flow [2024-06-20 18:28:33,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=475, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2024-06-20 18:28:33,160 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2024-06-20 18:28:33,160 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 475 flow [2024-06-20 18:28:33,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:33,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:28:33,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:28:33,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 18:28:33,161 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:28:33,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:28:33,161 INFO L85 PathProgramCache]: Analyzing trace with hash -725569390, now seen corresponding path program 1 times [2024-06-20 18:28:33,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:28:33,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503629803] [2024-06-20 18:28:33,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:28:33,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:28:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:28:42,150 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-20 18:28:42,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:28:42,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503629803] [2024-06-20 18:28:42,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503629803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:28:42,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:28:42,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:28:42,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248375073] [2024-06-20 18:28:42,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:28:42,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:28:42,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:28:42,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:28:42,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:28:42,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:28:42,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 475 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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-20 18:28:42,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:28:42,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:28:42,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:28:42,621 INFO L124 PetriNetUnfolderBase]: 227/426 cut-off events. [2024-06-20 18:28:42,621 INFO L125 PetriNetUnfolderBase]: For 9518/9518 co-relation queries the response was YES. [2024-06-20 18:28:42,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2399 conditions, 426 events. 227/426 cut-off events. For 9518/9518 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1697 event pairs, 43 based on Foata normal form. 1/425 useless extension candidates. Maximal degree in co-relation 2361. Up to 363 conditions per place. [2024-06-20 18:28:42,624 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 59 selfloop transitions, 12 changer transitions 0/82 dead transitions. [2024-06-20 18:28:42,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 82 transitions, 659 flow [2024-06-20 18:28:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:28:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:28:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-20 18:28:42,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-20 18:28:42,625 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 475 flow. Second operand 8 states and 105 transitions. [2024-06-20 18:28:42,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 82 transitions, 659 flow [2024-06-20 18:28:42,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 602 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-20 18:28:42,631 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 467 flow [2024-06-20 18:28:42,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=467, PETRI_PLACES=84, PETRI_TRANSITIONS=71} [2024-06-20 18:28:42,632 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2024-06-20 18:28:42,632 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 467 flow [2024-06-20 18:28:42,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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-20 18:28:42,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:28:42,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:28:42,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 18:28:42,633 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:28:42,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:28:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1822666031, now seen corresponding path program 4 times [2024-06-20 18:28:42,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:28:42,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827861341] [2024-06-20 18:28:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:28:42,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:28:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:28:51,352 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-20 18:28:51,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:28:51,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827861341] [2024-06-20 18:28:51,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827861341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:28:51,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:28:51,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:28:51,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296947143] [2024-06-20 18:28:51,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:28:51,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:28:51,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:28:51,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:28:51,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:28:51,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:28:51,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 467 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:51,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:28:51,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:28:51,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:28:51,801 INFO L124 PetriNetUnfolderBase]: 243/445 cut-off events. [2024-06-20 18:28:51,802 INFO L125 PetriNetUnfolderBase]: For 10385/10388 co-relation queries the response was YES. [2024-06-20 18:28:51,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2566 conditions, 445 events. 243/445 cut-off events. For 10385/10388 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1744 event pairs, 51 based on Foata normal form. 1/443 useless extension candidates. Maximal degree in co-relation 2527. Up to 359 conditions per place. [2024-06-20 18:28:51,805 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 50 selfloop transitions, 31 changer transitions 0/84 dead transitions. [2024-06-20 18:28:51,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 84 transitions, 753 flow [2024-06-20 18:28:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:28:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:28:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-20 18:28:51,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-20 18:28:51,807 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 467 flow. Second operand 8 states and 102 transitions. [2024-06-20 18:28:51,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 84 transitions, 753 flow [2024-06-20 18:28:51,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 84 transitions, 720 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 18:28:51,814 INFO L231 Difference]: Finished difference. Result has 86 places, 75 transitions, 561 flow [2024-06-20 18:28:51,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=561, PETRI_PLACES=86, PETRI_TRANSITIONS=75} [2024-06-20 18:28:51,814 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 55 predicate places. [2024-06-20 18:28:51,814 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 75 transitions, 561 flow [2024-06-20 18:28:51,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:51,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:28:51,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:28:51,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 18:28:51,815 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:28:51,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:28:51,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1822666310, now seen corresponding path program 2 times [2024-06-20 18:28:51,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:28:51,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541420429] [2024-06-20 18:28:51,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:28:51,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:28:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:29:00,294 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-20 18:29:00,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:29:00,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541420429] [2024-06-20 18:29:00,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541420429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:29:00,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:29:00,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:29:00,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513580691] [2024-06-20 18:29:00,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:29:00,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:29:00,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:29:00,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:29:00,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:29:00,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:29:00,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 75 transitions, 561 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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-20 18:29:00,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:29:00,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:29:00,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:29:00,721 INFO L124 PetriNetUnfolderBase]: 238/445 cut-off events. [2024-06-20 18:29:00,722 INFO L125 PetriNetUnfolderBase]: For 11508/11511 co-relation queries the response was YES. [2024-06-20 18:29:00,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2644 conditions, 445 events. 238/445 cut-off events. For 11508/11511 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1778 event pairs, 47 based on Foata normal form. 3/445 useless extension candidates. Maximal degree in co-relation 2604. Up to 350 conditions per place. [2024-06-20 18:29:00,726 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 53 selfloop transitions, 25 changer transitions 0/91 dead transitions. [2024-06-20 18:29:00,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 899 flow [2024-06-20 18:29:00,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:29:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:29:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-20 18:29:00,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42578125 [2024-06-20 18:29:00,728 INFO L175 Difference]: Start difference. First operand has 86 places, 75 transitions, 561 flow. Second operand 8 states and 109 transitions. [2024-06-20 18:29:00,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 899 flow [2024-06-20 18:29:00,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 91 transitions, 853 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-20 18:29:00,738 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 634 flow [2024-06-20 18:29:00,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=634, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2024-06-20 18:29:00,738 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 59 predicate places. [2024-06-20 18:29:00,738 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 634 flow [2024-06-20 18:29:00,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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-20 18:29:00,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:29:00,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:29:00,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 18:29:00,739 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:29:00,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:29:00,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1822675610, now seen corresponding path program 3 times [2024-06-20 18:29:00,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:29:00,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426400484] [2024-06-20 18:29:00,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:29:00,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:29:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:29:11,075 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-20 18:29:11,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:29:11,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426400484] [2024-06-20 18:29:11,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426400484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:29:11,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:29:11,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:29:11,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156698692] [2024-06-20 18:29:11,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:29:11,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:29:11,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:29:11,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:29:11,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:29:11,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:29:11,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 634 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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-20 18:29:11,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:29:11,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:29:11,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:29:11,686 INFO L124 PetriNetUnfolderBase]: 236/441 cut-off events. [2024-06-20 18:29:11,687 INFO L125 PetriNetUnfolderBase]: For 12068/12068 co-relation queries the response was YES. [2024-06-20 18:29:11,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2688 conditions, 441 events. 236/441 cut-off events. For 12068/12068 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1760 event pairs, 43 based on Foata normal form. 1/440 useless extension candidates. Maximal degree in co-relation 2646. Up to 382 conditions per place. [2024-06-20 18:29:11,714 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 64 selfloop transitions, 12 changer transitions 0/89 dead transitions. [2024-06-20 18:29:11,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 804 flow [2024-06-20 18:29:11,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:29:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:29:11,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-20 18:29:11,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-20 18:29:11,715 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 634 flow. Second operand 8 states and 102 transitions. [2024-06-20 18:29:11,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 804 flow [2024-06-20 18:29:11,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 761 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-20 18:29:11,741 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 620 flow [2024-06-20 18:29:11,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=620, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2024-06-20 18:29:11,741 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-20 18:29:11,742 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 620 flow [2024-06-20 18:29:11,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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-20 18:29:11,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:29:11,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:29:11,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 18:29:11,742 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:29:11,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:29:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1813461821, now seen corresponding path program 5 times [2024-06-20 18:29:11,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:29:11,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518489106] [2024-06-20 18:29:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:29:11,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:29:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:29:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:29:21,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:29:21,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518489106] [2024-06-20 18:29:21,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518489106] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:29:21,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:29:21,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:29:21,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206318732] [2024-06-20 18:29:21,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:29:21,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:29:21,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:29:21,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:29:21,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:29:21,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:29:21,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 620 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:21,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:29:21,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:29:21,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:29:22,193 INFO L124 PetriNetUnfolderBase]: 252/460 cut-off events. [2024-06-20 18:29:22,193 INFO L125 PetriNetUnfolderBase]: For 13199/13202 co-relation queries the response was YES. [2024-06-20 18:29:22,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2861 conditions, 460 events. 252/460 cut-off events. For 13199/13202 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1810 event pairs, 51 based on Foata normal form. 1/458 useless extension candidates. Maximal degree in co-relation 2817. Up to 401 conditions per place. [2024-06-20 18:29:22,197 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 69 selfloop transitions, 19 changer transitions 0/91 dead transitions. [2024-06-20 18:29:22,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 91 transitions, 846 flow [2024-06-20 18:29:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:29:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:29:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-20 18:29:22,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38671875 [2024-06-20 18:29:22,198 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 620 flow. Second operand 8 states and 99 transitions. [2024-06-20 18:29:22,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 91 transitions, 846 flow [2024-06-20 18:29:22,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 816 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-20 18:29:22,211 INFO L231 Difference]: Finished difference. Result has 96 places, 83 transitions, 669 flow [2024-06-20 18:29:22,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=669, PETRI_PLACES=96, PETRI_TRANSITIONS=83} [2024-06-20 18:29:22,215 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 65 predicate places. [2024-06-20 18:29:22,215 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 83 transitions, 669 flow [2024-06-20 18:29:22,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:22,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:29:22,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:29:22,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 18:29:22,216 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:29:22,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:29:22,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1813469540, now seen corresponding path program 4 times [2024-06-20 18:29:22,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:29:22,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683125883] [2024-06-20 18:29:22,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:29:22,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:29:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:29:31,416 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-20 18:29:31,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:29:31,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683125883] [2024-06-20 18:29:31,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683125883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:29:31,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:29:31,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:29:31,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517428443] [2024-06-20 18:29:31,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:29:31,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:29:31,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:29:31,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:29:31,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:29:31,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:29:31,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 83 transitions, 669 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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-20 18:29:31,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:29:31,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:29:31,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:29:31,930 INFO L124 PetriNetUnfolderBase]: 237/444 cut-off events. [2024-06-20 18:29:31,944 INFO L125 PetriNetUnfolderBase]: For 13628/13631 co-relation queries the response was YES. [2024-06-20 18:29:31,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2767 conditions, 444 events. 237/444 cut-off events. For 13628/13631 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1781 event pairs, 47 based on Foata normal form. 3/444 useless extension candidates. Maximal degree in co-relation 2722. Up to 370 conditions per place. [2024-06-20 18:29:31,947 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 62 selfloop transitions, 15 changer transitions 0/91 dead transitions. [2024-06-20 18:29:31,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 91 transitions, 841 flow [2024-06-20 18:29:31,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:29:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:29:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-20 18:29:31,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 18:29:31,948 INFO L175 Difference]: Start difference. First operand has 96 places, 83 transitions, 669 flow. Second operand 8 states and 104 transitions. [2024-06-20 18:29:31,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 91 transitions, 841 flow [2024-06-20 18:29:31,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 91 transitions, 776 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-20 18:29:31,977 INFO L231 Difference]: Finished difference. Result has 98 places, 83 transitions, 639 flow [2024-06-20 18:29:31,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=639, PETRI_PLACES=98, PETRI_TRANSITIONS=83} [2024-06-20 18:29:31,979 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-20 18:29:31,979 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 83 transitions, 639 flow [2024-06-20 18:29:31,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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-20 18:29:31,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:29:31,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:29:31,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 18:29:31,980 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:29:31,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:29:31,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1813461604, now seen corresponding path program 4 times [2024-06-20 18:29:31,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:29:31,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856444641] [2024-06-20 18:29:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:29:31,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:29:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:29:39,607 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-20 18:29:39,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:29:39,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856444641] [2024-06-20 18:29:39,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856444641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:29:39,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:29:39,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:29:39,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526619626] [2024-06-20 18:29:39,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:29:39,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:29:39,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:29:39,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:29:39,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:29:39,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:29:39,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 83 transitions, 639 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:39,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:29:39,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:29:39,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:29:40,077 INFO L124 PetriNetUnfolderBase]: 251/460 cut-off events. [2024-06-20 18:29:40,078 INFO L125 PetriNetUnfolderBase]: For 14712/14712 co-relation queries the response was YES. [2024-06-20 18:29:40,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2868 conditions, 460 events. 251/460 cut-off events. For 14712/14712 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1805 event pairs, 43 based on Foata normal form. 2/460 useless extension candidates. Maximal degree in co-relation 2822. Up to 370 conditions per place. [2024-06-20 18:29:40,097 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 71 selfloop transitions, 25 changer transitions 0/99 dead transitions. [2024-06-20 18:29:40,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 897 flow [2024-06-20 18:29:40,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:29:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:29:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-20 18:29:40,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3993055555555556 [2024-06-20 18:29:40,098 INFO L175 Difference]: Start difference. First operand has 98 places, 83 transitions, 639 flow. Second operand 9 states and 115 transitions. [2024-06-20 18:29:40,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 897 flow [2024-06-20 18:29:40,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 99 transitions, 848 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-20 18:29:40,127 INFO L231 Difference]: Finished difference. Result has 100 places, 85 transitions, 679 flow [2024-06-20 18:29:40,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=679, PETRI_PLACES=100, PETRI_TRANSITIONS=85} [2024-06-20 18:29:40,127 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 69 predicate places. [2024-06-20 18:29:40,128 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 85 transitions, 679 flow [2024-06-20 18:29:40,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:40,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:29:40,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:29:40,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 18:29:40,128 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:29:40,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:29:40,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1813469261, now seen corresponding path program 6 times [2024-06-20 18:29:40,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:29:40,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887189766] [2024-06-20 18:29:40,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:29:40,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:29:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:29:48,496 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-20 18:29:48,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:29:48,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887189766] [2024-06-20 18:29:48,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887189766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:29:48,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:29:48,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:29:48,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479502212] [2024-06-20 18:29:48,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:29:48,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:29:48,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:29:48,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:29:48,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:29:48,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:29:48,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 85 transitions, 679 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:48,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:29:48,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:29:48,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:29:48,941 INFO L124 PetriNetUnfolderBase]: 249/458 cut-off events. [2024-06-20 18:29:48,941 INFO L125 PetriNetUnfolderBase]: For 14946/14949 co-relation queries the response was YES. [2024-06-20 18:29:48,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 458 events. 249/458 cut-off events. For 14946/14949 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1807 event pairs, 51 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 2854. Up to 391 conditions per place. [2024-06-20 18:29:48,944 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 68 selfloop transitions, 22 changer transitions 0/93 dead transitions. [2024-06-20 18:29:48,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 93 transitions, 877 flow [2024-06-20 18:29:48,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:29:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:29:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-20 18:29:48,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-20 18:29:48,946 INFO L175 Difference]: Start difference. First operand has 100 places, 85 transitions, 679 flow. Second operand 8 states and 101 transitions. [2024-06-20 18:29:48,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 93 transitions, 877 flow [2024-06-20 18:29:48,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 93 transitions, 796 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-20 18:29:48,963 INFO L231 Difference]: Finished difference. Result has 101 places, 85 transitions, 647 flow [2024-06-20 18:29:48,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=647, PETRI_PLACES=101, PETRI_TRANSITIONS=85} [2024-06-20 18:29:48,963 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 70 predicate places. [2024-06-20 18:29:48,963 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 85 transitions, 647 flow [2024-06-20 18:29:48,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:48,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:29:48,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:29:48,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 18:29:48,973 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:29:48,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:29:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1823004644, now seen corresponding path program 1 times [2024-06-20 18:29:48,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:29:48,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139748110] [2024-06-20 18:29:48,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:29:48,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:29:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:30:00,384 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-20 18:30:00,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:30:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139748110] [2024-06-20 18:30:00,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139748110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:30:00,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:30:00,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:30:00,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323540897] [2024-06-20 18:30:00,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:30:00,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:30:00,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:30:00,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:30:00,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:30:00,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:30:00,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 85 transitions, 647 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 18:30:00,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:30:00,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:30:00,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:30:00,960 INFO L124 PetriNetUnfolderBase]: 232/438 cut-off events. [2024-06-20 18:30:00,960 INFO L125 PetriNetUnfolderBase]: For 14955/14955 co-relation queries the response was YES. [2024-06-20 18:30:00,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 438 events. 232/438 cut-off events. For 14955/14955 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1771 event pairs, 42 based on Foata normal form. 2/438 useless extension candidates. Maximal degree in co-relation 2628. Up to 371 conditions per place. [2024-06-20 18:30:00,964 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 68 selfloop transitions, 13 changer transitions 0/95 dead transitions. [2024-06-20 18:30:00,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 95 transitions, 831 flow [2024-06-20 18:30:00,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:30:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:30:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-20 18:30:00,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-20 18:30:00,966 INFO L175 Difference]: Start difference. First operand has 101 places, 85 transitions, 647 flow. Second operand 9 states and 112 transitions. [2024-06-20 18:30:00,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 95 transitions, 831 flow [2024-06-20 18:30:00,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 750 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-20 18:30:00,978 INFO L231 Difference]: Finished difference. Result has 103 places, 85 transitions, 596 flow [2024-06-20 18:30:00,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=596, PETRI_PLACES=103, PETRI_TRANSITIONS=85} [2024-06-20 18:30:00,979 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-20 18:30:00,979 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 85 transitions, 596 flow [2024-06-20 18:30:00,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 18:30:00,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:30:00,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:30:00,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 18:30:00,980 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:30:00,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:30:00,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1195311276, now seen corresponding path program 1 times [2024-06-20 18:30:00,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:30:00,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428094020] [2024-06-20 18:30:00,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:30:00,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:30:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:30:10,832 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-20 18:30:10,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:30:10,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428094020] [2024-06-20 18:30:10,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428094020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:30:10,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:30:10,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:30:10,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922582742] [2024-06-20 18:30:10,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:30:10,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:30:10,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:30:10,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:30:10,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:30:10,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:30:10,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 85 transitions, 596 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:10,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:30:10,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:30:10,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:30:11,453 INFO L124 PetriNetUnfolderBase]: 244/449 cut-off events. [2024-06-20 18:30:11,453 INFO L125 PetriNetUnfolderBase]: For 15007/15007 co-relation queries the response was YES. [2024-06-20 18:30:11,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2726 conditions, 449 events. 244/449 cut-off events. For 15007/15007 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1772 event pairs, 41 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 2677. Up to 389 conditions per place. [2024-06-20 18:30:11,457 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 91 selfloop transitions, 14 changer transitions 0/108 dead transitions. [2024-06-20 18:30:11,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 108 transitions, 892 flow [2024-06-20 18:30:11,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:30:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:30:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-20 18:30:11,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 18:30:11,459 INFO L175 Difference]: Start difference. First operand has 103 places, 85 transitions, 596 flow. Second operand 9 states and 117 transitions. [2024-06-20 18:30:11,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 108 transitions, 892 flow [2024-06-20 18:30:11,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 108 transitions, 857 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-20 18:30:11,470 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 632 flow [2024-06-20 18:30:11,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=632, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2024-06-20 18:30:11,471 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 74 predicate places. [2024-06-20 18:30:11,471 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 632 flow [2024-06-20 18:30:11,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:11,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:30:11,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:30:11,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 18:30:11,471 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:30:11,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:30:11,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1190722470, now seen corresponding path program 1 times [2024-06-20 18:30:11,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:30:11,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690034908] [2024-06-20 18:30:11,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:30:11,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:30:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:30:20,797 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-20 18:30:20,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:30:20,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690034908] [2024-06-20 18:30:20,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690034908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:30:20,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:30:20,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:30:20,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498449256] [2024-06-20 18:30:20,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:30:20,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:30:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:30:20,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:30:20,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:30:20,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:30:20,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 632 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:20,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:30:20,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:30:20,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:30:21,357 INFO L124 PetriNetUnfolderBase]: 250/459 cut-off events. [2024-06-20 18:30:21,357 INFO L125 PetriNetUnfolderBase]: For 16541/16541 co-relation queries the response was YES. [2024-06-20 18:30:21,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 459 events. 250/459 cut-off events. For 16541/16541 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1816 event pairs, 40 based on Foata normal form. 2/459 useless extension candidates. Maximal degree in co-relation 2785. Up to 399 conditions per place. [2024-06-20 18:30:21,360 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 91 selfloop transitions, 15 changer transitions 0/109 dead transitions. [2024-06-20 18:30:21,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 109 transitions, 924 flow [2024-06-20 18:30:21,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:30:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:30:21,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-20 18:30:21,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-20 18:30:21,362 INFO L175 Difference]: Start difference. First operand has 105 places, 87 transitions, 632 flow. Second operand 9 states and 116 transitions. [2024-06-20 18:30:21,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 109 transitions, 924 flow [2024-06-20 18:30:21,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 109 transitions, 869 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-20 18:30:21,374 INFO L231 Difference]: Finished difference. Result has 107 places, 90 transitions, 651 flow [2024-06-20 18:30:21,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=651, PETRI_PLACES=107, PETRI_TRANSITIONS=90} [2024-06-20 18:30:21,374 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 76 predicate places. [2024-06-20 18:30:21,374 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 90 transitions, 651 flow [2024-06-20 18:30:21,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:21,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:30:21,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:30:21,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 18:30:21,375 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:30:21,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:30:21,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1190549490, now seen corresponding path program 2 times [2024-06-20 18:30:21,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:30:21,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269434978] [2024-06-20 18:30:21,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:30:21,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:30:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:30:30,753 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-20 18:30:30,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:30:30,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269434978] [2024-06-20 18:30:30,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269434978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:30:30,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:30:30,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:30:30,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747267702] [2024-06-20 18:30:30,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:30:30,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:30:30,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:30:30,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:30:30,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:30:30,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:30:30,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 90 transitions, 651 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:30,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:30:30,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:30:30,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:30:31,334 INFO L124 PetriNetUnfolderBase]: 256/469 cut-off events. [2024-06-20 18:30:31,335 INFO L125 PetriNetUnfolderBase]: For 17853/17853 co-relation queries the response was YES. [2024-06-20 18:30:31,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 469 events. 256/469 cut-off events. For 17853/17853 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1856 event pairs, 40 based on Foata normal form. 2/469 useless extension candidates. Maximal degree in co-relation 2913. Up to 400 conditions per place. [2024-06-20 18:30:31,338 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 92 selfloop transitions, 19 changer transitions 0/114 dead transitions. [2024-06-20 18:30:31,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 969 flow [2024-06-20 18:30:31,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:30:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:30:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-20 18:30:31,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 18:30:31,339 INFO L175 Difference]: Start difference. First operand has 107 places, 90 transitions, 651 flow. Second operand 10 states and 128 transitions. [2024-06-20 18:30:31,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 969 flow [2024-06-20 18:30:31,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 114 transitions, 917 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-20 18:30:31,353 INFO L231 Difference]: Finished difference. Result has 110 places, 93 transitions, 687 flow [2024-06-20 18:30:31,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=687, PETRI_PLACES=110, PETRI_TRANSITIONS=93} [2024-06-20 18:30:31,354 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 79 predicate places. [2024-06-20 18:30:31,354 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 93 transitions, 687 flow [2024-06-20 18:30:31,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:31,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:30:31,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:30:31,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 18:30:31,355 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:30:31,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:30:31,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1190542732, now seen corresponding path program 1 times [2024-06-20 18:30:31,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:30:31,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144096106] [2024-06-20 18:30:31,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:30:31,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:30:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:30:40,045 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-20 18:30:40,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:30:40,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144096106] [2024-06-20 18:30:40,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144096106] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:30:40,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:30:40,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:30:40,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720975677] [2024-06-20 18:30:40,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:30:40,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:30:40,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:30:40,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:30:40,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:30:40,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:30:40,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 93 transitions, 687 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:40,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:30:40,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:30:40,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:30:40,574 INFO L124 PetriNetUnfolderBase]: 262/479 cut-off events. [2024-06-20 18:30:40,575 INFO L125 PetriNetUnfolderBase]: For 19088/19088 co-relation queries the response was YES. [2024-06-20 18:30:40,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3088 conditions, 479 events. 262/479 cut-off events. For 19088/19088 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1916 event pairs, 39 based on Foata normal form. 2/479 useless extension candidates. Maximal degree in co-relation 3036. Up to 428 conditions per place. [2024-06-20 18:30:40,578 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 94 selfloop transitions, 14 changer transitions 0/111 dead transitions. [2024-06-20 18:30:40,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 111 transitions, 969 flow [2024-06-20 18:30:40,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:30:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:30:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-20 18:30:40,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-20 18:30:40,579 INFO L175 Difference]: Start difference. First operand has 110 places, 93 transitions, 687 flow. Second operand 9 states and 112 transitions. [2024-06-20 18:30:40,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 111 transitions, 969 flow [2024-06-20 18:30:40,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 111 transitions, 903 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-20 18:30:40,592 INFO L231 Difference]: Finished difference. Result has 111 places, 95 transitions, 680 flow [2024-06-20 18:30:40,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=680, PETRI_PLACES=111, PETRI_TRANSITIONS=95} [2024-06-20 18:30:40,592 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 80 predicate places. [2024-06-20 18:30:40,593 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 95 transitions, 680 flow [2024-06-20 18:30:40,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:40,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:30:40,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:30:40,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 18:30:40,593 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:30:40,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:30:40,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1024309200, now seen corresponding path program 3 times [2024-06-20 18:30:40,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:30:40,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417432194] [2024-06-20 18:30:40,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:30:40,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:30:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:30:49,141 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-20 18:30:49,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:30:49,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417432194] [2024-06-20 18:30:49,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417432194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:30:49,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:30:49,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:30:49,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882253459] [2024-06-20 18:30:49,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:30:49,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:30:49,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:30:49,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:30:49,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:30:49,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:30:49,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 95 transitions, 680 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:49,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:30:49,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:30:49,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:30:49,762 INFO L124 PetriNetUnfolderBase]: 265/484 cut-off events. [2024-06-20 18:30:49,762 INFO L125 PetriNetUnfolderBase]: For 19317/19317 co-relation queries the response was YES. [2024-06-20 18:30:49,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 484 events. 265/484 cut-off events. For 19317/19317 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1944 event pairs, 39 based on Foata normal form. 1/483 useless extension candidates. Maximal degree in co-relation 3074. Up to 403 conditions per place. [2024-06-20 18:30:49,765 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 89 selfloop transitions, 25 changer transitions 0/117 dead transitions. [2024-06-20 18:30:49,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 117 transitions, 988 flow [2024-06-20 18:30:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:30:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:30:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-20 18:30:49,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 18:30:49,767 INFO L175 Difference]: Start difference. First operand has 111 places, 95 transitions, 680 flow. Second operand 10 states and 128 transitions. [2024-06-20 18:30:49,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 117 transitions, 988 flow [2024-06-20 18:30:49,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 945 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-20 18:30:49,781 INFO L231 Difference]: Finished difference. Result has 114 places, 97 transitions, 722 flow [2024-06-20 18:30:49,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=722, PETRI_PLACES=114, PETRI_TRANSITIONS=97} [2024-06-20 18:30:49,781 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 83 predicate places. [2024-06-20 18:30:49,782 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 97 transitions, 722 flow [2024-06-20 18:30:49,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:49,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:30:49,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:30:49,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 18:30:49,782 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:30:49,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:30:49,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1051719028, now seen corresponding path program 2 times [2024-06-20 18:30:49,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:30:49,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902625398] [2024-06-20 18:30:49,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:30:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:30:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:30:59,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-20 18:30:59,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:30:59,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902625398] [2024-06-20 18:30:59,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902625398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:30:59,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:30:59,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:30:59,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227678969] [2024-06-20 18:30:59,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:30:59,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:30:59,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:30:59,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:30:59,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:30:59,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:30:59,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 97 transitions, 722 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:59,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:30:59,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:30:59,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:31:00,016 INFO L124 PetriNetUnfolderBase]: 296/534 cut-off events. [2024-06-20 18:31:00,016 INFO L125 PetriNetUnfolderBase]: For 24643/24643 co-relation queries the response was YES. [2024-06-20 18:31:00,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3691 conditions, 534 events. 296/534 cut-off events. For 24643/24643 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2192 event pairs, 40 based on Foata normal form. 2/534 useless extension candidates. Maximal degree in co-relation 3637. Up to 434 conditions per place. [2024-06-20 18:31:00,020 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 91 selfloop transitions, 27 changer transitions 0/121 dead transitions. [2024-06-20 18:31:00,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 121 transitions, 1256 flow [2024-06-20 18:31:00,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:31:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:31:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-20 18:31:00,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-20 18:31:00,021 INFO L175 Difference]: Start difference. First operand has 114 places, 97 transitions, 722 flow. Second operand 9 states and 118 transitions. [2024-06-20 18:31:00,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 121 transitions, 1256 flow [2024-06-20 18:31:00,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 121 transitions, 1187 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-20 18:31:00,040 INFO L231 Difference]: Finished difference. Result has 116 places, 104 transitions, 824 flow [2024-06-20 18:31:00,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=824, PETRI_PLACES=116, PETRI_TRANSITIONS=104} [2024-06-20 18:31:00,041 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2024-06-20 18:31:00,041 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 104 transitions, 824 flow [2024-06-20 18:31:00,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:00,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:31:00,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:31:00,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 18:31:00,042 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:31:00,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:31:00,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1051718780, now seen corresponding path program 4 times [2024-06-20 18:31:00,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:31:00,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655997851] [2024-06-20 18:31:00,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:31:00,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:31:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:31:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:31:08,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:31:08,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655997851] [2024-06-20 18:31:08,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655997851] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:31:08,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:31:08,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:31:08,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107880306] [2024-06-20 18:31:08,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:31:08,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:31:08,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:31:08,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:31:08,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:31:09,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:31:09,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 104 transitions, 824 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:09,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:31:09,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:31:09,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:31:09,348 INFO L124 PetriNetUnfolderBase]: 309/555 cut-off events. [2024-06-20 18:31:09,349 INFO L125 PetriNetUnfolderBase]: For 27034/27034 co-relation queries the response was YES. [2024-06-20 18:31:09,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 555 events. 309/555 cut-off events. For 27034/27034 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2300 event pairs, 41 based on Foata normal form. 1/554 useless extension candidates. Maximal degree in co-relation 3967. Up to 440 conditions per place. [2024-06-20 18:31:09,353 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 84 selfloop transitions, 36 changer transitions 0/123 dead transitions. [2024-06-20 18:31:09,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 123 transitions, 1258 flow [2024-06-20 18:31:09,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:31:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:31:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-20 18:31:09,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 18:31:09,354 INFO L175 Difference]: Start difference. First operand has 116 places, 104 transitions, 824 flow. Second operand 9 states and 117 transitions. [2024-06-20 18:31:09,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 123 transitions, 1258 flow [2024-06-20 18:31:09,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 123 transitions, 1220 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-20 18:31:09,411 INFO L231 Difference]: Finished difference. Result has 122 places, 109 transitions, 970 flow [2024-06-20 18:31:09,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=970, PETRI_PLACES=122, PETRI_TRANSITIONS=109} [2024-06-20 18:31:09,411 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 91 predicate places. [2024-06-20 18:31:09,411 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 109 transitions, 970 flow [2024-06-20 18:31:09,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:09,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:31:09,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:31:09,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 18:31:09,412 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:31:09,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:31:09,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1051727708, now seen corresponding path program 1 times [2024-06-20 18:31:09,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:31:09,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633211629] [2024-06-20 18:31:09,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:31:09,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:31:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:31:19,620 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-20 18:31:19,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:31:19,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633211629] [2024-06-20 18:31:19,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633211629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:31:19,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:31:19,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:31:19,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532935813] [2024-06-20 18:31:19,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:31:19,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:31:19,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:31:19,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:31:19,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:31:19,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:31:19,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 109 transitions, 970 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 18:31:19,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:31:19,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:31:19,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:31:20,205 INFO L124 PetriNetUnfolderBase]: 288/533 cut-off events. [2024-06-20 18:31:20,206 INFO L125 PetriNetUnfolderBase]: For 27928/27928 co-relation queries the response was YES. [2024-06-20 18:31:20,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 533 events. 288/533 cut-off events. For 27928/27928 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2275 event pairs, 39 based on Foata normal form. 1/532 useless extension candidates. Maximal degree in co-relation 3964. Up to 444 conditions per place. [2024-06-20 18:31:20,210 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 90 selfloop transitions, 14 changer transitions 0/122 dead transitions. [2024-06-20 18:31:20,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 122 transitions, 1215 flow [2024-06-20 18:31:20,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:31:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:31:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-20 18:31:20,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-20 18:31:20,211 INFO L175 Difference]: Start difference. First operand has 122 places, 109 transitions, 970 flow. Second operand 9 states and 116 transitions. [2024-06-20 18:31:20,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 122 transitions, 1215 flow [2024-06-20 18:31:20,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 122 transitions, 1164 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-20 18:31:20,238 INFO L231 Difference]: Finished difference. Result has 126 places, 110 transitions, 963 flow [2024-06-20 18:31:20,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=963, PETRI_PLACES=126, PETRI_TRANSITIONS=110} [2024-06-20 18:31:20,239 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 95 predicate places. [2024-06-20 18:31:20,239 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 110 transitions, 963 flow [2024-06-20 18:31:20,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 18:31:20,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:31:20,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:31:20,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 18:31:20,240 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:31:20,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:31:20,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1051727398, now seen corresponding path program 3 times [2024-06-20 18:31:20,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:31:20,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476712672] [2024-06-20 18:31:20,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:31:20,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:31:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:31:29,441 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-20 18:31:29,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:31:29,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476712672] [2024-06-20 18:31:29,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476712672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:31:29,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:31:29,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:31:29,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492688298] [2024-06-20 18:31:29,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:31:29,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:31:29,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:31:29,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:31:29,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:31:29,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:31:29,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 110 transitions, 963 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:29,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:31:29,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:31:29,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:31:29,916 INFO L124 PetriNetUnfolderBase]: 303/546 cut-off events. [2024-06-20 18:31:29,916 INFO L125 PetriNetUnfolderBase]: For 28296/28296 co-relation queries the response was YES. [2024-06-20 18:31:29,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4079 conditions, 546 events. 303/546 cut-off events. For 28296/28296 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2268 event pairs, 39 based on Foata normal form. 2/546 useless extension candidates. Maximal degree in co-relation 4018. Up to 451 conditions per place. [2024-06-20 18:31:29,921 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 92 selfloop transitions, 30 changer transitions 0/125 dead transitions. [2024-06-20 18:31:29,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 125 transitions, 1333 flow [2024-06-20 18:31:29,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:31:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:31:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-20 18:31:29,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3993055555555556 [2024-06-20 18:31:29,922 INFO L175 Difference]: Start difference. First operand has 126 places, 110 transitions, 963 flow. Second operand 9 states and 115 transitions. [2024-06-20 18:31:29,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 125 transitions, 1333 flow [2024-06-20 18:31:29,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 125 transitions, 1272 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-20 18:31:29,948 INFO L231 Difference]: Finished difference. Result has 128 places, 110 transitions, 968 flow [2024-06-20 18:31:29,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=968, PETRI_PLACES=128, PETRI_TRANSITIONS=110} [2024-06-20 18:31:29,948 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 97 predicate places. [2024-06-20 18:31:29,948 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 110 transitions, 968 flow [2024-06-20 18:31:29,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:29,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:31:29,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:31:29,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 18:31:29,949 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:31:29,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:31:29,949 INFO L85 PathProgramCache]: Analyzing trace with hash -173459900, now seen corresponding path program 4 times [2024-06-20 18:31:29,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:31:29,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101846196] [2024-06-20 18:31:29,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:31:29,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:31:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:31:38,193 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-20 18:31:38,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:31:38,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101846196] [2024-06-20 18:31:38,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101846196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:31:38,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:31:38,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:31:38,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134613962] [2024-06-20 18:31:38,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:31:38,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:31:38,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:31:38,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:31:38,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:31:38,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:31:38,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 110 transitions, 968 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:38,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:31:38,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:31:38,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:31:38,672 INFO L124 PetriNetUnfolderBase]: 301/543 cut-off events. [2024-06-20 18:31:38,673 INFO L125 PetriNetUnfolderBase]: For 28169/28169 co-relation queries the response was YES. [2024-06-20 18:31:38,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4052 conditions, 543 events. 301/543 cut-off events. For 28169/28169 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2250 event pairs, 38 based on Foata normal form. 1/542 useless extension candidates. Maximal degree in co-relation 3990. Up to 489 conditions per place. [2024-06-20 18:31:38,677 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 104 selfloop transitions, 17 changer transitions 0/124 dead transitions. [2024-06-20 18:31:38,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 124 transitions, 1271 flow [2024-06-20 18:31:38,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:31:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:31:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-20 18:31:38,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-20 18:31:38,679 INFO L175 Difference]: Start difference. First operand has 128 places, 110 transitions, 968 flow. Second operand 9 states and 110 transitions. [2024-06-20 18:31:38,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 124 transitions, 1271 flow [2024-06-20 18:31:38,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 124 transitions, 1212 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-20 18:31:38,705 INFO L231 Difference]: Finished difference. Result has 130 places, 112 transitions, 985 flow [2024-06-20 18:31:38,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=985, PETRI_PLACES=130, PETRI_TRANSITIONS=112} [2024-06-20 18:31:38,705 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 99 predicate places. [2024-06-20 18:31:38,705 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 112 transitions, 985 flow [2024-06-20 18:31:38,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:38,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:31:38,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:31:38,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 18:31:38,706 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:31:38,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:31:38,707 INFO L85 PathProgramCache]: Analyzing trace with hash -265630278, now seen corresponding path program 5 times [2024-06-20 18:31:38,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:31:38,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561751430] [2024-06-20 18:31:38,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:31:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:31:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:31:47,834 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-20 18:31:47,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:31:47,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561751430] [2024-06-20 18:31:47,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561751430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:31:47,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:31:47,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:31:47,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142971800] [2024-06-20 18:31:47,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:31:47,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:31:47,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:31:47,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:31:47,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:31:47,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:31:47,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 112 transitions, 985 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:47,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:31:47,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:31:47,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:31:48,315 INFO L124 PetriNetUnfolderBase]: 304/548 cut-off events. [2024-06-20 18:31:48,315 INFO L125 PetriNetUnfolderBase]: For 29376/29376 co-relation queries the response was YES. [2024-06-20 18:31:48,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4114 conditions, 548 events. 304/548 cut-off events. For 29376/29376 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2275 event pairs, 38 based on Foata normal form. 1/547 useless extension candidates. Maximal degree in co-relation 4051. Up to 459 conditions per place. [2024-06-20 18:31:48,320 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 101 selfloop transitions, 25 changer transitions 0/129 dead transitions. [2024-06-20 18:31:48,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 129 transitions, 1415 flow [2024-06-20 18:31:48,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:31:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:31:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-20 18:31:48,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-20 18:31:48,322 INFO L175 Difference]: Start difference. First operand has 130 places, 112 transitions, 985 flow. Second operand 9 states and 118 transitions. [2024-06-20 18:31:48,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 129 transitions, 1415 flow [2024-06-20 18:31:48,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 1362 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 18:31:48,353 INFO L231 Difference]: Finished difference. Result has 132 places, 114 transitions, 1023 flow [2024-06-20 18:31:48,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1023, PETRI_PLACES=132, PETRI_TRANSITIONS=114} [2024-06-20 18:31:48,354 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-06-20 18:31:48,354 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 114 transitions, 1023 flow [2024-06-20 18:31:48,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:48,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:31:48,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:31:48,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 18:31:48,355 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:31:48,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:31:48,355 INFO L85 PathProgramCache]: Analyzing trace with hash -265636788, now seen corresponding path program 6 times [2024-06-20 18:31:48,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:31:48,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537346174] [2024-06-20 18:31:48,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:31:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:31:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:31:57,990 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-20 18:31:57,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:31:57,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537346174] [2024-06-20 18:31:57,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537346174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:31:57,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:31:57,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:31:57,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352126166] [2024-06-20 18:31:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:31:57,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:31:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:31:57,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:31:57,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:31:58,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:31:58,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 114 transitions, 1023 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:58,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:31:58,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:31:58,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:31:58,542 INFO L124 PetriNetUnfolderBase]: 300/542 cut-off events. [2024-06-20 18:31:58,542 INFO L125 PetriNetUnfolderBase]: For 29842/29842 co-relation queries the response was YES. [2024-06-20 18:31:58,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4019 conditions, 542 events. 300/542 cut-off events. For 29842/29842 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2248 event pairs, 38 based on Foata normal form. 2/542 useless extension candidates. Maximal degree in co-relation 3955. Up to 461 conditions per place. [2024-06-20 18:31:58,546 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 103 selfloop transitions, 22 changer transitions 0/128 dead transitions. [2024-06-20 18:31:58,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 128 transitions, 1329 flow [2024-06-20 18:31:58,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:31:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:31:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-20 18:31:58,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3993055555555556 [2024-06-20 18:31:58,547 INFO L175 Difference]: Start difference. First operand has 132 places, 114 transitions, 1023 flow. Second operand 9 states and 115 transitions. [2024-06-20 18:31:58,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 128 transitions, 1329 flow [2024-06-20 18:31:58,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 128 transitions, 1202 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-20 18:31:58,578 INFO L231 Difference]: Finished difference. Result has 134 places, 114 transitions, 946 flow [2024-06-20 18:31:58,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=946, PETRI_PLACES=134, PETRI_TRANSITIONS=114} [2024-06-20 18:31:58,579 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2024-06-20 18:31:58,579 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 114 transitions, 946 flow [2024-06-20 18:31:58,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:58,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:31:58,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:31:58,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 18:31:58,579 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:31:58,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:31:58,580 INFO L85 PathProgramCache]: Analyzing trace with hash 920985932, now seen corresponding path program 2 times [2024-06-20 18:31:58,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:31:58,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694011019] [2024-06-20 18:31:58,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:31:58,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:31:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:32:08,700 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-20 18:32:08,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:32:08,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694011019] [2024-06-20 18:32:08,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694011019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:32:08,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:32:08,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:32:08,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632745841] [2024-06-20 18:32:08,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:32:08,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:32:08,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:32:08,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:32:08,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:32:08,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-20 18:32:08,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 114 transitions, 946 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-20 18:32:08,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:32:08,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-20 18:32:08,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:32:09,253 INFO L124 PetriNetUnfolderBase]: 286/531 cut-off events. [2024-06-20 18:32:09,254 INFO L125 PetriNetUnfolderBase]: For 30029/30032 co-relation queries the response was YES. [2024-06-20 18:32:09,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3885 conditions, 531 events. 286/531 cut-off events. For 30029/30032 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2270 event pairs, 41 based on Foata normal form. 3/531 useless extension candidates. Maximal degree in co-relation 3820. Up to 436 conditions per place. [2024-06-20 18:32:09,257 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 89 selfloop transitions, 17 changer transitions 0/125 dead transitions. [2024-06-20 18:32:09,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 125 transitions, 1204 flow [2024-06-20 18:32:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:32:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:32:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-06-20 18:32:09,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-20 18:32:09,259 INFO L175 Difference]: Start difference. First operand has 134 places, 114 transitions, 946 flow. Second operand 9 states and 124 transitions. [2024-06-20 18:32:09,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 125 transitions, 1204 flow [2024-06-20 18:32:09,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 1153 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 18:32:09,291 INFO L231 Difference]: Finished difference. Result has 135 places, 116 transitions, 964 flow [2024-06-20 18:32:09,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=964, PETRI_PLACES=135, PETRI_TRANSITIONS=116} [2024-06-20 18:32:09,292 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 104 predicate places. [2024-06-20 18:32:09,292 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 116 transitions, 964 flow [2024-06-20 18:32:09,292 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-20 18:32:09,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:32:09,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:32:09,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 18:32:09,292 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:32:09,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:32:09,293 INFO L85 PathProgramCache]: Analyzing trace with hash 382981670, now seen corresponding path program 5 times [2024-06-20 18:32:09,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:32:09,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583283529] [2024-06-20 18:32:09,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:32:09,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:32:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:32:17,698 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-20 18:32:17,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:32:17,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583283529] [2024-06-20 18:32:17,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583283529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:32:17,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:32:17,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:32:17,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658683344] [2024-06-20 18:32:17,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:32:17,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:32:17,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:32:17,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:32:17,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:32:17,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:32:17,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 116 transitions, 964 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:17,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:32:17,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:32:17,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:32:18,167 INFO L124 PetriNetUnfolderBase]: 311/561 cut-off events. [2024-06-20 18:32:18,167 INFO L125 PetriNetUnfolderBase]: For 32491/32494 co-relation queries the response was YES. [2024-06-20 18:32:18,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4169 conditions, 561 events. 311/561 cut-off events. For 32491/32494 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2368 event pairs, 46 based on Foata normal form. 1/559 useless extension candidates. Maximal degree in co-relation 4103. Up to 482 conditions per place. [2024-06-20 18:32:18,172 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 100 selfloop transitions, 27 changer transitions 0/130 dead transitions. [2024-06-20 18:32:18,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 130 transitions, 1394 flow [2024-06-20 18:32:18,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:32:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:32:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-20 18:32:18,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-20 18:32:18,173 INFO L175 Difference]: Start difference. First operand has 135 places, 116 transitions, 964 flow. Second operand 9 states and 113 transitions. [2024-06-20 18:32:18,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 130 transitions, 1394 flow [2024-06-20 18:32:18,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 130 transitions, 1341 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 18:32:18,208 INFO L231 Difference]: Finished difference. Result has 137 places, 120 transitions, 1038 flow [2024-06-20 18:32:18,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1038, PETRI_PLACES=137, PETRI_TRANSITIONS=120} [2024-06-20 18:32:18,209 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 106 predicate places. [2024-06-20 18:32:18,209 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 120 transitions, 1038 flow [2024-06-20 18:32:18,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:18,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:32:18,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:32:18,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 18:32:18,210 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:32:18,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:32:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash 929029192, now seen corresponding path program 6 times [2024-06-20 18:32:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:32:18,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359712759] [2024-06-20 18:32:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:32:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:32:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:32:28,129 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-20 18:32:28,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:32:28,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359712759] [2024-06-20 18:32:28,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359712759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:32:28,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:32:28,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:32:28,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331881461] [2024-06-20 18:32:28,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:32:28,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:32:28,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:32:28,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:32:28,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:32:28,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:32:28,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 120 transitions, 1038 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:28,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:32:28,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:32:28,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:32:28,662 INFO L124 PetriNetUnfolderBase]: 319/574 cut-off events. [2024-06-20 18:32:28,662 INFO L125 PetriNetUnfolderBase]: For 35253/35256 co-relation queries the response was YES. [2024-06-20 18:32:28,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4392 conditions, 574 events. 319/574 cut-off events. For 35253/35256 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2435 event pairs, 45 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 4325. Up to 439 conditions per place. [2024-06-20 18:32:28,666 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 92 selfloop transitions, 47 changer transitions 0/142 dead transitions. [2024-06-20 18:32:28,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 142 transitions, 1757 flow [2024-06-20 18:32:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:32:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:32:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-20 18:32:28,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-20 18:32:28,669 INFO L175 Difference]: Start difference. First operand has 137 places, 120 transitions, 1038 flow. Second operand 9 states and 118 transitions. [2024-06-20 18:32:28,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 142 transitions, 1757 flow [2024-06-20 18:32:28,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 142 transitions, 1697 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-20 18:32:28,709 INFO L231 Difference]: Finished difference. Result has 142 places, 130 transitions, 1252 flow [2024-06-20 18:32:28,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1252, PETRI_PLACES=142, PETRI_TRANSITIONS=130} [2024-06-20 18:32:28,710 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2024-06-20 18:32:28,710 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 130 transitions, 1252 flow [2024-06-20 18:32:28,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:28,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:32:28,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:32:28,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 18:32:28,711 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:32:28,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:32:28,711 INFO L85 PathProgramCache]: Analyzing trace with hash 382973052, now seen corresponding path program 7 times [2024-06-20 18:32:28,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:32:28,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545510809] [2024-06-20 18:32:28,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:32:28,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:32:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:32:37,416 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-20 18:32:37,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:32:37,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545510809] [2024-06-20 18:32:37,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545510809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:32:37,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:32:37,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:32:37,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192566983] [2024-06-20 18:32:37,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:32:37,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:32:37,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:32:37,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:32:37,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:32:37,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:32:37,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 130 transitions, 1252 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:37,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:32:37,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:32:37,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:32:37,951 INFO L124 PetriNetUnfolderBase]: 332/595 cut-off events. [2024-06-20 18:32:37,951 INFO L125 PetriNetUnfolderBase]: For 39623/39626 co-relation queries the response was YES. [2024-06-20 18:32:37,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4834 conditions, 595 events. 332/595 cut-off events. For 39623/39626 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2527 event pairs, 49 based on Foata normal form. 1/593 useless extension candidates. Maximal degree in co-relation 4764. Up to 482 conditions per place. [2024-06-20 18:32:37,956 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 112 selfloop transitions, 32 changer transitions 0/147 dead transitions. [2024-06-20 18:32:37,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 147 transitions, 1776 flow [2024-06-20 18:32:37,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:32:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:32:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-20 18:32:37,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2024-06-20 18:32:37,958 INFO L175 Difference]: Start difference. First operand has 142 places, 130 transitions, 1252 flow. Second operand 9 states and 119 transitions. [2024-06-20 18:32:37,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 147 transitions, 1776 flow [2024-06-20 18:32:38,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 147 transitions, 1707 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-20 18:32:38,004 INFO L231 Difference]: Finished difference. Result has 149 places, 135 transitions, 1361 flow [2024-06-20 18:32:38,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1361, PETRI_PLACES=149, PETRI_TRANSITIONS=135} [2024-06-20 18:32:38,004 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 118 predicate places. [2024-06-20 18:32:38,004 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 135 transitions, 1361 flow [2024-06-20 18:32:38,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:38,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:32:38,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:32:38,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 18:32:38,005 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:32:38,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:32:38,005 INFO L85 PathProgramCache]: Analyzing trace with hash -811648042, now seen corresponding path program 7 times [2024-06-20 18:32:38,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:32:38,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071026952] [2024-06-20 18:32:38,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:32:38,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:32:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:32:46,611 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-20 18:32:46,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:32:46,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071026952] [2024-06-20 18:32:46,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071026952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:32:46,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:32:46,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:32:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741811763] [2024-06-20 18:32:46,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:32:46,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:32:46,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:32:46,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:32:46,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:32:46,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:32:46,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 135 transitions, 1361 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:46,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:32:46,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:32:46,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:32:47,092 INFO L124 PetriNetUnfolderBase]: 335/600 cut-off events. [2024-06-20 18:32:47,092 INFO L125 PetriNetUnfolderBase]: For 41389/41392 co-relation queries the response was YES. [2024-06-20 18:32:47,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5009 conditions, 600 events. 335/600 cut-off events. For 41389/41392 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2545 event pairs, 46 based on Foata normal form. 1/598 useless extension candidates. Maximal degree in co-relation 4936. Up to 520 conditions per place. [2024-06-20 18:32:47,098 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 116 selfloop transitions, 28 changer transitions 0/147 dead transitions. [2024-06-20 18:32:47,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 147 transitions, 1805 flow [2024-06-20 18:32:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:32:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:32:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-20 18:32:47,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-20 18:32:47,099 INFO L175 Difference]: Start difference. First operand has 149 places, 135 transitions, 1361 flow. Second operand 9 states and 114 transitions. [2024-06-20 18:32:47,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 147 transitions, 1805 flow [2024-06-20 18:32:47,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 147 transitions, 1736 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-20 18:32:47,152 INFO L231 Difference]: Finished difference. Result has 153 places, 137 transitions, 1391 flow [2024-06-20 18:32:47,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1391, PETRI_PLACES=153, PETRI_TRANSITIONS=137} [2024-06-20 18:32:47,153 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2024-06-20 18:32:47,153 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 137 transitions, 1391 flow [2024-06-20 18:32:47,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:47,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:32:47,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:32:47,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 18:32:47,154 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:32:47,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:32:47,154 INFO L85 PathProgramCache]: Analyzing trace with hash -526548420, now seen corresponding path program 8 times [2024-06-20 18:32:47,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:32:47,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781245157] [2024-06-20 18:32:47,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:32:47,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:32:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:32:56,782 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-20 18:32:56,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:32:56,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781245157] [2024-06-20 18:32:56,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781245157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:32:56,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:32:56,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:32:56,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091887300] [2024-06-20 18:32:56,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:32:56,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:32:56,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:32:56,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:32:56,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:32:56,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:32:56,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 137 transitions, 1391 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:56,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:32:56,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:32:56,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:32:57,305 INFO L124 PetriNetUnfolderBase]: 333/597 cut-off events. [2024-06-20 18:32:57,305 INFO L125 PetriNetUnfolderBase]: For 41651/41654 co-relation queries the response was YES. [2024-06-20 18:32:57,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4976 conditions, 597 events. 333/597 cut-off events. For 41651/41654 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2535 event pairs, 50 based on Foata normal form. 1/595 useless extension candidates. Maximal degree in co-relation 4901. Up to 433 conditions per place. [2024-06-20 18:32:57,310 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 91 selfloop transitions, 56 changer transitions 0/150 dead transitions. [2024-06-20 18:32:57,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 150 transitions, 1865 flow [2024-06-20 18:32:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:32:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:32:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-20 18:32:57,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 18:32:57,318 INFO L175 Difference]: Start difference. First operand has 153 places, 137 transitions, 1391 flow. Second operand 9 states and 117 transitions. [2024-06-20 18:32:57,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 150 transitions, 1865 flow [2024-06-20 18:32:57,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 150 transitions, 1796 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-20 18:32:57,378 INFO L231 Difference]: Finished difference. Result has 156 places, 139 transitions, 1485 flow [2024-06-20 18:32:57,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1485, PETRI_PLACES=156, PETRI_TRANSITIONS=139} [2024-06-20 18:32:57,382 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-20 18:32:57,382 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 139 transitions, 1485 flow [2024-06-20 18:32:57,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:57,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:32:57,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:32:57,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 18:32:57,383 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:32:57,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:32:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash 668073170, now seen corresponding path program 8 times [2024-06-20 18:32:57,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:32:57,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185239326] [2024-06-20 18:32:57,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:32:57,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:32:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:33:05,088 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-20 18:33:05,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:33:05,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185239326] [2024-06-20 18:33:05,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185239326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:33:05,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:33:05,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:33:05,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460070738] [2024-06-20 18:33:05,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:33:05,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:33:05,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:33:05,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:33:05,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:33:05,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:33:05,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 139 transitions, 1485 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:33:05,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:33:05,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:33:05,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:33:05,526 INFO L124 PetriNetUnfolderBase]: 339/607 cut-off events. [2024-06-20 18:33:05,527 INFO L125 PetriNetUnfolderBase]: For 44978/44981 co-relation queries the response was YES. [2024-06-20 18:33:05,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5180 conditions, 607 events. 339/607 cut-off events. For 44978/44981 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2600 event pairs, 45 based on Foata normal form. 2/606 useless extension candidates. Maximal degree in co-relation 5104. Up to 416 conditions per place. [2024-06-20 18:33:05,532 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 99 selfloop transitions, 57 changer transitions 0/159 dead transitions. [2024-06-20 18:33:05,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 159 transitions, 2255 flow [2024-06-20 18:33:05,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:33:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:33:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-20 18:33:05,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4201388888888889 [2024-06-20 18:33:05,533 INFO L175 Difference]: Start difference. First operand has 156 places, 139 transitions, 1485 flow. Second operand 9 states and 121 transitions. [2024-06-20 18:33:05,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 159 transitions, 2255 flow [2024-06-20 18:33:05,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 159 transitions, 2086 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-20 18:33:05,594 INFO L231 Difference]: Finished difference. Result has 159 places, 147 transitions, 1582 flow [2024-06-20 18:33:05,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1582, PETRI_PLACES=159, PETRI_TRANSITIONS=147} [2024-06-20 18:33:05,594 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 128 predicate places. [2024-06-20 18:33:05,594 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 147 transitions, 1582 flow [2024-06-20 18:33:05,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:33:05,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:33:05,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:33:05,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 18:33:05,595 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:33:05,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:33:05,595 INFO L85 PathProgramCache]: Analyzing trace with hash 382735902, now seen corresponding path program 9 times [2024-06-20 18:33:05,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:33:05,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153608371] [2024-06-20 18:33:05,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:33:05,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:33:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:33:14,160 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-20 18:33:14,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:33:14,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153608371] [2024-06-20 18:33:14,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153608371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:33:14,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:33:14,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:33:14,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412713840] [2024-06-20 18:33:14,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:33:14,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:33:14,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:33:14,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:33:14,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:33:14,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:33:14,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 147 transitions, 1582 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:33:14,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:33:14,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:33:14,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:33:14,630 INFO L124 PetriNetUnfolderBase]: 340/609 cut-off events. [2024-06-20 18:33:14,630 INFO L125 PetriNetUnfolderBase]: For 45707/45710 co-relation queries the response was YES. [2024-06-20 18:33:14,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5159 conditions, 609 events. 340/609 cut-off events. For 45707/45710 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2614 event pairs, 49 based on Foata normal form. 2/608 useless extension candidates. Maximal degree in co-relation 5081. Up to 512 conditions per place. [2024-06-20 18:33:14,635 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 130 selfloop transitions, 27 changer transitions 0/160 dead transitions. [2024-06-20 18:33:14,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 160 transitions, 1994 flow [2024-06-20 18:33:14,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:33:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:33:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-20 18:33:14,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-20 18:33:14,636 INFO L175 Difference]: Start difference. First operand has 159 places, 147 transitions, 1582 flow. Second operand 9 states and 114 transitions. [2024-06-20 18:33:14,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 160 transitions, 1994 flow [2024-06-20 18:33:14,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 160 transitions, 1935 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-20 18:33:14,699 INFO L231 Difference]: Finished difference. Result has 165 places, 149 transitions, 1625 flow [2024-06-20 18:33:14,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1625, PETRI_PLACES=165, PETRI_TRANSITIONS=149} [2024-06-20 18:33:14,700 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 134 predicate places. [2024-06-20 18:33:14,700 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 149 transitions, 1625 flow [2024-06-20 18:33:14,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:33:14,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:33:14,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:33:14,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 18:33:14,701 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:33:14,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:33:14,701 INFO L85 PathProgramCache]: Analyzing trace with hash 920746612, now seen corresponding path program 9 times [2024-06-20 18:33:14,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:33:14,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691909965] [2024-06-20 18:33:14,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:33:14,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:33:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:33:22,766 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-20 18:33:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:33:22,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691909965] [2024-06-20 18:33:22,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691909965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:33:22,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:33:22,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:33:22,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435800395] [2024-06-20 18:33:22,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:33:22,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:33:22,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:33:22,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:33:22,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:33:22,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:33:22,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 149 transitions, 1625 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:33:22,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:33:22,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:33:22,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:33:23,304 INFO L124 PetriNetUnfolderBase]: 341/611 cut-off events. [2024-06-20 18:33:23,304 INFO L125 PetriNetUnfolderBase]: For 45871/45874 co-relation queries the response was YES. [2024-06-20 18:33:23,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5173 conditions, 611 events. 341/611 cut-off events. For 45871/45874 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2623 event pairs, 45 based on Foata normal form. 2/610 useless extension candidates. Maximal degree in co-relation 5093. Up to 544 conditions per place. [2024-06-20 18:33:23,310 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 135 selfloop transitions, 22 changer transitions 0/160 dead transitions. [2024-06-20 18:33:23,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 160 transitions, 1997 flow [2024-06-20 18:33:23,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:33:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:33:23,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-20 18:33:23,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-20 18:33:23,311 INFO L175 Difference]: Start difference. First operand has 165 places, 149 transitions, 1625 flow. Second operand 9 states and 110 transitions. [2024-06-20 18:33:23,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 160 transitions, 1997 flow [2024-06-20 18:33:23,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 160 transitions, 1881 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-20 18:33:23,371 INFO L231 Difference]: Finished difference. Result has 167 places, 151 transitions, 1601 flow [2024-06-20 18:33:23,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1509, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1601, PETRI_PLACES=167, PETRI_TRANSITIONS=151} [2024-06-20 18:33:23,371 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-20 18:33:23,371 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 151 transitions, 1601 flow [2024-06-20 18:33:23,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:33:23,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:33:23,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:33:23,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 18:33:23,372 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:33:23,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:33:23,373 INFO L85 PathProgramCache]: Analyzing trace with hash 929029502, now seen corresponding path program 3 times [2024-06-20 18:33:23,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:33:23,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448087891] [2024-06-20 18:33:23,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:33:23,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:33:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:33:31,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-20 18:33:31,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:33:31,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448087891] [2024-06-20 18:33:31,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448087891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:33:31,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:33:31,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:33:31,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771838485] [2024-06-20 18:33:31,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:33:31,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:33:31,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:33:31,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:33:31,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:33:31,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-20 18:33:31,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 151 transitions, 1601 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-20 18:33:31,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:33:31,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-20 18:33:31,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:33:32,124 INFO L124 PetriNetUnfolderBase]: 329/601 cut-off events. [2024-06-20 18:33:32,124 INFO L125 PetriNetUnfolderBase]: For 46029/46032 co-relation queries the response was YES. [2024-06-20 18:33:32,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5036 conditions, 601 events. 329/601 cut-off events. For 46029/46032 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2645 event pairs, 41 based on Foata normal form. 3/601 useless extension candidates. Maximal degree in co-relation 4955. Up to 449 conditions per place. [2024-06-20 18:33:32,129 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 100 selfloop transitions, 30 changer transitions 0/162 dead transitions. [2024-06-20 18:33:32,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 162 transitions, 2019 flow [2024-06-20 18:33:32,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:33:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:33:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-20 18:33:32,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46484375 [2024-06-20 18:33:32,132 INFO L175 Difference]: Start difference. First operand has 167 places, 151 transitions, 1601 flow. Second operand 8 states and 119 transitions. [2024-06-20 18:33:32,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 162 transitions, 2019 flow [2024-06-20 18:33:32,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 162 transitions, 1951 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-20 18:33:32,197 INFO L231 Difference]: Finished difference. Result has 168 places, 153 transitions, 1631 flow [2024-06-20 18:33:32,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1533, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1631, PETRI_PLACES=168, PETRI_TRANSITIONS=153} [2024-06-20 18:33:32,198 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 137 predicate places. [2024-06-20 18:33:32,198 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 153 transitions, 1631 flow [2024-06-20 18:33:32,198 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-20 18:33:32,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:33:32,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:33:32,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 18:33:32,199 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:33:32,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:33:32,199 INFO L85 PathProgramCache]: Analyzing trace with hash 668369840, now seen corresponding path program 10 times [2024-06-20 18:33:32,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:33:32,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552493307] [2024-06-20 18:33:32,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:33:32,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:33:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:33:41,567 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-20 18:33:41,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:33:41,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552493307] [2024-06-20 18:33:41,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552493307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:33:41,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:33:41,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:33:41,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9331519] [2024-06-20 18:33:41,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:33:41,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:33:41,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:33:41,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:33:41,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:33:41,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:33:41,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 153 transitions, 1631 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:33:41,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:33:41,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:33:41,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:33:42,042 INFO L124 PetriNetUnfolderBase]: 346/619 cut-off events. [2024-06-20 18:33:42,042 INFO L125 PetriNetUnfolderBase]: For 47040/47040 co-relation queries the response was YES. [2024-06-20 18:33:42,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5169 conditions, 619 events. 346/619 cut-off events. For 47040/47040 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2675 event pairs, 37 based on Foata normal form. 2/619 useless extension candidates. Maximal degree in co-relation 5087. Up to 568 conditions per place. [2024-06-20 18:33:42,050 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 145 selfloop transitions, 17 changer transitions 0/165 dead transitions. [2024-06-20 18:33:42,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 165 transitions, 2119 flow [2024-06-20 18:33:42,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:33:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:33:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-20 18:33:42,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3784722222222222 [2024-06-20 18:33:42,051 INFO L175 Difference]: Start difference. First operand has 168 places, 153 transitions, 1631 flow. Second operand 9 states and 109 transitions. [2024-06-20 18:33:42,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 165 transitions, 2119 flow [2024-06-20 18:33:42,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 165 transitions, 2012 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-20 18:33:42,123 INFO L231 Difference]: Finished difference. Result has 170 places, 155 transitions, 1605 flow [2024-06-20 18:33:42,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1526, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1605, PETRI_PLACES=170, PETRI_TRANSITIONS=155} [2024-06-20 18:33:42,124 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 139 predicate places. [2024-06-20 18:33:42,124 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 155 transitions, 1605 flow [2024-06-20 18:33:42,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:33:42,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:33:42,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:33:42,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 18:33:42,124 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:33:42,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:33:42,125 INFO L85 PathProgramCache]: Analyzing trace with hash 382742412, now seen corresponding path program 10 times [2024-06-20 18:33:42,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:33:42,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407966647] [2024-06-20 18:33:42,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:33:42,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:33:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:33:52,001 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-20 18:33:52,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:33:52,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407966647] [2024-06-20 18:33:52,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407966647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:33:52,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:33:52,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:33:52,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258762947] [2024-06-20 18:33:52,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:33:52,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:33:52,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:33:52,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:33:52,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:33:52,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:33:52,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 155 transitions, 1605 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:33:52,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:33:52,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:33:52,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:33:52,511 INFO L124 PetriNetUnfolderBase]: 344/617 cut-off events. [2024-06-20 18:33:52,511 INFO L125 PetriNetUnfolderBase]: For 44666/44669 co-relation queries the response was YES. [2024-06-20 18:33:52,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5036 conditions, 617 events. 344/617 cut-off events. For 44666/44669 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2675 event pairs, 49 based on Foata normal form. 1/615 useless extension candidates. Maximal degree in co-relation 4954. Up to 514 conditions per place. [2024-06-20 18:33:52,517 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 133 selfloop transitions, 30 changer transitions 0/166 dead transitions. [2024-06-20 18:33:52,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 166 transitions, 1991 flow [2024-06-20 18:33:52,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:33:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:33:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-20 18:33:52,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-20 18:33:52,527 INFO L175 Difference]: Start difference. First operand has 170 places, 155 transitions, 1605 flow. Second operand 9 states and 116 transitions. [2024-06-20 18:33:52,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 166 transitions, 1991 flow [2024-06-20 18:33:52,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 166 transitions, 1907 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-20 18:33:52,591 INFO L231 Difference]: Finished difference. Result has 172 places, 155 transitions, 1586 flow [2024-06-20 18:33:52,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1521, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1586, PETRI_PLACES=172, PETRI_TRANSITIONS=155} [2024-06-20 18:33:52,591 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 141 predicate places. [2024-06-20 18:33:52,592 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 155 transitions, 1586 flow [2024-06-20 18:33:52,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:33:52,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:33:52,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:33:52,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 18:33:52,592 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:33:52,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:33:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash 678201180, now seen corresponding path program 4 times [2024-06-20 18:33:52,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:33:52,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597490838] [2024-06-20 18:33:52,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:33:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:33:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:34:02,671 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-20 18:34:02,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:34:02,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597490838] [2024-06-20 18:34:02,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597490838] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:34:02,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:34:02,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:34:02,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016558195] [2024-06-20 18:34:02,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:34:02,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:34:02,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:34:02,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:34:02,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:34:02,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:34:02,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 155 transitions, 1586 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 18:34:02,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:34:02,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:34:02,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:34:03,335 INFO L124 PetriNetUnfolderBase]: 332/606 cut-off events. [2024-06-20 18:34:03,335 INFO L125 PetriNetUnfolderBase]: For 45929/45929 co-relation queries the response was YES. [2024-06-20 18:34:03,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4956 conditions, 606 events. 332/606 cut-off events. For 45929/45929 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2665 event pairs, 37 based on Foata normal form. 1/605 useless extension candidates. Maximal degree in co-relation 4873. Up to 494 conditions per place. [2024-06-20 18:34:03,340 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 117 selfloop transitions, 17 changer transitions 0/167 dead transitions. [2024-06-20 18:34:03,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 167 transitions, 2018 flow [2024-06-20 18:34:03,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:34:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:34:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-20 18:34:03,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-20 18:34:03,341 INFO L175 Difference]: Start difference. First operand has 172 places, 155 transitions, 1586 flow. Second operand 9 states and 116 transitions. [2024-06-20 18:34:03,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 167 transitions, 2018 flow [2024-06-20 18:34:03,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 167 transitions, 1942 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 18:34:03,404 INFO L231 Difference]: Finished difference. Result has 173 places, 157 transitions, 1581 flow [2024-06-20 18:34:03,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1581, PETRI_PLACES=173, PETRI_TRANSITIONS=157} [2024-06-20 18:34:03,405 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 142 predicate places. [2024-06-20 18:34:03,405 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 157 transitions, 1581 flow [2024-06-20 18:34:03,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 18:34:03,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:34:03,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:34:03,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 18:34:03,405 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:34:03,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:34:03,406 INFO L85 PathProgramCache]: Analyzing trace with hash 668380380, now seen corresponding path program 5 times [2024-06-20 18:34:03,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:34:03,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457089401] [2024-06-20 18:34:03,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:34:03,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:34:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:34:12,797 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-20 18:34:12,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:34:12,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457089401] [2024-06-20 18:34:12,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457089401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:34:12,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:34:12,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:34:12,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626044909] [2024-06-20 18:34:12,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:34:12,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:34:12,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:34:12,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:34:12,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:34:13,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:34:13,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 157 transitions, 1581 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 18:34:13,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:34:13,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:34:13,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:34:13,466 INFO L124 PetriNetUnfolderBase]: 329/601 cut-off events. [2024-06-20 18:34:13,466 INFO L125 PetriNetUnfolderBase]: For 45885/45885 co-relation queries the response was YES. [2024-06-20 18:34:13,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4855 conditions, 601 events. 329/601 cut-off events. For 45885/45885 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2650 event pairs, 37 based on Foata normal form. 1/600 useless extension candidates. Maximal degree in co-relation 4771. Up to 491 conditions per place. [2024-06-20 18:34:13,472 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 116 selfloop transitions, 18 changer transitions 0/167 dead transitions. [2024-06-20 18:34:13,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 167 transitions, 1871 flow [2024-06-20 18:34:13,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:34:13,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:34:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-20 18:34:13,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-20 18:34:13,473 INFO L175 Difference]: Start difference. First operand has 173 places, 157 transitions, 1581 flow. Second operand 10 states and 125 transitions. [2024-06-20 18:34:13,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 167 transitions, 1871 flow [2024-06-20 18:34:13,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 167 transitions, 1801 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-20 18:34:13,530 INFO L231 Difference]: Finished difference. Result has 176 places, 157 transitions, 1552 flow [2024-06-20 18:34:13,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1552, PETRI_PLACES=176, PETRI_TRANSITIONS=157} [2024-06-20 18:34:13,530 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-20 18:34:13,530 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 157 transitions, 1552 flow [2024-06-20 18:34:13,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 18:34:13,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:34:13,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:34:13,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 18:34:13,531 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:34:13,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:34:13,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1331325824, now seen corresponding path program 1 times [2024-06-20 18:34:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:34:13,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864274743] [2024-06-20 18:34:13,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:34:13,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:34:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:34:22,010 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-20 18:34:22,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:34:22,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864274743] [2024-06-20 18:34:22,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864274743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:34:22,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:34:22,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:34:22,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058761829] [2024-06-20 18:34:22,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:34:22,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:34:22,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:34:22,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:34:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:34:22,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:34:22,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 157 transitions, 1552 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:34:22,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:34:22,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:34:22,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:34:22,683 INFO L124 PetriNetUnfolderBase]: 347/623 cut-off events. [2024-06-20 18:34:22,683 INFO L125 PetriNetUnfolderBase]: For 47571/47571 co-relation queries the response was YES. [2024-06-20 18:34:22,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5032 conditions, 623 events. 347/623 cut-off events. For 47571/47571 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2711 event pairs, 36 based on Foata normal form. 1/622 useless extension candidates. Maximal degree in co-relation 4947. Up to 558 conditions per place. [2024-06-20 18:34:22,688 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 162 selfloop transitions, 16 changer transitions 0/181 dead transitions. [2024-06-20 18:34:22,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 181 transitions, 2010 flow [2024-06-20 18:34:22,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:34:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:34:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-20 18:34:22,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-20 18:34:22,689 INFO L175 Difference]: Start difference. First operand has 176 places, 157 transitions, 1552 flow. Second operand 10 states and 127 transitions. [2024-06-20 18:34:22,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 181 transitions, 2010 flow [2024-06-20 18:34:22,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 181 transitions, 1969 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-20 18:34:22,750 INFO L231 Difference]: Finished difference. Result has 177 places, 159 transitions, 1600 flow [2024-06-20 18:34:22,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1600, PETRI_PLACES=177, PETRI_TRANSITIONS=159} [2024-06-20 18:34:22,751 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 146 predicate places. [2024-06-20 18:34:22,751 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 159 transitions, 1600 flow [2024-06-20 18:34:22,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:34:22,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:34:22,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:34:22,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 18:34:22,752 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:34:22,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:34:22,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1603782001, now seen corresponding path program 1 times [2024-06-20 18:34:22,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:34:22,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155759037] [2024-06-20 18:34:22,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:34:22,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:34:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:34:30,048 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-20 18:34:30,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:34:30,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155759037] [2024-06-20 18:34:30,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155759037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:34:30,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:34:30,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:34:30,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799719164] [2024-06-20 18:34:30,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:34:30,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:34:30,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:34:30,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:34:30,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:34:30,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:34:30,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 159 transitions, 1600 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-20 18:34:30,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:34:30,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:34:30,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:34:30,625 INFO L124 PetriNetUnfolderBase]: 353/633 cut-off events. [2024-06-20 18:34:30,625 INFO L125 PetriNetUnfolderBase]: For 51079/51079 co-relation queries the response was YES. [2024-06-20 18:34:30,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5173 conditions, 633 events. 353/633 cut-off events. For 51079/51079 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2752 event pairs, 35 based on Foata normal form. 2/633 useless extension candidates. Maximal degree in co-relation 5087. Up to 565 conditions per place. [2024-06-20 18:34:30,630 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 161 selfloop transitions, 18 changer transitions 0/182 dead transitions. [2024-06-20 18:34:30,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 182 transitions, 2080 flow [2024-06-20 18:34:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:34:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:34:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-20 18:34:30,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.428125 [2024-06-20 18:34:30,632 INFO L175 Difference]: Start difference. First operand has 177 places, 159 transitions, 1600 flow. Second operand 10 states and 137 transitions. [2024-06-20 18:34:30,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 182 transitions, 2080 flow [2024-06-20 18:34:30,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 182 transitions, 2007 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-20 18:34:30,694 INFO L231 Difference]: Finished difference. Result has 179 places, 162 transitions, 1631 flow [2024-06-20 18:34:30,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1631, PETRI_PLACES=179, PETRI_TRANSITIONS=162} [2024-06-20 18:34:30,695 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 148 predicate places. [2024-06-20 18:34:30,695 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 162 transitions, 1631 flow [2024-06-20 18:34:30,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-20 18:34:30,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:34:30,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:34:30,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 18:34:30,695 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:34:30,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:34:30,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1335050474, now seen corresponding path program 2 times [2024-06-20 18:34:30,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:34:30,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47203688] [2024-06-20 18:34:30,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:34:30,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:34:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:34:41,096 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-20 18:34:41,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:34:41,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47203688] [2024-06-20 18:34:41,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47203688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:34:41,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:34:41,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:34:41,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693082838] [2024-06-20 18:34:41,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:34:41,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:34:41,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:34:41,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:34:41,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:34:41,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:34:41,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 162 transitions, 1631 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:34:41,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:34:41,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:34:41,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:34:41,818 INFO L124 PetriNetUnfolderBase]: 356/640 cut-off events. [2024-06-20 18:34:41,818 INFO L125 PetriNetUnfolderBase]: For 51679/51679 co-relation queries the response was YES. [2024-06-20 18:34:41,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5284 conditions, 640 events. 356/640 cut-off events. For 51679/51679 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2803 event pairs, 35 based on Foata normal form. 1/639 useless extension candidates. Maximal degree in co-relation 5197. Up to 573 conditions per place. [2024-06-20 18:34:41,824 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 164 selfloop transitions, 17 changer transitions 0/184 dead transitions. [2024-06-20 18:34:41,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 184 transitions, 2115 flow [2024-06-20 18:34:41,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:34:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:34:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-20 18:34:41,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-20 18:34:41,825 INFO L175 Difference]: Start difference. First operand has 179 places, 162 transitions, 1631 flow. Second operand 10 states and 126 transitions. [2024-06-20 18:34:41,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 184 transitions, 2115 flow [2024-06-20 18:34:41,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 184 transitions, 2033 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-20 18:34:41,889 INFO L231 Difference]: Finished difference. Result has 181 places, 164 transitions, 1646 flow [2024-06-20 18:34:41,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1549, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1646, PETRI_PLACES=181, PETRI_TRANSITIONS=164} [2024-06-20 18:34:41,890 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 150 predicate places. [2024-06-20 18:34:41,890 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 164 transitions, 1646 flow [2024-06-20 18:34:41,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:34:41,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:34:41,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:34:41,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 18:34:41,890 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:34:41,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:34:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1478941004, now seen corresponding path program 3 times [2024-06-20 18:34:41,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:34:41,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582386796] [2024-06-20 18:34:41,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:34:41,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:34:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:34:51,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-20 18:34:51,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:34:51,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582386796] [2024-06-20 18:34:51,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582386796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:34:51,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:34:51,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:34:51,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746453358] [2024-06-20 18:34:51,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:34:51,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:34:51,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:34:51,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:34:51,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:34:52,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:34:52,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 164 transitions, 1646 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:34:52,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:34:52,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:34:52,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:34:52,713 INFO L124 PetriNetUnfolderBase]: 359/647 cut-off events. [2024-06-20 18:34:52,714 INFO L125 PetriNetUnfolderBase]: For 53846/53846 co-relation queries the response was YES. [2024-06-20 18:34:52,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5347 conditions, 647 events. 359/647 cut-off events. For 53846/53846 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2888 event pairs, 35 based on Foata normal form. 1/646 useless extension candidates. Maximal degree in co-relation 5259. Up to 569 conditions per place. [2024-06-20 18:34:52,719 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 164 selfloop transitions, 21 changer transitions 0/188 dead transitions. [2024-06-20 18:34:52,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 188 transitions, 2166 flow [2024-06-20 18:34:52,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:34:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:34:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-20 18:34:52,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-20 18:34:52,721 INFO L175 Difference]: Start difference. First operand has 181 places, 164 transitions, 1646 flow. Second operand 11 states and 138 transitions. [2024-06-20 18:34:52,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 188 transitions, 2166 flow [2024-06-20 18:34:52,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 188 transitions, 2085 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-20 18:34:52,789 INFO L231 Difference]: Finished difference. Result has 184 places, 166 transitions, 1674 flow [2024-06-20 18:34:52,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1565, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1674, PETRI_PLACES=184, PETRI_TRANSITIONS=166} [2024-06-20 18:34:52,790 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2024-06-20 18:34:52,790 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 166 transitions, 1674 flow [2024-06-20 18:34:52,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:34:52,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:34:52,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:34:52,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 18:34:52,791 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:34:52,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:34:52,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1478941221, now seen corresponding path program 2 times [2024-06-20 18:34:52,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:34:52,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161226803] [2024-06-20 18:34:52,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:34:52,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:34:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:35:01,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-20 18:35:01,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:35:01,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161226803] [2024-06-20 18:35:01,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161226803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:35:01,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:35:01,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:35:01,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818004996] [2024-06-20 18:35:01,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:35:01,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:35:01,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:35:01,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:35:01,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:35:01,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:35:01,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 166 transitions, 1674 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:35:01,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:35:01,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:35:01,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:35:01,807 INFO L124 PetriNetUnfolderBase]: 365/657 cut-off events. [2024-06-20 18:35:01,807 INFO L125 PetriNetUnfolderBase]: For 57553/57553 co-relation queries the response was YES. [2024-06-20 18:35:01,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5458 conditions, 657 events. 365/657 cut-off events. For 57553/57553 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2928 event pairs, 35 based on Foata normal form. 2/657 useless extension candidates. Maximal degree in co-relation 5369. Up to 576 conditions per place. [2024-06-20 18:35:01,812 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 163 selfloop transitions, 21 changer transitions 0/187 dead transitions. [2024-06-20 18:35:01,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 187 transitions, 2190 flow [2024-06-20 18:35:01,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:35:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:35:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-20 18:35:01,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-20 18:35:01,822 INFO L175 Difference]: Start difference. First operand has 184 places, 166 transitions, 1674 flow. Second operand 10 states and 127 transitions. [2024-06-20 18:35:01,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 187 transitions, 2190 flow [2024-06-20 18:35:01,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 187 transitions, 2097 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-20 18:35:01,894 INFO L231 Difference]: Finished difference. Result has 185 places, 169 transitions, 1701 flow [2024-06-20 18:35:01,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1581, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1701, PETRI_PLACES=185, PETRI_TRANSITIONS=169} [2024-06-20 18:35:01,895 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 154 predicate places. [2024-06-20 18:35:01,895 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 169 transitions, 1701 flow [2024-06-20 18:35:01,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:35:01,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:35:01,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:35:01,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 18:35:01,895 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:35:01,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:35:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1479143031, now seen corresponding path program 3 times [2024-06-20 18:35:01,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:35:01,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361706946] [2024-06-20 18:35:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:35:01,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:35:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:35:11,166 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-20 18:35:11,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:35:11,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361706946] [2024-06-20 18:35:11,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361706946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:35:11,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:35:11,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:35:11,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186622009] [2024-06-20 18:35:11,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:35:11,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:35:11,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:35:11,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:35:11,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:35:11,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:35:11,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 169 transitions, 1701 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:35:11,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:35:11,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:35:11,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:35:11,816 INFO L124 PetriNetUnfolderBase]: 391/699 cut-off events. [2024-06-20 18:35:11,816 INFO L125 PetriNetUnfolderBase]: For 67279/67279 co-relation queries the response was YES. [2024-06-20 18:35:11,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6088 conditions, 699 events. 391/699 cut-off events. For 67279/67279 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3150 event pairs, 34 based on Foata normal form. 2/699 useless extension candidates. Maximal degree in co-relation 5998. Up to 565 conditions per place. [2024-06-20 18:35:11,827 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 160 selfloop transitions, 35 changer transitions 0/198 dead transitions. [2024-06-20 18:35:11,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 198 transitions, 2586 flow [2024-06-20 18:35:11,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:35:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:35:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-20 18:35:11,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-20 18:35:11,829 INFO L175 Difference]: Start difference. First operand has 185 places, 169 transitions, 1701 flow. Second operand 10 states and 133 transitions. [2024-06-20 18:35:11,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 198 transitions, 2586 flow [2024-06-20 18:35:11,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 198 transitions, 2488 flow, removed 30 selfloop flow, removed 8 redundant places. [2024-06-20 18:35:11,917 INFO L231 Difference]: Finished difference. Result has 188 places, 177 transitions, 1862 flow [2024-06-20 18:35:11,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1603, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1862, PETRI_PLACES=188, PETRI_TRANSITIONS=177} [2024-06-20 18:35:11,919 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 157 predicate places. [2024-06-20 18:35:11,919 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 177 transitions, 1862 flow [2024-06-20 18:35:11,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:35:11,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:35:11,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:35:11,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 18:35:11,919 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:35:11,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:35:11,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1479142814, now seen corresponding path program 4 times [2024-06-20 18:35:11,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:35:11,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131067169] [2024-06-20 18:35:11,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:35:11,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:35:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:35:24,860 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-20 18:35:24,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:35:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131067169] [2024-06-20 18:35:24,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131067169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:35:24,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:35:24,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:35:24,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52571139] [2024-06-20 18:35:24,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:35:24,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:35:24,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:35:24,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:35:24,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:35:25,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-20 18:35:25,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 177 transitions, 1862 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:35:25,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:35:25,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-20 18:35:25,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:35:25,525 INFO L124 PetriNetUnfolderBase]: 394/706 cut-off events. [2024-06-20 18:35:25,525 INFO L125 PetriNetUnfolderBase]: For 68505/68505 co-relation queries the response was YES. [2024-06-20 18:35:25,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6254 conditions, 706 events. 394/706 cut-off events. For 68505/68505 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3197 event pairs, 35 based on Foata normal form. 1/705 useless extension candidates. Maximal degree in co-relation 6162. Up to 608 conditions per place. [2024-06-20 18:35:25,532 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 167 selfloop transitions, 29 changer transitions 0/199 dead transitions. [2024-06-20 18:35:25,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 199 transitions, 2368 flow [2024-06-20 18:35:25,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:35:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:35:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-20 18:35:25,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36079545454545453 [2024-06-20 18:35:25,533 INFO L175 Difference]: Start difference. First operand has 188 places, 177 transitions, 1862 flow. Second operand 11 states and 127 transitions. [2024-06-20 18:35:25,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 199 transitions, 2368 flow [2024-06-20 18:35:25,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 199 transitions, 2300 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-20 18:35:25,631 INFO L231 Difference]: Finished difference. Result has 195 places, 179 transitions, 1927 flow [2024-06-20 18:35:25,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1794, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1927, PETRI_PLACES=195, PETRI_TRANSITIONS=179} [2024-06-20 18:35:25,632 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 164 predicate places. [2024-06-20 18:35:25,632 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 179 transitions, 1927 flow [2024-06-20 18:35:25,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:35:25,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:35:25,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:35:25,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 18:35:25,633 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:35:25,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:35:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1479150471, now seen corresponding path program 4 times [2024-06-20 18:35:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:35:25,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839638799] [2024-06-20 18:35:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:35:25,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:35:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:35:36,294 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-20 18:35:36,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:35:36,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839638799] [2024-06-20 18:35:36,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839638799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:35:36,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:35:36,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:35:36,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021374928] [2024-06-20 18:35:36,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:35:36,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:35:36,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:35:36,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:35:36,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:35:36,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:35:36,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 179 transitions, 1927 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:35:36,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:35:36,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:35:36,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:35:36,923 INFO L124 PetriNetUnfolderBase]: 392/703 cut-off events. [2024-06-20 18:35:36,924 INFO L125 PetriNetUnfolderBase]: For 67865/67865 co-relation queries the response was YES. [2024-06-20 18:35:36,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6189 conditions, 703 events. 392/703 cut-off events. For 67865/67865 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3176 event pairs, 35 based on Foata normal form. 1/702 useless extension candidates. Maximal degree in co-relation 6095. Up to 593 conditions per place. [2024-06-20 18:35:36,931 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 165 selfloop transitions, 36 changer transitions 0/204 dead transitions. [2024-06-20 18:35:36,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 204 transitions, 2457 flow [2024-06-20 18:35:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:35:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:35:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-20 18:35:36,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-20 18:35:36,932 INFO L175 Difference]: Start difference. First operand has 195 places, 179 transitions, 1927 flow. Second operand 11 states and 140 transitions. [2024-06-20 18:35:36,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 204 transitions, 2457 flow [2024-06-20 18:35:37,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 204 transitions, 2340 flow, removed 31 selfloop flow, removed 9 redundant places. [2024-06-20 18:35:37,052 INFO L231 Difference]: Finished difference. Result has 198 places, 184 transitions, 1989 flow [2024-06-20 18:35:37,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1989, PETRI_PLACES=198, PETRI_TRANSITIONS=184} [2024-06-20 18:35:37,053 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 167 predicate places. [2024-06-20 18:35:37,053 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 184 transitions, 1989 flow [2024-06-20 18:35:37,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:35:37,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:35:37,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:35:37,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 18:35:37,054 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:35:37,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:35:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1756447691, now seen corresponding path program 5 times [2024-06-20 18:35:37,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:35:37,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997208650] [2024-06-20 18:35:37,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:35:37,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:35:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:35:45,432 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-20 18:35:45,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:35:45,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997208650] [2024-06-20 18:35:45,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997208650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:35:45,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:35:45,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:35:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308599996] [2024-06-20 18:35:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:35:45,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:35:45,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:35:45,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:35:45,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:35:45,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:35:45,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 184 transitions, 1989 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:35:45,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:35:45,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:35:45,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:35:46,099 INFO L124 PetriNetUnfolderBase]: 415/740 cut-off events. [2024-06-20 18:35:46,100 INFO L125 PetriNetUnfolderBase]: For 78339/78339 co-relation queries the response was YES. [2024-06-20 18:35:46,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6858 conditions, 740 events. 415/740 cut-off events. For 78339/78339 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3380 event pairs, 35 based on Foata normal form. 1/739 useless extension candidates. Maximal degree in co-relation 6762. Up to 562 conditions per place. [2024-06-20 18:35:46,106 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 156 selfloop transitions, 56 changer transitions 0/215 dead transitions. [2024-06-20 18:35:46,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 215 transitions, 3104 flow [2024-06-20 18:35:46,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:35:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:35:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-20 18:35:46,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119318181818182 [2024-06-20 18:35:46,108 INFO L175 Difference]: Start difference. First operand has 198 places, 184 transitions, 1989 flow. Second operand 11 states and 145 transitions. [2024-06-20 18:35:46,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 215 transitions, 3104 flow [2024-06-20 18:35:46,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 215 transitions, 3019 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-20 18:35:46,228 INFO L231 Difference]: Finished difference. Result has 203 places, 195 transitions, 2316 flow [2024-06-20 18:35:46,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1904, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2316, PETRI_PLACES=203, PETRI_TRANSITIONS=195} [2024-06-20 18:35:46,229 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 172 predicate places. [2024-06-20 18:35:46,229 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 195 transitions, 2316 flow [2024-06-20 18:35:46,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:35:46,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:35:46,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:35:46,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-20 18:35:46,230 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:35:46,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:35:46,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1487723821, now seen corresponding path program 6 times [2024-06-20 18:35:46,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:35:46,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526518621] [2024-06-20 18:35:46,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:35:46,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:35:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:35:54,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-20 18:35:54,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:35:54,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526518621] [2024-06-20 18:35:54,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526518621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:35:54,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:35:54,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:35:54,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145611321] [2024-06-20 18:35:54,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:35:54,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:35:54,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:35:54,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:35:54,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:35:54,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:35:54,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 195 transitions, 2316 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-20 18:35:54,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:35:54,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:35:54,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:35:54,958 INFO L124 PetriNetUnfolderBase]: 413/737 cut-off events. [2024-06-20 18:35:54,958 INFO L125 PetriNetUnfolderBase]: For 79369/79369 co-relation queries the response was YES. [2024-06-20 18:35:54,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6967 conditions, 737 events. 413/737 cut-off events. For 79369/79369 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3372 event pairs, 35 based on Foata normal form. 1/736 useless extension candidates. Maximal degree in co-relation 6868. Up to 560 conditions per place. [2024-06-20 18:35:54,965 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 151 selfloop transitions, 56 changer transitions 0/210 dead transitions. [2024-06-20 18:35:54,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 210 transitions, 3028 flow [2024-06-20 18:35:54,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:35:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:35:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2024-06-20 18:35:54,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.440625 [2024-06-20 18:35:54,967 INFO L175 Difference]: Start difference. First operand has 203 places, 195 transitions, 2316 flow. Second operand 10 states and 141 transitions. [2024-06-20 18:35:54,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 210 transitions, 3028 flow [2024-06-20 18:35:55,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 210 transitions, 2864 flow, removed 67 selfloop flow, removed 5 redundant places. [2024-06-20 18:35:55,097 INFO L231 Difference]: Finished difference. Result has 208 places, 195 transitions, 2269 flow [2024-06-20 18:35:55,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2152, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2269, PETRI_PLACES=208, PETRI_TRANSITIONS=195} [2024-06-20 18:35:55,098 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 177 predicate places. [2024-06-20 18:35:55,098 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 195 transitions, 2269 flow [2024-06-20 18:35:55,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-20 18:35:55,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:35:55,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:35:55,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-20 18:35:55,098 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:35:55,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:35:55,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1756455348, now seen corresponding path program 5 times [2024-06-20 18:35:55,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:35:55,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453066213] [2024-06-20 18:35:55,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:35:55,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:35:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:36:09,121 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-20 18:36:09,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:36:09,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453066213] [2024-06-20 18:36:09,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453066213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:36:09,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:36:09,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:36:09,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350708114] [2024-06-20 18:36:09,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:36:09,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:36:09,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:36:09,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:36:09,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:36:09,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:36:09,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 195 transitions, 2269 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:09,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:36:09,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:36:09,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:09,731 INFO L124 PetriNetUnfolderBase]: 421/754 cut-off events. [2024-06-20 18:36:09,732 INFO L125 PetriNetUnfolderBase]: For 84791/84791 co-relation queries the response was YES. [2024-06-20 18:36:09,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7207 conditions, 754 events. 421/754 cut-off events. For 84791/84791 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3483 event pairs, 35 based on Foata normal form. 1/753 useless extension candidates. Maximal degree in co-relation 7107. Up to 610 conditions per place. [2024-06-20 18:36:09,739 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 170 selfloop transitions, 44 changer transitions 0/217 dead transitions. [2024-06-20 18:36:09,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 217 transitions, 3017 flow [2024-06-20 18:36:09,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:36:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:36:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-20 18:36:09,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-20 18:36:09,763 INFO L175 Difference]: Start difference. First operand has 208 places, 195 transitions, 2269 flow. Second operand 11 states and 139 transitions. [2024-06-20 18:36:09,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 217 transitions, 3017 flow [2024-06-20 18:36:09,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 217 transitions, 2914 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 18:36:09,914 INFO L231 Difference]: Finished difference. Result has 213 places, 199 transitions, 2407 flow [2024-06-20 18:36:09,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2407, PETRI_PLACES=213, PETRI_TRANSITIONS=199} [2024-06-20 18:36:09,914 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2024-06-20 18:36:09,915 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 199 transitions, 2407 flow [2024-06-20 18:36:09,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:09,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:09,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:09,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-20 18:36:09,915 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:36:09,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:09,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1756188221, now seen corresponding path program 7 times [2024-06-20 18:36:09,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:09,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15833236] [2024-06-20 18:36:09,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:09,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:36:18,533 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-20 18:36:18,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:36:18,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15833236] [2024-06-20 18:36:18,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15833236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:36:18,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:36:18,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:36:18,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650788346] [2024-06-20 18:36:18,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:36:18,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:36:18,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:36:18,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:36:18,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:36:18,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:36:18,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 199 transitions, 2407 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:18,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:36:18,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:36:18,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:19,094 INFO L124 PetriNetUnfolderBase]: 419/751 cut-off events. [2024-06-20 18:36:19,095 INFO L125 PetriNetUnfolderBase]: For 85148/85148 co-relation queries the response was YES. [2024-06-20 18:36:19,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7157 conditions, 751 events. 419/751 cut-off events. For 85148/85148 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3467 event pairs, 35 based on Foata normal form. 1/750 useless extension candidates. Maximal degree in co-relation 7056. Up to 571 conditions per place. [2024-06-20 18:36:19,101 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 151 selfloop transitions, 63 changer transitions 0/217 dead transitions. [2024-06-20 18:36:19,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 217 transitions, 3013 flow [2024-06-20 18:36:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:36:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:36:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-20 18:36:19,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2024-06-20 18:36:19,104 INFO L175 Difference]: Start difference. First operand has 213 places, 199 transitions, 2407 flow. Second operand 11 states and 142 transitions. [2024-06-20 18:36:19,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 217 transitions, 3013 flow [2024-06-20 18:36:19,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 217 transitions, 2883 flow, removed 50 selfloop flow, removed 7 redundant places. [2024-06-20 18:36:19,243 INFO L231 Difference]: Finished difference. Result has 217 places, 199 transitions, 2408 flow [2024-06-20 18:36:19,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2277, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2408, PETRI_PLACES=217, PETRI_TRANSITIONS=199} [2024-06-20 18:36:19,243 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-20 18:36:19,243 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 199 transitions, 2408 flow [2024-06-20 18:36:19,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:19,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:19,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:19,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-20 18:36:19,244 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:36:19,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:19,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1598653669, now seen corresponding path program 1 times [2024-06-20 18:36:19,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:19,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293057037] [2024-06-20 18:36:19,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:19,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:36:29,166 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-20 18:36:29,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:36:29,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293057037] [2024-06-20 18:36:29,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293057037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:36:29,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:36:29,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:36:29,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817548642] [2024-06-20 18:36:29,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:36:29,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:36:29,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:36:29,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:36:29,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:36:29,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:36:29,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 199 transitions, 2408 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:29,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:36:29,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:36:29,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:29,793 INFO L124 PetriNetUnfolderBase]: 402/738 cut-off events. [2024-06-20 18:36:29,793 INFO L125 PetriNetUnfolderBase]: For 89590/89590 co-relation queries the response was YES. [2024-06-20 18:36:29,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7143 conditions, 738 events. 402/738 cut-off events. For 89590/89590 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3515 event pairs, 35 based on Foata normal form. 2/738 useless extension candidates. Maximal degree in co-relation 7040. Up to 610 conditions per place. [2024-06-20 18:36:29,800 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 166 selfloop transitions, 15 changer transitions 0/214 dead transitions. [2024-06-20 18:36:29,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 214 transitions, 2824 flow [2024-06-20 18:36:29,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:36:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:36:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-20 18:36:29,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-20 18:36:29,802 INFO L175 Difference]: Start difference. First operand has 217 places, 199 transitions, 2408 flow. Second operand 10 states and 127 transitions. [2024-06-20 18:36:29,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 214 transitions, 2824 flow [2024-06-20 18:36:29,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 214 transitions, 2713 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-20 18:36:29,936 INFO L231 Difference]: Finished difference. Result has 218 places, 200 transitions, 2355 flow [2024-06-20 18:36:29,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2297, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2355, PETRI_PLACES=218, PETRI_TRANSITIONS=200} [2024-06-20 18:36:29,938 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 187 predicate places. [2024-06-20 18:36:29,938 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 200 transitions, 2355 flow [2024-06-20 18:36:29,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:29,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:29,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:29,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-20 18:36:29,939 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:36:29,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:29,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1763597531, now seen corresponding path program 8 times [2024-06-20 18:36:29,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:29,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341750382] [2024-06-20 18:36:29,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:29,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:36:39,261 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-20 18:36:39,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:36:39,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341750382] [2024-06-20 18:36:39,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341750382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:36:39,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:36:39,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:36:39,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316778651] [2024-06-20 18:36:39,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:36:39,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:36:39,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:36:39,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:36:39,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:36:39,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:36:39,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 200 transitions, 2355 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:39,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:36:39,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:36:39,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:39,941 INFO L124 PetriNetUnfolderBase]: 426/764 cut-off events. [2024-06-20 18:36:39,941 INFO L125 PetriNetUnfolderBase]: For 88969/88969 co-relation queries the response was YES. [2024-06-20 18:36:39,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7269 conditions, 764 events. 426/764 cut-off events. For 88969/88969 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3569 event pairs, 35 based on Foata normal form. 1/763 useless extension candidates. Maximal degree in co-relation 7165. Up to 649 conditions per place. [2024-06-20 18:36:39,949 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 185 selfloop transitions, 32 changer transitions 0/220 dead transitions. [2024-06-20 18:36:39,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 220 transitions, 3019 flow [2024-06-20 18:36:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:36:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:36:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-20 18:36:39,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2024-06-20 18:36:39,950 INFO L175 Difference]: Start difference. First operand has 218 places, 200 transitions, 2355 flow. Second operand 11 states and 142 transitions. [2024-06-20 18:36:39,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 220 transitions, 3019 flow [2024-06-20 18:36:40,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 220 transitions, 2971 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-20 18:36:40,118 INFO L231 Difference]: Finished difference. Result has 221 places, 202 transitions, 2424 flow [2024-06-20 18:36:40,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2307, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2424, PETRI_PLACES=221, PETRI_TRANSITIONS=202} [2024-06-20 18:36:40,119 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 190 predicate places. [2024-06-20 18:36:40,119 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 202 transitions, 2424 flow [2024-06-20 18:36:40,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:40,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:40,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:40,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-20 18:36:40,119 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:36:40,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:40,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1591234718, now seen corresponding path program 1 times [2024-06-20 18:36:40,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:40,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306578945] [2024-06-20 18:36:40,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:40,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:36:49,912 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-20 18:36:49,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:36:49,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306578945] [2024-06-20 18:36:49,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306578945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:36:49,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:36:49,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:36:49,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163375624] [2024-06-20 18:36:49,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:36:49,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:36:49,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:36:49,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:36:49,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:36:50,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:36:50,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 202 transitions, 2424 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:50,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:36:50,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:36:50,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:50,534 INFO L124 PetriNetUnfolderBase]: 424/761 cut-off events. [2024-06-20 18:36:50,535 INFO L125 PetriNetUnfolderBase]: For 88549/88549 co-relation queries the response was YES. [2024-06-20 18:36:50,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7224 conditions, 761 events. 424/761 cut-off events. For 88549/88549 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3539 event pairs, 35 based on Foata normal form. 1/760 useless extension candidates. Maximal degree in co-relation 7119. Up to 692 conditions per place. [2024-06-20 18:36:50,542 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 193 selfloop transitions, 19 changer transitions 0/215 dead transitions. [2024-06-20 18:36:50,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 215 transitions, 2878 flow [2024-06-20 18:36:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:36:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:36:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-20 18:36:50,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-20 18:36:50,545 INFO L175 Difference]: Start difference. First operand has 221 places, 202 transitions, 2424 flow. Second operand 10 states and 120 transitions. [2024-06-20 18:36:50,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 215 transitions, 2878 flow [2024-06-20 18:36:50,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 2675 flow, removed 30 selfloop flow, removed 11 redundant places. [2024-06-20 18:36:50,719 INFO L231 Difference]: Finished difference. Result has 220 places, 202 transitions, 2264 flow [2024-06-20 18:36:50,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2264, PETRI_PLACES=220, PETRI_TRANSITIONS=202} [2024-06-20 18:36:50,719 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 189 predicate places. [2024-06-20 18:36:50,719 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 202 transitions, 2264 flow [2024-06-20 18:36:50,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:50,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:50,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:50,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-20 18:36:50,720 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:36:50,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1082296235, now seen corresponding path program 9 times [2024-06-20 18:36:50,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:50,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798402871] [2024-06-20 18:36:50,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:50,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:37:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:37:00,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:37:00,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798402871] [2024-06-20 18:37:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798402871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:37:00,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:37:00,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:37:00,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824940717] [2024-06-20 18:37:00,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:37:00,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:37:00,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:37:00,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:37:00,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:37:00,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:37:00,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 202 transitions, 2264 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:00,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:37:00,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:37:00,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:37:01,433 INFO L124 PetriNetUnfolderBase]: 427/766 cut-off events. [2024-06-20 18:37:01,434 INFO L125 PetriNetUnfolderBase]: For 90857/90857 co-relation queries the response was YES. [2024-06-20 18:37:01,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7113 conditions, 766 events. 427/766 cut-off events. For 90857/90857 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3579 event pairs, 35 based on Foata normal form. 1/765 useless extension candidates. Maximal degree in co-relation 7008. Up to 650 conditions per place. [2024-06-20 18:37:01,441 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 183 selfloop transitions, 32 changer transitions 0/218 dead transitions. [2024-06-20 18:37:01,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 218 transitions, 2910 flow [2024-06-20 18:37:01,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:37:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:37:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-20 18:37:01,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 18:37:01,444 INFO L175 Difference]: Start difference. First operand has 220 places, 202 transitions, 2264 flow. Second operand 10 states and 130 transitions. [2024-06-20 18:37:01,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 218 transitions, 2910 flow [2024-06-20 18:37:01,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 218 transitions, 2836 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-20 18:37:01,606 INFO L231 Difference]: Finished difference. Result has 220 places, 204 transitions, 2299 flow [2024-06-20 18:37:01,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2190, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2299, PETRI_PLACES=220, PETRI_TRANSITIONS=204} [2024-06-20 18:37:01,606 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 189 predicate places. [2024-06-20 18:37:01,606 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 204 transitions, 2299 flow [2024-06-20 18:37:01,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:01,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:37:01,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:37:01,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-20 18:37:01,607 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:37:01,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:37:01,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1082498262, now seen corresponding path program 6 times [2024-06-20 18:37:01,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:37:01,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036008038] [2024-06-20 18:37:01,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:37:01,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:37:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:37:14,651 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-20 18:37:14,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:37:14,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036008038] [2024-06-20 18:37:14,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036008038] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:37:14,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:37:14,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:37:14,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382606959] [2024-06-20 18:37:14,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:37:14,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:37:14,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:37:14,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:37:14,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:37:14,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:37:14,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 204 transitions, 2299 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:14,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:37:14,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:37:14,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:37:15,387 INFO L124 PetriNetUnfolderBase]: 430/773 cut-off events. [2024-06-20 18:37:15,387 INFO L125 PetriNetUnfolderBase]: For 93897/93897 co-relation queries the response was YES. [2024-06-20 18:37:15,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7249 conditions, 773 events. 430/773 cut-off events. For 93897/93897 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3635 event pairs, 35 based on Foata normal form. 1/772 useless extension candidates. Maximal degree in co-relation 7143. Up to 675 conditions per place. [2024-06-20 18:37:15,395 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 195 selfloop transitions, 25 changer transitions 0/223 dead transitions. [2024-06-20 18:37:15,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 223 transitions, 2851 flow [2024-06-20 18:37:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:37:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:37:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-20 18:37:15,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-20 18:37:15,397 INFO L175 Difference]: Start difference. First operand has 220 places, 204 transitions, 2299 flow. Second operand 11 states and 137 transitions. [2024-06-20 18:37:15,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 223 transitions, 2851 flow [2024-06-20 18:37:15,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 223 transitions, 2770 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-20 18:37:15,607 INFO L231 Difference]: Finished difference. Result has 224 places, 206 transitions, 2349 flow [2024-06-20 18:37:15,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2349, PETRI_PLACES=224, PETRI_TRANSITIONS=206} [2024-06-20 18:37:15,607 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 193 predicate places. [2024-06-20 18:37:15,607 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 206 transitions, 2349 flow [2024-06-20 18:37:15,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:15,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:37:15,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:37:15,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-20 18:37:15,608 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:37:15,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:37:15,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1082498045, now seen corresponding path program 10 times [2024-06-20 18:37:15,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:37:15,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35760090] [2024-06-20 18:37:15,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:37:15,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:37:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:37:25,362 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-20 18:37:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:37:25,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35760090] [2024-06-20 18:37:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35760090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:37:25,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:37:25,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:37:25,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202068856] [2024-06-20 18:37:25,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:37:25,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:37:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:37:25,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:37:25,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:37:25,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:37:25,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 206 transitions, 2349 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:25,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:37:25,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:37:25,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:37:25,989 INFO L124 PetriNetUnfolderBase]: 426/767 cut-off events. [2024-06-20 18:37:25,990 INFO L125 PetriNetUnfolderBase]: For 93580/93580 co-relation queries the response was YES. [2024-06-20 18:37:25,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7053 conditions, 767 events. 426/767 cut-off events. For 93580/93580 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3607 event pairs, 35 based on Foata normal form. 2/767 useless extension candidates. Maximal degree in co-relation 6946. Up to 666 conditions per place. [2024-06-20 18:37:25,996 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 191 selfloop transitions, 25 changer transitions 0/219 dead transitions. [2024-06-20 18:37:25,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 219 transitions, 2811 flow [2024-06-20 18:37:25,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:37:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:37:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-20 18:37:25,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-20 18:37:25,997 INFO L175 Difference]: Start difference. First operand has 224 places, 206 transitions, 2349 flow. Second operand 10 states and 126 transitions. [2024-06-20 18:37:25,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 219 transitions, 2811 flow [2024-06-20 18:37:26,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 219 transitions, 2646 flow, removed 59 selfloop flow, removed 9 redundant places. [2024-06-20 18:37:26,176 INFO L231 Difference]: Finished difference. Result has 225 places, 206 transitions, 2240 flow [2024-06-20 18:37:26,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2184, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2240, PETRI_PLACES=225, PETRI_TRANSITIONS=206} [2024-06-20 18:37:26,176 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 194 predicate places. [2024-06-20 18:37:26,177 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 206 transitions, 2240 flow [2024-06-20 18:37:26,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:26,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:37:26,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:37:26,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-20 18:37:26,181 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:37:26,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:37:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1082296452, now seen corresponding path program 7 times [2024-06-20 18:37:26,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:37:26,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764268169] [2024-06-20 18:37:26,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:37:26,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:37:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:37:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:37:40,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:37:40,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764268169] [2024-06-20 18:37:40,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764268169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:37:40,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:37:40,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:37:40,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252501522] [2024-06-20 18:37:40,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:37:40,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:37:40,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:37:40,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:37:40,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:37:40,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-20 18:37:40,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 206 transitions, 2240 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:40,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:37:40,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-20 18:37:40,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:37:40,891 INFO L124 PetriNetUnfolderBase]: 424/764 cut-off events. [2024-06-20 18:37:40,891 INFO L125 PetriNetUnfolderBase]: For 88946/88946 co-relation queries the response was YES. [2024-06-20 18:37:40,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6851 conditions, 764 events. 424/764 cut-off events. For 88946/88946 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3580 event pairs, 35 based on Foata normal form. 1/763 useless extension candidates. Maximal degree in co-relation 6743. Up to 657 conditions per place. [2024-06-20 18:37:40,912 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 191 selfloop transitions, 29 changer transitions 0/223 dead transitions. [2024-06-20 18:37:40,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 223 transitions, 2720 flow [2024-06-20 18:37:40,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:37:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:37:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-20 18:37:40,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-20 18:37:40,916 INFO L175 Difference]: Start difference. First operand has 225 places, 206 transitions, 2240 flow. Second operand 11 states and 128 transitions. [2024-06-20 18:37:40,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 223 transitions, 2720 flow [2024-06-20 18:37:41,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 223 transitions, 2626 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-20 18:37:41,116 INFO L231 Difference]: Finished difference. Result has 226 places, 206 transitions, 2209 flow [2024-06-20 18:37:41,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2146, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2209, PETRI_PLACES=226, PETRI_TRANSITIONS=206} [2024-06-20 18:37:41,117 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 195 predicate places. [2024-06-20 18:37:41,117 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 206 transitions, 2209 flow [2024-06-20 18:37:41,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:41,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:37:41,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:37:41,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-20 18:37:41,118 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:37:41,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:37:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash -764307931, now seen corresponding path program 11 times [2024-06-20 18:37:41,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:37:41,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831520207] [2024-06-20 18:37:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:37:41,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:37:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:37:51,642 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-20 18:37:51,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:37:51,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831520207] [2024-06-20 18:37:51,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831520207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:37:51,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:37:51,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:37:51,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396860935] [2024-06-20 18:37:51,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:37:51,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:37:51,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:37:51,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:37:51,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:37:51,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:37:51,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 206 transitions, 2209 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:51,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:37:51,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:37:51,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:37:52,292 INFO L124 PetriNetUnfolderBase]: 461/825 cut-off events. [2024-06-20 18:37:52,292 INFO L125 PetriNetUnfolderBase]: For 113037/113040 co-relation queries the response was YES. [2024-06-20 18:37:52,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7913 conditions, 825 events. 461/825 cut-off events. For 113037/113040 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3914 event pairs, 42 based on Foata normal form. 2/824 useless extension candidates. Maximal degree in co-relation 7804. Up to 398 conditions per place. [2024-06-20 18:37:52,301 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 145 selfloop transitions, 90 changer transitions 0/238 dead transitions. [2024-06-20 18:37:52,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 238 transitions, 3627 flow [2024-06-20 18:37:52,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:37:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:37:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 153 transitions. [2024-06-20 18:37:52,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4346590909090909 [2024-06-20 18:37:52,304 INFO L175 Difference]: Start difference. First operand has 226 places, 206 transitions, 2209 flow. Second operand 11 states and 153 transitions. [2024-06-20 18:37:52,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 238 transitions, 3627 flow [2024-06-20 18:37:52,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 238 transitions, 3475 flow, removed 22 selfloop flow, removed 11 redundant places. [2024-06-20 18:37:52,508 INFO L231 Difference]: Finished difference. Result has 227 places, 216 transitions, 2537 flow [2024-06-20 18:37:52,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2537, PETRI_PLACES=227, PETRI_TRANSITIONS=216} [2024-06-20 18:37:52,512 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 196 predicate places. [2024-06-20 18:37:52,512 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 216 transitions, 2537 flow [2024-06-20 18:37:52,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:52,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:37:52,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:37:52,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-20 18:37:52,513 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:37:52,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:37:52,513 INFO L85 PathProgramCache]: Analyzing trace with hash -764307652, now seen corresponding path program 2 times [2024-06-20 18:37:52,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:37:52,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867136201] [2024-06-20 18:37:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:37:52,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:37:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:02,511 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-20 18:38:02,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:02,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867136201] [2024-06-20 18:38:02,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867136201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:02,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:02,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:38:02,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182541984] [2024-06-20 18:38:02,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:02,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:38:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:02,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:38:02,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:38:02,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:38:02,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 216 transitions, 2537 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:02,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:02,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:38:02,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:03,085 INFO L124 PetriNetUnfolderBase]: 464/830 cut-off events. [2024-06-20 18:38:03,085 INFO L125 PetriNetUnfolderBase]: For 114237/114240 co-relation queries the response was YES. [2024-06-20 18:38:03,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8194 conditions, 830 events. 464/830 cut-off events. For 114237/114240 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3951 event pairs, 43 based on Foata normal form. 1/828 useless extension candidates. Maximal degree in co-relation 8084. Up to 680 conditions per place. [2024-06-20 18:38:03,094 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 172 selfloop transitions, 53 changer transitions 0/228 dead transitions. [2024-06-20 18:38:03,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 228 transitions, 3052 flow [2024-06-20 18:38:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:38:03,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:38:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-20 18:38:03,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-20 18:38:03,095 INFO L175 Difference]: Start difference. First operand has 227 places, 216 transitions, 2537 flow. Second operand 10 states and 125 transitions. [2024-06-20 18:38:03,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 228 transitions, 3052 flow [2024-06-20 18:38:03,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 228 transitions, 2946 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-20 18:38:03,304 INFO L231 Difference]: Finished difference. Result has 233 places, 218 transitions, 2589 flow [2024-06-20 18:38:03,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2435, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2589, PETRI_PLACES=233, PETRI_TRANSITIONS=218} [2024-06-20 18:38:03,305 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 202 predicate places. [2024-06-20 18:38:03,305 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 218 transitions, 2589 flow [2024-06-20 18:38:03,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:03,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:03,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:03,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-20 18:38:03,306 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:38:03,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:03,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1783214201, now seen corresponding path program 12 times [2024-06-20 18:38:03,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:03,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442318501] [2024-06-20 18:38:03,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:03,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:14,946 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-20 18:38:14,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:14,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442318501] [2024-06-20 18:38:14,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442318501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:14,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:14,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:38:14,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552521385] [2024-06-20 18:38:14,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:14,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:38:14,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:14,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:38:14,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:38:15,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:38:15,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 218 transitions, 2589 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:15,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:15,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:38:15,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:15,593 INFO L124 PetriNetUnfolderBase]: 472/843 cut-off events. [2024-06-20 18:38:15,594 INFO L125 PetriNetUnfolderBase]: For 118832/118835 co-relation queries the response was YES. [2024-06-20 18:38:15,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8370 conditions, 843 events. 472/843 cut-off events. For 118832/118835 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4020 event pairs, 48 based on Foata normal form. 1/841 useless extension candidates. Maximal degree in co-relation 8258. Up to 684 conditions per place. [2024-06-20 18:38:15,603 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 191 selfloop transitions, 43 changer transitions 0/237 dead transitions. [2024-06-20 18:38:15,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 237 transitions, 3585 flow [2024-06-20 18:38:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:38:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:38:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-20 18:38:15,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-20 18:38:15,606 INFO L175 Difference]: Start difference. First operand has 233 places, 218 transitions, 2589 flow. Second operand 10 states and 133 transitions. [2024-06-20 18:38:15,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 237 transitions, 3585 flow [2024-06-20 18:38:15,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 237 transitions, 3454 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-20 18:38:15,845 INFO L231 Difference]: Finished difference. Result has 236 places, 225 transitions, 2758 flow [2024-06-20 18:38:15,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2458, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2758, PETRI_PLACES=236, PETRI_TRANSITIONS=225} [2024-06-20 18:38:15,845 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 205 predicate places. [2024-06-20 18:38:15,845 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 225 transitions, 2758 flow [2024-06-20 18:38:15,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:15,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:15,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:15,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-20 18:38:15,846 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:38:15,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:15,846 INFO L85 PathProgramCache]: Analyzing trace with hash -764298352, now seen corresponding path program 3 times [2024-06-20 18:38:15,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:15,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244645986] [2024-06-20 18:38:15,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:15,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:25,535 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-20 18:38:25,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:25,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244645986] [2024-06-20 18:38:25,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244645986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:25,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:25,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:38:25,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679411610] [2024-06-20 18:38:25,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:25,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:38:25,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:25,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:38:25,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:38:25,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:38:25,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 225 transitions, 2758 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:25,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:25,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:38:25,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:26,193 INFO L124 PetriNetUnfolderBase]: 469/838 cut-off events. [2024-06-20 18:38:26,193 INFO L125 PetriNetUnfolderBase]: For 119240/119243 co-relation queries the response was YES. [2024-06-20 18:38:26,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8316 conditions, 838 events. 469/838 cut-off events. For 119240/119243 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3990 event pairs, 43 based on Foata normal form. 1/836 useless extension candidates. Maximal degree in co-relation 8202. Up to 679 conditions per place. [2024-06-20 18:38:26,201 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 174 selfloop transitions, 58 changer transitions 0/235 dead transitions. [2024-06-20 18:38:26,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 235 transitions, 3244 flow [2024-06-20 18:38:26,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:38:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:38:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-20 18:38:26,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-20 18:38:26,202 INFO L175 Difference]: Start difference. First operand has 236 places, 225 transitions, 2758 flow. Second operand 10 states and 126 transitions. [2024-06-20 18:38:26,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 235 transitions, 3244 flow [2024-06-20 18:38:26,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 235 transitions, 3111 flow, removed 49 selfloop flow, removed 5 redundant places. [2024-06-20 18:38:26,431 INFO L231 Difference]: Finished difference. Result has 241 places, 225 transitions, 2746 flow [2024-06-20 18:38:26,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2625, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2746, PETRI_PLACES=241, PETRI_TRANSITIONS=225} [2024-06-20 18:38:26,432 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 210 predicate places. [2024-06-20 18:38:26,432 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 225 transitions, 2746 flow [2024-06-20 18:38:26,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:26,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:26,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:26,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-20 18:38:26,432 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:38:26,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -764567401, now seen corresponding path program 13 times [2024-06-20 18:38:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:26,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551059487] [2024-06-20 18:38:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:26,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:36,962 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-20 18:38:36,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:36,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551059487] [2024-06-20 18:38:36,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551059487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:36,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:36,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:38:36,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279167281] [2024-06-20 18:38:36,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:36,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:38:36,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:36,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:38:36,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:38:37,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:38:37,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 225 transitions, 2746 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:37,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:37,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:38:37,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:37,596 INFO L124 PetriNetUnfolderBase]: 475/848 cut-off events. [2024-06-20 18:38:37,597 INFO L125 PetriNetUnfolderBase]: For 124041/124044 co-relation queries the response was YES. [2024-06-20 18:38:37,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8435 conditions, 848 events. 475/848 cut-off events. For 124041/124044 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4047 event pairs, 43 based on Foata normal form. 2/847 useless extension candidates. Maximal degree in co-relation 8319. Up to 408 conditions per place. [2024-06-20 18:38:37,606 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 144 selfloop transitions, 100 changer transitions 0/247 dead transitions. [2024-06-20 18:38:37,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 247 transitions, 3848 flow [2024-06-20 18:38:37,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:38:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:38:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-20 18:38:37,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4289772727272727 [2024-06-20 18:38:37,607 INFO L175 Difference]: Start difference. First operand has 241 places, 225 transitions, 2746 flow. Second operand 11 states and 151 transitions. [2024-06-20 18:38:37,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 247 transitions, 3848 flow [2024-06-20 18:38:37,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 247 transitions, 3727 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-20 18:38:37,877 INFO L231 Difference]: Finished difference. Result has 244 places, 227 transitions, 2867 flow [2024-06-20 18:38:37,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2625, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2867, PETRI_PLACES=244, PETRI_TRANSITIONS=227} [2024-06-20 18:38:37,878 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 213 predicate places. [2024-06-20 18:38:37,878 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 227 transitions, 2867 flow [2024-06-20 18:38:37,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:37,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:37,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:37,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-20 18:38:37,878 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:38:37,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:37,879 INFO L85 PathProgramCache]: Analyzing trace with hash -764574841, now seen corresponding path program 14 times [2024-06-20 18:38:37,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:37,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776516911] [2024-06-20 18:38:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:47,451 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-20 18:38:47,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:47,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776516911] [2024-06-20 18:38:47,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776516911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:47,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:47,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:38:47,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910111997] [2024-06-20 18:38:47,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:47,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:38:47,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:47,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:38:47,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:38:47,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:38:47,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 227 transitions, 2867 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:47,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:47,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:38:47,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:48,060 INFO L124 PetriNetUnfolderBase]: 473/845 cut-off events. [2024-06-20 18:38:48,060 INFO L125 PetriNetUnfolderBase]: For 121174/121177 co-relation queries the response was YES. [2024-06-20 18:38:48,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8491 conditions, 845 events. 473/845 cut-off events. For 121174/121177 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4046 event pairs, 47 based on Foata normal form. 1/843 useless extension candidates. Maximal degree in co-relation 8374. Up to 550 conditions per place. [2024-06-20 18:38:48,070 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 146 selfloop transitions, 96 changer transitions 0/245 dead transitions. [2024-06-20 18:38:48,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 245 transitions, 3833 flow [2024-06-20 18:38:48,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:38:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:38:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-20 18:38:48,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-20 18:38:48,072 INFO L175 Difference]: Start difference. First operand has 244 places, 227 transitions, 2867 flow. Second operand 10 states and 132 transitions. [2024-06-20 18:38:48,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 245 transitions, 3833 flow [2024-06-20 18:38:48,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 245 transitions, 3607 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-20 18:38:48,332 INFO L231 Difference]: Finished difference. Result has 247 places, 233 transitions, 2990 flow [2024-06-20 18:38:48,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2990, PETRI_PLACES=247, PETRI_TRANSITIONS=233} [2024-06-20 18:38:48,333 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 216 predicate places. [2024-06-20 18:38:48,333 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 233 transitions, 2990 flow [2024-06-20 18:38:48,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:48,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:48,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:48,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-20 18:38:48,334 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:38:48,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:48,334 INFO L85 PathProgramCache]: Analyzing trace with hash 857146051, now seen corresponding path program 2 times [2024-06-20 18:38:48,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:48,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957919819] [2024-06-20 18:38:48,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:48,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:57,783 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-20 18:38:57,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:57,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957919819] [2024-06-20 18:38:57,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957919819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:57,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:57,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:38:57,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621204697] [2024-06-20 18:38:57,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:57,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:38:57,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:57,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:38:57,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:38:58,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:38:58,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 233 transitions, 2990 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:58,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:58,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:38:58,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:58,465 INFO L124 PetriNetUnfolderBase]: 452/828 cut-off events. [2024-06-20 18:38:58,465 INFO L125 PetriNetUnfolderBase]: For 127552/127555 co-relation queries the response was YES. [2024-06-20 18:38:58,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8443 conditions, 828 events. 452/828 cut-off events. For 127552/127555 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4065 event pairs, 40 based on Foata normal form. 4/829 useless extension candidates. Maximal degree in co-relation 8324. Up to 670 conditions per place. [2024-06-20 18:38:58,474 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 183 selfloop transitions, 28 changer transitions 0/245 dead transitions. [2024-06-20 18:38:58,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 245 transitions, 3460 flow [2024-06-20 18:38:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:38:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:38:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-20 18:38:58,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-20 18:38:58,475 INFO L175 Difference]: Start difference. First operand has 247 places, 233 transitions, 2990 flow. Second operand 10 states and 129 transitions. [2024-06-20 18:38:58,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 245 transitions, 3460 flow [2024-06-20 18:38:58,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 245 transitions, 3306 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-20 18:38:58,730 INFO L231 Difference]: Finished difference. Result has 252 places, 234 transitions, 2922 flow [2024-06-20 18:38:58,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2836, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2922, PETRI_PLACES=252, PETRI_TRANSITIONS=234} [2024-06-20 18:38:58,730 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 221 predicate places. [2024-06-20 18:38:58,730 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 234 transitions, 2922 flow [2024-06-20 18:38:58,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:58,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:58,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:58,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-20 18:38:58,731 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:38:58,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:58,731 INFO L85 PathProgramCache]: Analyzing trace with hash -764575058, now seen corresponding path program 8 times [2024-06-20 18:38:58,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:58,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896135633] [2024-06-20 18:38:58,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:58,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:39:10,040 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-20 18:39:10,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:39:10,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896135633] [2024-06-20 18:39:10,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896135633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:39:10,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:39:10,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:39:10,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408883100] [2024-06-20 18:39:10,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:39:10,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:39:10,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:39:10,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:39:10,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:39:10,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:39:10,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 234 transitions, 2922 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:10,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:39:10,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:39:10,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:39:10,612 INFO L124 PetriNetUnfolderBase]: 480/860 cut-off events. [2024-06-20 18:39:10,612 INFO L125 PetriNetUnfolderBase]: For 127133/127136 co-relation queries the response was YES. [2024-06-20 18:39:10,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8652 conditions, 860 events. 480/860 cut-off events. For 127133/127136 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4154 event pairs, 44 based on Foata normal form. 1/858 useless extension candidates. Maximal degree in co-relation 8531. Up to 652 conditions per place. [2024-06-20 18:39:10,621 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 184 selfloop transitions, 66 changer transitions 0/253 dead transitions. [2024-06-20 18:39:10,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 253 transitions, 3766 flow [2024-06-20 18:39:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:39:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:39:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-20 18:39:10,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-20 18:39:10,622 INFO L175 Difference]: Start difference. First operand has 252 places, 234 transitions, 2922 flow. Second operand 11 states and 139 transitions. [2024-06-20 18:39:10,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 253 transitions, 3766 flow [2024-06-20 18:39:10,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 253 transitions, 3681 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-20 18:39:10,864 INFO L231 Difference]: Finished difference. Result has 255 places, 238 transitions, 3122 flow [2024-06-20 18:39:10,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2837, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3122, PETRI_PLACES=255, PETRI_TRANSITIONS=238} [2024-06-20 18:39:10,864 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 224 predicate places. [2024-06-20 18:39:10,865 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 238 transitions, 3122 flow [2024-06-20 18:39:10,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:10,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:39:10,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:39:10,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-20 18:39:10,865 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:39:10,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:39:10,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1019886059, now seen corresponding path program 15 times [2024-06-20 18:39:10,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:39:10,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046722252] [2024-06-20 18:39:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:39:10,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:39:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:39:19,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-20 18:39:19,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:39:19,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046722252] [2024-06-20 18:39:19,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046722252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:39:19,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:39:19,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:39:19,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362712873] [2024-06-20 18:39:19,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:39:19,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:39:19,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:39:19,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:39:19,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:39:20,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:39:20,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 238 transitions, 3122 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:20,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:39:20,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:39:20,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:39:20,485 INFO L124 PetriNetUnfolderBase]: 488/873 cut-off events. [2024-06-20 18:39:20,485 INFO L125 PetriNetUnfolderBase]: For 134547/134550 co-relation queries the response was YES. [2024-06-20 18:39:20,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8988 conditions, 873 events. 488/873 cut-off events. For 134547/134550 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4222 event pairs, 47 based on Foata normal form. 1/871 useless extension candidates. Maximal degree in co-relation 8866. Up to 736 conditions per place. [2024-06-20 18:39:20,494 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 214 selfloop transitions, 37 changer transitions 0/254 dead transitions. [2024-06-20 18:39:20,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 254 transitions, 4084 flow [2024-06-20 18:39:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:39:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:39:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-20 18:39:20,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 18:39:20,498 INFO L175 Difference]: Start difference. First operand has 255 places, 238 transitions, 3122 flow. Second operand 10 states and 130 transitions. [2024-06-20 18:39:20,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 254 transitions, 4084 flow [2024-06-20 18:39:20,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 254 transitions, 3977 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-06-20 18:39:20,762 INFO L231 Difference]: Finished difference. Result has 258 places, 242 transitions, 3192 flow [2024-06-20 18:39:20,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3015, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3192, PETRI_PLACES=258, PETRI_TRANSITIONS=242} [2024-06-20 18:39:20,763 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 227 predicate places. [2024-06-20 18:39:20,763 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 242 transitions, 3192 flow [2024-06-20 18:39:20,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:20,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:39:20,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:39:20,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-20 18:39:20,764 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:39:20,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:39:20,764 INFO L85 PathProgramCache]: Analyzing trace with hash -450598781, now seen corresponding path program 3 times [2024-06-20 18:39:20,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:39:20,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548508530] [2024-06-20 18:39:20,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:39:20,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:39:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:39:29,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-20 18:39:29,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:39:29,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548508530] [2024-06-20 18:39:29,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548508530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:39:29,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:39:29,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:39:29,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748932914] [2024-06-20 18:39:29,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:39:29,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:39:29,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:39:29,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:39:29,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:39:29,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:39:29,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 242 transitions, 3192 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:29,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:39:29,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:39:29,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:39:30,218 INFO L124 PetriNetUnfolderBase]: 465/853 cut-off events. [2024-06-20 18:39:30,218 INFO L125 PetriNetUnfolderBase]: For 141493/141493 co-relation queries the response was YES. [2024-06-20 18:39:30,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8943 conditions, 853 events. 465/853 cut-off events. For 141493/141493 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4264 event pairs, 35 based on Foata normal form. 2/853 useless extension candidates. Maximal degree in co-relation 8819. Up to 727 conditions per place. [2024-06-20 18:39:30,228 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 205 selfloop transitions, 15 changer transitions 0/254 dead transitions. [2024-06-20 18:39:30,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 254 transitions, 3682 flow [2024-06-20 18:39:30,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:39:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:39:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-20 18:39:30,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-20 18:39:30,230 INFO L175 Difference]: Start difference. First operand has 258 places, 242 transitions, 3192 flow. Second operand 10 states and 124 transitions. [2024-06-20 18:39:30,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 254 transitions, 3682 flow [2024-06-20 18:39:30,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 254 transitions, 3568 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-20 18:39:30,511 INFO L231 Difference]: Finished difference. Result has 261 places, 243 transitions, 3140 flow [2024-06-20 18:39:30,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3078, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3140, PETRI_PLACES=261, PETRI_TRANSITIONS=243} [2024-06-20 18:39:30,512 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 230 predicate places. [2024-06-20 18:39:30,512 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 243 transitions, 3140 flow [2024-06-20 18:39:30,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:30,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:39:30,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:39:30,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-20 18:39:30,512 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:39:30,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:39:30,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1020087869, now seen corresponding path program 16 times [2024-06-20 18:39:30,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:39:30,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670035546] [2024-06-20 18:39:30,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:39:30,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:39:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:39:38,801 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-20 18:39:38,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:39:38,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670035546] [2024-06-20 18:39:38,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670035546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:39:38,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:39:38,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:39:38,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521475434] [2024-06-20 18:39:38,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:39:38,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:39:38,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:39:38,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:39:38,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:39:38,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 18:39:38,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 243 transitions, 3140 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:38,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:39:38,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 18:39:38,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:39:39,346 INFO L124 PetriNetUnfolderBase]: 488/875 cut-off events. [2024-06-20 18:39:39,346 INFO L125 PetriNetUnfolderBase]: For 136218/136221 co-relation queries the response was YES. [2024-06-20 18:39:39,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8798 conditions, 875 events. 488/875 cut-off events. For 136218/136221 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4254 event pairs, 49 based on Foata normal form. 2/874 useless extension candidates. Maximal degree in co-relation 8673. Up to 756 conditions per place. [2024-06-20 18:39:39,355 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 220 selfloop transitions, 30 changer transitions 0/253 dead transitions. [2024-06-20 18:39:39,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 253 transitions, 3662 flow [2024-06-20 18:39:39,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:39:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:39:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-20 18:39:39,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-20 18:39:39,357 INFO L175 Difference]: Start difference. First operand has 261 places, 243 transitions, 3140 flow. Second operand 10 states and 125 transitions. [2024-06-20 18:39:39,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 253 transitions, 3662 flow [2024-06-20 18:39:39,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 253 transitions, 3554 flow, removed 40 selfloop flow, removed 8 redundant places. [2024-06-20 18:39:39,629 INFO L231 Difference]: Finished difference. Result has 263 places, 243 transitions, 3098 flow [2024-06-20 18:39:39,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3032, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3098, PETRI_PLACES=263, PETRI_TRANSITIONS=243} [2024-06-20 18:39:39,630 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 232 predicate places. [2024-06-20 18:39:39,630 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 243 transitions, 3098 flow [2024-06-20 18:39:39,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:39,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:39:39,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:39:39,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-20 18:39:39,631 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:39:39,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:39:39,631 INFO L85 PathProgramCache]: Analyzing trace with hash -439170941, now seen corresponding path program 4 times [2024-06-20 18:39:39,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:39:39,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720599987] [2024-06-20 18:39:39,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:39:39,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:39:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:39:50,822 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-20 18:39:50,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:39:50,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720599987] [2024-06-20 18:39:50,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720599987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:39:50,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:39:50,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:39:50,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742249003] [2024-06-20 18:39:50,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:39:50,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:39:50,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:39:50,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:39:50,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:39:51,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 18:39:51,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 243 transitions, 3098 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:51,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:39:51,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 18:39:51,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:39:51,659 INFO L124 PetriNetUnfolderBase]: 472/868 cut-off events. [2024-06-20 18:39:51,659 INFO L125 PetriNetUnfolderBase]: For 147398/147398 co-relation queries the response was YES. [2024-06-20 18:39:51,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8968 conditions, 868 events. 472/868 cut-off events. For 147398/147398 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4369 event pairs, 36 based on Foata normal form. 2/868 useless extension candidates. Maximal degree in co-relation 8842. Up to 713 conditions per place. [2024-06-20 18:39:51,668 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 204 selfloop transitions, 21 changer transitions 0/259 dead transitions. [2024-06-20 18:39:51,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 259 transitions, 3808 flow [2024-06-20 18:39:51,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:39:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:39:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-20 18:39:51,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-20 18:39:51,670 INFO L175 Difference]: Start difference. First operand has 263 places, 243 transitions, 3098 flow. Second operand 11 states and 137 transitions. [2024-06-20 18:39:51,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 259 transitions, 3808 flow Killed by 15