./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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-bcb38a6-m [2024-06-04 17:57:19,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:57:19,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:57:19,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:57:19,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:57:19,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:57:19,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:57:19,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:57:19,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:57:19,296 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:57:19,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:57:19,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:57:19,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:57:19,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:57:19,299 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:57:19,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:57:19,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:57:19,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:57:19,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:57:19,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:57:19,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:57:19,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:57:19,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:57:19,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:57:19,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:57:19,302 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:57:19,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:57:19,302 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:57:19,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:57:19,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:57:19,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:57:19,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:57:19,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:57:19,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:57:19,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:57:19,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:57:19,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:57:19,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:57:19,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:57:19,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:57:19,306 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:57:19,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:57:19,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:57:19,306 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 17:57:19,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:57:19,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:57:19,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:57:19,542 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:57:19,542 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:57:19,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-04 17:57:20,482 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:57:20,669 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:57:20,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-04 17:57:20,686 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ddfc7027/7b8f5cb56b5746c69d7475f40ee2c182/FLAGf93dcaff7 [2024-06-04 17:57:20,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ddfc7027/7b8f5cb56b5746c69d7475f40ee2c182 [2024-06-04 17:57:20,697 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:57:20,698 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:57:20,698 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-04 17:57:20,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:57:20,839 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:57:20,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:57:20,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:57:20,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:57:20,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:57:20" (1/2) ... [2024-06-04 17:57:20,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39a811e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:57:20, skipping insertion in model container [2024-06-04 17:57:20,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:57:20" (1/2) ... [2024-06-04 17:57:20,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5d03729f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:57:20, skipping insertion in model container [2024-06-04 17:57:20,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:57:20" (2/2) ... [2024-06-04 17:57:20,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39a811e6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:20, skipping insertion in model container [2024-06-04 17:57:20,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:57:20" (2/2) ... [2024-06-04 17:57:20,847 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:57:20,893 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:57:20,894 INFO L97 edCorrectnessWitness]: Location invariant before [L796-L796] ((((((((((((((! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (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_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && x <= 1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 17:57:20,895 INFO L97 edCorrectnessWitness]: Location invariant before [L795-L795] ((((((((((((((! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (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_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && x <= 1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 17:57:20,895 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:57:20,895 INFO L106 edCorrectnessWitness]: ghost_update [L793-L793] multithreaded = 1; [2024-06-04 17:57:20,933 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:57:21,234 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:57:21,245 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:57:21,473 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:57:21,507 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:57:21,508 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:21 WrapperNode [2024-06-04 17:57:21,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:57:21,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:57:21,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:57:21,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:57:21,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:21" (1/1) ... [2024-06-04 17:57:21,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:21" (1/1) ... [2024-06-04 17:57:21,598 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 131 [2024-06-04 17:57:21,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:57:21,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:57:21,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:57:21,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:57:21,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:21" (1/1) ... [2024-06-04 17:57:21,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:21" (1/1) ... [2024-06-04 17:57:21,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:21" (1/1) ... [2024-06-04 17:57:21,653 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 17:57:21,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:21" (1/1) ... [2024-06-04 17:57:21,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:21" (1/1) ... [2024-06-04 17:57:21,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:21" (1/1) ... [2024-06-04 17:57:21,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:21" (1/1) ... [2024-06-04 17:57:21,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:21" (1/1) ... [2024-06-04 17:57:21,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:21" (1/1) ... [2024-06-04 17:57:21,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:57:21,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:57:21,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:57:21,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:57:21,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:21" (1/1) ... [2024-06-04 17:57:21,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:57:21,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:57:21,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 17:57:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:57:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:57:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:57:21,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:57:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:57:21,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:57:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:57:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:57:21,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 17:57:21,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:57:21,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:57:21,757 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 17:57:21,839 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:57:21,841 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:57:22,429 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:57:22,430 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:57:22,523 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:57:22,523 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:57:22,524 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:57:22 BoogieIcfgContainer [2024-06-04 17:57:22,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:57:22,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:57:22,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:57:22,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:57:22,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:57:20" (1/4) ... [2024-06-04 17:57:22,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af9906d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:57:22, skipping insertion in model container [2024-06-04 17:57:22,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:57:20" (2/4) ... [2024-06-04 17:57:22,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af9906d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:57:22, skipping insertion in model container [2024-06-04 17:57:22,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:57:21" (3/4) ... [2024-06-04 17:57:22,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af9906d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:57:22, skipping insertion in model container [2024-06-04 17:57:22,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:57:22" (4/4) ... [2024-06-04 17:57:22,531 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-04 17:57:22,550 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:57:22,550 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 17:57:22,551 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:57:22,613 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:57:22,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2024-06-04 17:57:22,675 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-04 17:57:22,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:57:22,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 17:57:22,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2024-06-04 17:57:22,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2024-06-04 17:57:22,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:57:22,732 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;@56e55885, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:57:22,732 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 17:57:22,738 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:57:22,738 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 17:57:22,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:57:22,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:22,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:57:22,739 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-04 17:57:22,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:22,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1451147604, now seen corresponding path program 1 times [2024-06-04 17:57:22,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:22,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650424051] [2024-06-04 17:57:22,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:22,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:25,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:25,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650424051] [2024-06-04 17:57:25,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650424051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:25,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:25,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:57:25,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125142888] [2024-06-04 17:57:25,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:25,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:57:25,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:25,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:57:25,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:57:25,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-04 17:57:25,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:25,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:25,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-04 17:57:25,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:25,564 INFO L124 PetriNetUnfolderBase]: 135/253 cut-off events. [2024-06-04 17:57:25,564 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-04 17:57:25,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 253 events. 135/253 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 870 event pairs, 79 based on Foata normal form. 1/248 useless extension candidates. Maximal degree in co-relation 507. Up to 243 conditions per place. [2024-06-04 17:57:25,568 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 22 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2024-06-04 17:57:25,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 115 flow [2024-06-04 17:57:25,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:57:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:57:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-06-04 17:57:25,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-04 17:57:25,578 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 48 transitions. [2024-06-04 17:57:25,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 115 flow [2024-06-04 17:57:25,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 17:57:25,581 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2024-06-04 17:57:25,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2024-06-04 17:57:25,585 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-06-04 17:57:25,585 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2024-06-04 17:57:25,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:25,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:25,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:25,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:57:25,586 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-04 17:57:25,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:25,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1311490701, now seen corresponding path program 1 times [2024-06-04 17:57:25,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:25,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181858247] [2024-06-04 17:57:25,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:25,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:27,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:27,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181858247] [2024-06-04 17:57:27,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181858247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:27,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:27,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:57:27,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523540617] [2024-06-04 17:57:27,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:27,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:57:27,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:27,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:57:27,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:57:27,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-04 17:57:27,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:27,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:27,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-04 17:57:27,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:27,454 INFO L124 PetriNetUnfolderBase]: 132/248 cut-off events. [2024-06-04 17:57:27,455 INFO L125 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2024-06-04 17:57:27,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 248 events. 132/248 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 840 event pairs, 64 based on Foata normal form. 4/251 useless extension candidates. Maximal degree in co-relation 569. Up to 229 conditions per place. [2024-06-04 17:57:27,457 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 26 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2024-06-04 17:57:27,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 157 flow [2024-06-04 17:57:27,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:57:27,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:57:27,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2024-06-04 17:57:27,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2024-06-04 17:57:27,458 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 4 states and 61 transitions. [2024-06-04 17:57:27,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 157 flow [2024-06-04 17:57:27,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:57:27,460 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 93 flow [2024-06-04 17:57:27,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2024-06-04 17:57:27,463 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2024-06-04 17:57:27,463 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 93 flow [2024-06-04 17:57:27,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:27,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:27,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:27,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:57:27,464 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-04 17:57:27,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:27,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2001504973, now seen corresponding path program 1 times [2024-06-04 17:57:27,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:27,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973460825] [2024-06-04 17:57:27,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:27,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:29,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:29,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973460825] [2024-06-04 17:57:29,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973460825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:29,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:29,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:57:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639982536] [2024-06-04 17:57:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:29,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:57:29,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:29,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:57:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:57:29,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-04 17:57:29,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:29,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:29,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-04 17:57:29,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:29,266 INFO L124 PetriNetUnfolderBase]: 152/281 cut-off events. [2024-06-04 17:57:29,267 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2024-06-04 17:57:29,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 281 events. 152/281 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 963 event pairs, 59 based on Foata normal form. 2/282 useless extension candidates. Maximal degree in co-relation 718. Up to 254 conditions per place. [2024-06-04 17:57:29,269 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 35 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2024-06-04 17:57:29,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 227 flow [2024-06-04 17:57:29,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:57:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:57:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2024-06-04 17:57:29,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-04 17:57:29,271 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 93 flow. Second operand 5 states and 70 transitions. [2024-06-04 17:57:29,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 227 flow [2024-06-04 17:57:29,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 216 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 17:57:29,272 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 137 flow [2024-06-04 17:57:29,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2024-06-04 17:57:29,273 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-06-04 17:57:29,273 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 137 flow [2024-06-04 17:57:29,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:29,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:29,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:29,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:57:29,274 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-04 17:57:29,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1917110894, now seen corresponding path program 1 times [2024-06-04 17:57:29,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:29,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810006433] [2024-06-04 17:57:29,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:29,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:31,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:31,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810006433] [2024-06-04 17:57:31,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810006433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:31,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:31,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:57:31,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382776960] [2024-06-04 17:57:31,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:31,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:57:31,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:31,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:57:31,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:57:31,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-04 17:57:31,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-04 17:57:31,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:31,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-04 17:57:31,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:31,375 INFO L124 PetriNetUnfolderBase]: 149/276 cut-off events. [2024-06-04 17:57:31,376 INFO L125 PetriNetUnfolderBase]: For 273/273 co-relation queries the response was YES. [2024-06-04 17:57:31,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 276 events. 149/276 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 929 event pairs, 41 based on Foata normal form. 2/277 useless extension candidates. Maximal degree in co-relation 792. Up to 240 conditions per place. [2024-06-04 17:57:31,377 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 39 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2024-06-04 17:57:31,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 279 flow [2024-06-04 17:57:31,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:57:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:57:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2024-06-04 17:57:31,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-04 17:57:31,379 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 137 flow. Second operand 6 states and 82 transitions. [2024-06-04 17:57:31,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 279 flow [2024-06-04 17:57:31,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 279 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 17:57:31,381 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 172 flow [2024-06-04 17:57:31,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-06-04 17:57:31,382 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2024-06-04 17:57:31,382 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 172 flow [2024-06-04 17:57:31,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-04 17:57:31,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:31,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:31,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:57:31,383 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-04 17:57:31,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1555601532, now seen corresponding path program 1 times [2024-06-04 17:57:31,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:31,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461879368] [2024-06-04 17:57:31,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:31,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:33,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:33,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461879368] [2024-06-04 17:57:33,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461879368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:33,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:57:33,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189278681] [2024-06-04 17:57:33,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:33,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:57:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:33,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:57:33,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:57:33,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-04 17:57:33,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 172 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:33,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:33,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-04 17:57:33,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:33,620 INFO L124 PetriNetUnfolderBase]: 145/268 cut-off events. [2024-06-04 17:57:33,621 INFO L125 PetriNetUnfolderBase]: For 405/405 co-relation queries the response was YES. [2024-06-04 17:57:33,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 268 events. 145/268 cut-off events. For 405/405 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 884 event pairs, 22 based on Foata normal form. 4/271 useless extension candidates. Maximal degree in co-relation 844. Up to 214 conditions per place. [2024-06-04 17:57:33,623 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 39 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2024-06-04 17:57:33,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 304 flow [2024-06-04 17:57:33,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:57:33,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:57:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-04 17:57:33,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2024-06-04 17:57:33,625 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 172 flow. Second operand 7 states and 89 transitions. [2024-06-04 17:57:33,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 304 flow [2024-06-04 17:57:33,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 287 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-04 17:57:33,629 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 169 flow [2024-06-04 17:57:33,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=169, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2024-06-04 17:57:33,635 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2024-06-04 17:57:33,635 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 169 flow [2024-06-04 17:57:33,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:33,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:33,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:33,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:57:33,639 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-04 17:57:33,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:33,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1606489710, now seen corresponding path program 1 times [2024-06-04 17:57:33,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:33,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418506360] [2024-06-04 17:57:33,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:33,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:37,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:37,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418506360] [2024-06-04 17:57:37,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418506360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:37,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:37,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:57:37,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378373133] [2024-06-04 17:57:37,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:37,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:57:37,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:37,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:57:37,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:57:37,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:57:37,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 169 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:37,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:37,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:57:37,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:37,615 INFO L124 PetriNetUnfolderBase]: 141/262 cut-off events. [2024-06-04 17:57:37,615 INFO L125 PetriNetUnfolderBase]: For 495/495 co-relation queries the response was YES. [2024-06-04 17:57:37,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 262 events. 141/262 cut-off events. For 495/495 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 854 event pairs, 36 based on Foata normal form. 2/263 useless extension candidates. Maximal degree in co-relation 859. Up to 244 conditions per place. [2024-06-04 17:57:37,617 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 32 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2024-06-04 17:57:37,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 267 flow [2024-06-04 17:57:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:57:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:57:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2024-06-04 17:57:37,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2024-06-04 17:57:37,618 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 169 flow. Second operand 5 states and 56 transitions. [2024-06-04 17:57:37,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 267 flow [2024-06-04 17:57:37,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 240 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 17:57:37,620 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 171 flow [2024-06-04 17:57:37,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-06-04 17:57:37,621 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2024-06-04 17:57:37,621 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 171 flow [2024-06-04 17:57:37,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:37,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:37,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:37,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:57:37,622 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-04 17:57:37,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:37,622 INFO L85 PathProgramCache]: Analyzing trace with hash -808955857, now seen corresponding path program 1 times [2024-06-04 17:57:37,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:37,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554417886] [2024-06-04 17:57:37,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:37,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:40,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554417886] [2024-06-04 17:57:40,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554417886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:40,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:40,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:57:40,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097305894] [2024-06-04 17:57:40,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:40,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:57:40,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:40,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:57:40,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:57:40,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:57:40,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 171 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:40,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:40,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:57:40,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:41,183 INFO L124 PetriNetUnfolderBase]: 144/267 cut-off events. [2024-06-04 17:57:41,183 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2024-06-04 17:57:41,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 267 events. 144/267 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 873 event pairs, 34 based on Foata normal form. 1/267 useless extension candidates. Maximal degree in co-relation 897. Up to 225 conditions per place. [2024-06-04 17:57:41,185 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 37 selfloop transitions, 15 changer transitions 0/54 dead transitions. [2024-06-04 17:57:41,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 343 flow [2024-06-04 17:57:41,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:57:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:57:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-04 17:57:41,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-04 17:57:41,186 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 171 flow. Second operand 8 states and 87 transitions. [2024-06-04 17:57:41,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 343 flow [2024-06-04 17:57:41,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 330 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 17:57:41,188 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 217 flow [2024-06-04 17:57:41,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=217, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2024-06-04 17:57:41,189 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2024-06-04 17:57:41,189 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 217 flow [2024-06-04 17:57:41,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:41,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:41,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:41,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:57:41,190 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-04 17:57:41,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:41,190 INFO L85 PathProgramCache]: Analyzing trace with hash -808835701, now seen corresponding path program 1 times [2024-06-04 17:57:41,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:41,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441891456] [2024-06-04 17:57:41,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:41,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:44,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:44,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441891456] [2024-06-04 17:57:44,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441891456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:44,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:44,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:57:44,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484827554] [2024-06-04 17:57:44,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:44,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:57:44,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:44,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:57:44,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:57:44,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:57:44,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 217 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:44,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:44,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:57:44,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:44,617 INFO L124 PetriNetUnfolderBase]: 150/277 cut-off events. [2024-06-04 17:57:44,618 INFO L125 PetriNetUnfolderBase]: For 830/830 co-relation queries the response was YES. [2024-06-04 17:57:44,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 277 events. 150/277 cut-off events. For 830/830 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 913 event pairs, 35 based on Foata normal form. 2/278 useless extension candidates. Maximal degree in co-relation 994. Up to 228 conditions per place. [2024-06-04 17:57:44,619 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 41 selfloop transitions, 13 changer transitions 0/56 dead transitions. [2024-06-04 17:57:44,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 385 flow [2024-06-04 17:57:44,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:57:44,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:57:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2024-06-04 17:57:44,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40555555555555556 [2024-06-04 17:57:44,621 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 217 flow. Second operand 6 states and 73 transitions. [2024-06-04 17:57:44,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 385 flow [2024-06-04 17:57:44,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 360 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:57:44,623 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 243 flow [2024-06-04 17:57:44,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-06-04 17:57:44,624 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2024-06-04 17:57:44,625 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 243 flow [2024-06-04 17:57:44,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:44,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:44,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:44,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:57:44,625 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-04 17:57:44,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:44,626 INFO L85 PathProgramCache]: Analyzing trace with hash -808835887, now seen corresponding path program 2 times [2024-06-04 17:57:44,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:44,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846216702] [2024-06-04 17:57:44,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:44,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:47,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-04 17:57:47,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:47,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846216702] [2024-06-04 17:57:47,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846216702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:47,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:47,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:57:47,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316919455] [2024-06-04 17:57:47,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:47,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:57:47,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:47,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:57:47,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:57:47,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:57:47,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 243 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:47,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:47,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:57:47,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:48,191 INFO L124 PetriNetUnfolderBase]: 148/274 cut-off events. [2024-06-04 17:57:48,191 INFO L125 PetriNetUnfolderBase]: For 972/972 co-relation queries the response was YES. [2024-06-04 17:57:48,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 274 events. 148/274 cut-off events. For 972/972 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 898 event pairs, 36 based on Foata normal form. 1/274 useless extension candidates. Maximal degree in co-relation 1040. Up to 236 conditions per place. [2024-06-04 17:57:48,194 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 41 selfloop transitions, 12 changer transitions 0/55 dead transitions. [2024-06-04 17:57:48,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 379 flow [2024-06-04 17:57:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:57:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:57:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2024-06-04 17:57:48,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2024-06-04 17:57:48,196 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 243 flow. Second operand 6 states and 71 transitions. [2024-06-04 17:57:48,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 379 flow [2024-06-04 17:57:48,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 364 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-04 17:57:48,198 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 260 flow [2024-06-04 17:57:48,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-06-04 17:57:48,199 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 26 predicate places. [2024-06-04 17:57:48,199 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 260 flow [2024-06-04 17:57:48,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:48,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:48,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:48,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:57:48,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:57:48,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1825187705, now seen corresponding path program 2 times [2024-06-04 17:57:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:48,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504789839] [2024-06-04 17:57:48,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:48,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504789839] [2024-06-04 17:57:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504789839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:51,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:51,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:57:51,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010580534] [2024-06-04 17:57:51,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:51,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:57:51,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:51,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:57:51,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:57:51,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:57:51,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 260 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:51,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:51,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:57:51,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:51,485 INFO L124 PetriNetUnfolderBase]: 149/276 cut-off events. [2024-06-04 17:57:51,485 INFO L125 PetriNetUnfolderBase]: For 1223/1223 co-relation queries the response was YES. [2024-06-04 17:57:51,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 276 events. 149/276 cut-off events. For 1223/1223 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 909 event pairs, 34 based on Foata normal form. 2/277 useless extension candidates. Maximal degree in co-relation 1096. Up to 252 conditions per place. [2024-06-04 17:57:51,487 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 41 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2024-06-04 17:57:51,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 399 flow [2024-06-04 17:57:51,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:57:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:57:51,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2024-06-04 17:57:51,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-04 17:57:51,491 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 260 flow. Second operand 6 states and 65 transitions. [2024-06-04 17:57:51,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 399 flow [2024-06-04 17:57:51,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 375 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-04 17:57:51,495 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 291 flow [2024-06-04 17:57:51,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-06-04 17:57:51,497 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2024-06-04 17:57:51,500 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 291 flow [2024-06-04 17:57:51,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:51,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:51,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:51,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:57:51,503 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-04 17:57:51,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1825178777, now seen corresponding path program 1 times [2024-06-04 17:57:51,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:51,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004010143] [2024-06-04 17:57:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:51,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:54,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:54,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004010143] [2024-06-04 17:57:54,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004010143] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:54,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:54,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:57:54,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319507550] [2024-06-04 17:57:54,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:54,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:57:54,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:54,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:57:54,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:57:54,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:57:54,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 291 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:54,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:54,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:57:54,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:55,144 INFO L124 PetriNetUnfolderBase]: 146/271 cut-off events. [2024-06-04 17:57:55,145 INFO L125 PetriNetUnfolderBase]: For 1379/1379 co-relation queries the response was YES. [2024-06-04 17:57:55,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 271 events. 146/271 cut-off events. For 1379/1379 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 876 event pairs, 32 based on Foata normal form. 2/272 useless extension candidates. Maximal degree in co-relation 1112. Up to 247 conditions per place. [2024-06-04 17:57:55,147 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 43 selfloop transitions, 9 changer transitions 0/54 dead transitions. [2024-06-04 17:57:55,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 411 flow [2024-06-04 17:57:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:57:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:57:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2024-06-04 17:57:55,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-04 17:57:55,148 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 291 flow. Second operand 6 states and 63 transitions. [2024-06-04 17:57:55,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 411 flow [2024-06-04 17:57:55,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 398 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 17:57:55,151 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 300 flow [2024-06-04 17:57:55,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2024-06-04 17:57:55,152 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 32 predicate places. [2024-06-04 17:57:55,152 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 300 flow [2024-06-04 17:57:55,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:55,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:55,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:55,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:57:55,153 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-04 17:57:55,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:55,153 INFO L85 PathProgramCache]: Analyzing trace with hash 692082734, now seen corresponding path program 1 times [2024-06-04 17:57:55,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:55,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922767561] [2024-06-04 17:57:55,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:55,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:58,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:58,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922767561] [2024-06-04 17:57:58,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922767561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:58,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:58,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:57:58,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906714144] [2024-06-04 17:57:58,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:58,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:57:58,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:58,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:57:58,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:57:58,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:57:58,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 300 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:58,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:58,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:57:58,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:58,986 INFO L124 PetriNetUnfolderBase]: 149/276 cut-off events. [2024-06-04 17:57:58,987 INFO L125 PetriNetUnfolderBase]: For 1610/1610 co-relation queries the response was YES. [2024-06-04 17:57:58,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 276 events. 149/276 cut-off events. For 1610/1610 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 903 event pairs, 31 based on Foata normal form. 1/276 useless extension candidates. Maximal degree in co-relation 1152. Up to 217 conditions per place. [2024-06-04 17:57:58,988 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 48 selfloop transitions, 19 changer transitions 0/69 dead transitions. [2024-06-04 17:57:58,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 69 transitions, 524 flow [2024-06-04 17:57:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:57:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:57:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-04 17:57:58,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2024-06-04 17:57:58,993 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 300 flow. Second operand 8 states and 92 transitions. [2024-06-04 17:57:58,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 69 transitions, 524 flow [2024-06-04 17:57:58,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 69 transitions, 504 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:57:58,997 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 351 flow [2024-06-04 17:57:58,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=351, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2024-06-04 17:57:58,997 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 36 predicate places. [2024-06-04 17:57:58,997 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 351 flow [2024-06-04 17:57:58,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:58,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:58,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:58,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:57:58,998 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-04 17:57:58,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:58,998 INFO L85 PathProgramCache]: Analyzing trace with hash 692172944, now seen corresponding path program 2 times [2024-06-04 17:57:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:58,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812694412] [2024-06-04 17:57:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:58,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:02,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:02,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812694412] [2024-06-04 17:58:02,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812694412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:02,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:02,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:58:02,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433648261] [2024-06-04 17:58:02,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:02,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:58:02,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:02,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:58:02,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:58:02,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:02,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 351 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:02,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:02,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:02,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:02,606 INFO L124 PetriNetUnfolderBase]: 152/281 cut-off events. [2024-06-04 17:58:02,607 INFO L125 PetriNetUnfolderBase]: For 1889/1889 co-relation queries the response was YES. [2024-06-04 17:58:02,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 281 events. 152/281 cut-off events. For 1889/1889 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 921 event pairs, 31 based on Foata normal form. 1/281 useless extension candidates. Maximal degree in co-relation 1241. Up to 237 conditions per place. [2024-06-04 17:58:02,609 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 49 selfloop transitions, 16 changer transitions 0/67 dead transitions. [2024-06-04 17:58:02,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 531 flow [2024-06-04 17:58:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:58:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:58:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-04 17:58:02,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-04 17:58:02,611 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 351 flow. Second operand 8 states and 87 transitions. [2024-06-04 17:58:02,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 531 flow [2024-06-04 17:58:02,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 501 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 17:58:02,614 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 378 flow [2024-06-04 17:58:02,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=378, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2024-06-04 17:58:02,614 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2024-06-04 17:58:02,615 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 378 flow [2024-06-04 17:58:02,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:02,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:02,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:02,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:58:02,615 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-04 17:58:02,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1624766409, now seen corresponding path program 1 times [2024-06-04 17:58:02,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:02,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439206119] [2024-06-04 17:58:02,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:02,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:05,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:05,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439206119] [2024-06-04 17:58:05,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439206119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:05,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:05,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:58:05,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568825217] [2024-06-04 17:58:05,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:05,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:58:05,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:05,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:58:05,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:58:05,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:05,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 378 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:05,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:05,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:05,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:06,120 INFO L124 PetriNetUnfolderBase]: 174/317 cut-off events. [2024-06-04 17:58:06,120 INFO L125 PetriNetUnfolderBase]: For 2610/2610 co-relation queries the response was YES. [2024-06-04 17:58:06,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 317 events. 174/317 cut-off events. For 2610/2610 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1089 event pairs, 29 based on Foata normal form. 4/320 useless extension candidates. Maximal degree in co-relation 1430. Up to 174 conditions per place. [2024-06-04 17:58:06,123 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 49 selfloop transitions, 32 changer transitions 0/83 dead transitions. [2024-06-04 17:58:06,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 83 transitions, 724 flow [2024-06-04 17:58:06,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:58:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:58:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 17:58:06,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40370370370370373 [2024-06-04 17:58:06,124 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 378 flow. Second operand 9 states and 109 transitions. [2024-06-04 17:58:06,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 83 transitions, 724 flow [2024-06-04 17:58:06,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 689 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 17:58:06,129 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 463 flow [2024-06-04 17:58:06,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=463, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2024-06-04 17:58:06,130 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 43 predicate places. [2024-06-04 17:58:06,130 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 463 flow [2024-06-04 17:58:06,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:06,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:06,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:06,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:58:06,130 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-04 17:58:06,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:06,130 INFO L85 PathProgramCache]: Analyzing trace with hash 695897749, now seen corresponding path program 2 times [2024-06-04 17:58:06,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:06,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240014620] [2024-06-04 17:58:06,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:06,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240014620] [2024-06-04 17:58:09,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240014620] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:09,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:09,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:58:09,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893153192] [2024-06-04 17:58:09,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:09,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:58:09,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:09,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:58:09,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:58:09,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:09,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 463 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:09,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:09,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:09,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:09,742 INFO L124 PetriNetUnfolderBase]: 227/403 cut-off events. [2024-06-04 17:58:09,743 INFO L125 PetriNetUnfolderBase]: For 3630/3630 co-relation queries the response was YES. [2024-06-04 17:58:09,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 403 events. 227/403 cut-off events. For 3630/3630 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1491 event pairs, 38 based on Foata normal form. 2/404 useless extension candidates. Maximal degree in co-relation 2000. Up to 297 conditions per place. [2024-06-04 17:58:09,746 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 64 selfloop transitions, 31 changer transitions 0/97 dead transitions. [2024-06-04 17:58:09,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 97 transitions, 920 flow [2024-06-04 17:58:09,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:58:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:58:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-04 17:58:09,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 17:58:09,747 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 463 flow. Second operand 11 states and 120 transitions. [2024-06-04 17:58:09,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 97 transitions, 920 flow [2024-06-04 17:58:09,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 97 transitions, 873 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-04 17:58:09,753 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 625 flow [2024-06-04 17:58:09,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=625, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2024-06-04 17:58:09,754 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 52 predicate places. [2024-06-04 17:58:09,754 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 625 flow [2024-06-04 17:58:09,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:09,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:09,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:09,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:58:09,755 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-04 17:58:09,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:09,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1692700203, now seen corresponding path program 3 times [2024-06-04 17:58:09,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:09,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300636768] [2024-06-04 17:58:09,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:09,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:12,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:12,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300636768] [2024-06-04 17:58:12,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300636768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:12,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:12,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:58:12,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413238727] [2024-06-04 17:58:12,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:12,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:58:12,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:12,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:58:12,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:58:13,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:13,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 625 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:13,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:13,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:13,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:13,334 INFO L124 PetriNetUnfolderBase]: 221/395 cut-off events. [2024-06-04 17:58:13,334 INFO L125 PetriNetUnfolderBase]: For 3941/3941 co-relation queries the response was YES. [2024-06-04 17:58:13,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2080 conditions, 395 events. 221/395 cut-off events. For 3941/3941 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1457 event pairs, 32 based on Foata normal form. 4/398 useless extension candidates. Maximal degree in co-relation 2040. Up to 296 conditions per place. [2024-06-04 17:58:13,338 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 62 selfloop transitions, 29 changer transitions 0/93 dead transitions. [2024-06-04 17:58:13,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 923 flow [2024-06-04 17:58:13,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:58:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:58:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-04 17:58:13,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3814814814814815 [2024-06-04 17:58:13,339 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 625 flow. Second operand 9 states and 103 transitions. [2024-06-04 17:58:13,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 923 flow [2024-06-04 17:58:13,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 93 transitions, 891 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-04 17:58:13,346 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 658 flow [2024-06-04 17:58:13,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=658, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2024-06-04 17:58:13,347 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2024-06-04 17:58:13,347 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 658 flow [2024-06-04 17:58:13,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:13,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:13,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:13,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:58:13,347 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-04 17:58:13,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash 695892014, now seen corresponding path program 3 times [2024-06-04 17:58:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:13,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702982003] [2024-06-04 17:58:13,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:16,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:16,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702982003] [2024-06-04 17:58:16,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702982003] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:16,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:16,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:58:16,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464932557] [2024-06-04 17:58:16,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:16,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:58:16,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:16,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:58:16,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:58:16,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:16,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 658 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:16,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:16,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:16,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:17,202 INFO L124 PetriNetUnfolderBase]: 217/388 cut-off events. [2024-06-04 17:58:17,202 INFO L125 PetriNetUnfolderBase]: For 4008/4008 co-relation queries the response was YES. [2024-06-04 17:58:17,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2104 conditions, 388 events. 217/388 cut-off events. For 4008/4008 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1423 event pairs, 41 based on Foata normal form. 1/388 useless extension candidates. Maximal degree in co-relation 2062. Up to 355 conditions per place. [2024-06-04 17:58:17,205 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 69 selfloop transitions, 15 changer transitions 0/86 dead transitions. [2024-06-04 17:58:17,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 86 transitions, 860 flow [2024-06-04 17:58:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:58:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:58:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-04 17:58:17,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3458333333333333 [2024-06-04 17:58:17,207 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 658 flow. Second operand 8 states and 83 transitions. [2024-06-04 17:58:17,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 86 transitions, 860 flow [2024-06-04 17:58:17,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 802 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-04 17:58:17,214 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 648 flow [2024-06-04 17:58:17,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=648, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2024-06-04 17:58:17,215 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2024-06-04 17:58:17,215 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 648 flow [2024-06-04 17:58:17,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:17,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:17,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:17,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:58:17,216 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-04 17:58:17,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:17,216 INFO L85 PathProgramCache]: Analyzing trace with hash -753600533, now seen corresponding path program 4 times [2024-06-04 17:58:17,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:17,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531311062] [2024-06-04 17:58:17,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:17,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:20,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:20,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531311062] [2024-06-04 17:58:20,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531311062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:20,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:20,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:58:20,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111744187] [2024-06-04 17:58:20,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:20,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:58:20,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:20,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:58:20,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:58:20,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:20,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 648 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:20,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:20,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:20,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:20,625 INFO L124 PetriNetUnfolderBase]: 231/412 cut-off events. [2024-06-04 17:58:20,626 INFO L125 PetriNetUnfolderBase]: For 4818/4818 co-relation queries the response was YES. [2024-06-04 17:58:20,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 412 events. 231/412 cut-off events. For 4818/4818 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1542 event pairs, 37 based on Foata normal form. 4/415 useless extension candidates. Maximal degree in co-relation 2159. Up to 292 conditions per place. [2024-06-04 17:58:20,629 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 68 selfloop transitions, 28 changer transitions 0/98 dead transitions. [2024-06-04 17:58:20,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 98 transitions, 996 flow [2024-06-04 17:58:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:58:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:58:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-04 17:58:20,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041666666666667 [2024-06-04 17:58:20,630 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 648 flow. Second operand 8 states and 97 transitions. [2024-06-04 17:58:20,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 98 transitions, 996 flow [2024-06-04 17:58:20,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 98 transitions, 954 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 17:58:20,639 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 699 flow [2024-06-04 17:58:20,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=699, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2024-06-04 17:58:20,639 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-04 17:58:20,639 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 699 flow [2024-06-04 17:58:20,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:20,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:20,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:20,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:58:20,640 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-04 17:58:20,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash -753594953, now seen corresponding path program 5 times [2024-06-04 17:58:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:20,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195872627] [2024-06-04 17:58:20,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:23,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195872627] [2024-06-04 17:58:23,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195872627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:23,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:23,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:58:23,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796898050] [2024-06-04 17:58:23,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:23,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:58:23,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:23,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:58:23,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:58:23,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:23,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 699 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:23,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:23,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:23,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:24,039 INFO L124 PetriNetUnfolderBase]: 237/422 cut-off events. [2024-06-04 17:58:24,039 INFO L125 PetriNetUnfolderBase]: For 5145/5145 co-relation queries the response was YES. [2024-06-04 17:58:24,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2346 conditions, 422 events. 237/422 cut-off events. For 5145/5145 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1592 event pairs, 38 based on Foata normal form. 2/423 useless extension candidates. Maximal degree in co-relation 2302. Up to 294 conditions per place. [2024-06-04 17:58:24,042 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 67 selfloop transitions, 27 changer transitions 0/96 dead transitions. [2024-06-04 17:58:24,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 997 flow [2024-06-04 17:58:24,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:58:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:58:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-04 17:58:24,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-04 17:58:24,044 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 699 flow. Second operand 8 states and 93 transitions. [2024-06-04 17:58:24,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 997 flow [2024-06-04 17:58:24,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 96 transitions, 905 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-04 17:58:24,053 INFO L231 Difference]: Finished difference. Result has 91 places, 80 transitions, 690 flow [2024-06-04 17:58:24,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=690, PETRI_PLACES=91, PETRI_TRANSITIONS=80} [2024-06-04 17:58:24,053 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-04 17:58:24,053 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 690 flow [2024-06-04 17:58:24,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:24,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:24,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:24,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:58:24,054 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-04 17:58:24,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:24,054 INFO L85 PathProgramCache]: Analyzing trace with hash -745976176, now seen corresponding path program 1 times [2024-06-04 17:58:24,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:24,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143803357] [2024-06-04 17:58:24,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:24,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:27,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:27,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143803357] [2024-06-04 17:58:27,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143803357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:27,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:27,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:58:27,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927501404] [2024-06-04 17:58:27,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:27,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:58:27,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:27,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:58:27,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:58:27,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:27,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 80 transitions, 690 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:27,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:27,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:27,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:27,343 INFO L124 PetriNetUnfolderBase]: 235/419 cut-off events. [2024-06-04 17:58:27,343 INFO L125 PetriNetUnfolderBase]: For 5286/5286 co-relation queries the response was YES. [2024-06-04 17:58:27,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 419 events. 235/419 cut-off events. For 5286/5286 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1569 event pairs, 41 based on Foata normal form. 1/419 useless extension candidates. Maximal degree in co-relation 2238. Up to 392 conditions per place. [2024-06-04 17:58:27,346 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 73 selfloop transitions, 12 changer transitions 0/87 dead transitions. [2024-06-04 17:58:27,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 87 transitions, 878 flow [2024-06-04 17:58:27,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:58:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:58:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2024-06-04 17:58:27,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-04 17:58:27,348 INFO L175 Difference]: Start difference. First operand has 91 places, 80 transitions, 690 flow. Second operand 6 states and 65 transitions. [2024-06-04 17:58:27,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 87 transitions, 878 flow [2024-06-04 17:58:27,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 87 transitions, 837 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 17:58:27,356 INFO L231 Difference]: Finished difference. Result has 93 places, 80 transitions, 681 flow [2024-06-04 17:58:27,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=681, PETRI_PLACES=93, PETRI_TRANSITIONS=80} [2024-06-04 17:58:27,356 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-04 17:58:27,356 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 681 flow [2024-06-04 17:58:27,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:27,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:27,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:27,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:58:27,357 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-04 17:58:27,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash -753600688, now seen corresponding path program 4 times [2024-06-04 17:58:27,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:27,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640185158] [2024-06-04 17:58:27,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:27,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:30,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:30,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640185158] [2024-06-04 17:58:30,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640185158] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:30,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:30,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:58:30,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926320160] [2024-06-04 17:58:30,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:30,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:58:30,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:30,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:58:30,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:58:30,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:30,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 681 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:30,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:30,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:30,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:30,976 INFO L124 PetriNetUnfolderBase]: 231/412 cut-off events. [2024-06-04 17:58:30,977 INFO L125 PetriNetUnfolderBase]: For 5493/5493 co-relation queries the response was YES. [2024-06-04 17:58:30,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 412 events. 231/412 cut-off events. For 5493/5493 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1535 event pairs, 43 based on Foata normal form. 1/412 useless extension candidates. Maximal degree in co-relation 2172. Up to 364 conditions per place. [2024-06-04 17:58:30,980 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 77 selfloop transitions, 17 changer transitions 0/96 dead transitions. [2024-06-04 17:58:30,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 96 transitions, 909 flow [2024-06-04 17:58:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:58:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:58:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-04 17:58:30,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-04 17:58:30,981 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 681 flow. Second operand 7 states and 83 transitions. [2024-06-04 17:58:30,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 96 transitions, 909 flow [2024-06-04 17:58:30,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 870 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:58:30,989 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 684 flow [2024-06-04 17:58:30,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=684, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2024-06-04 17:58:30,990 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 66 predicate places. [2024-06-04 17:58:30,990 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 684 flow [2024-06-04 17:58:30,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:30,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:30,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:30,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:58:30,991 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-04 17:58:30,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash -746243303, now seen corresponding path program 6 times [2024-06-04 17:58:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:30,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056812338] [2024-06-04 17:58:30,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:30,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:33,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:33,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056812338] [2024-06-04 17:58:33,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056812338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:33,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:33,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:58:33,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580807188] [2024-06-04 17:58:33,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:33,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:58:33,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:33,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:58:33,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:58:33,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:33,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 684 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:33,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:33,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:33,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:34,236 INFO L124 PetriNetUnfolderBase]: 232/414 cut-off events. [2024-06-04 17:58:34,237 INFO L125 PetriNetUnfolderBase]: For 5525/5525 co-relation queries the response was YES. [2024-06-04 17:58:34,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2228 conditions, 414 events. 232/414 cut-off events. For 5525/5525 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1551 event pairs, 38 based on Foata normal form. 2/415 useless extension candidates. Maximal degree in co-relation 2182. Up to 382 conditions per place. [2024-06-04 17:58:34,240 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 77 selfloop transitions, 13 changer transitions 0/92 dead transitions. [2024-06-04 17:58:34,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 92 transitions, 913 flow [2024-06-04 17:58:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:58:34,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:58:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-04 17:58:34,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-04 17:58:34,241 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 684 flow. Second operand 8 states and 81 transitions. [2024-06-04 17:58:34,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 92 transitions, 913 flow [2024-06-04 17:58:34,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 92 transitions, 861 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 17:58:34,250 INFO L231 Difference]: Finished difference. Result has 96 places, 82 transitions, 690 flow [2024-06-04 17:58:34,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=690, PETRI_PLACES=96, PETRI_TRANSITIONS=82} [2024-06-04 17:58:34,250 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-04 17:58:34,250 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 82 transitions, 690 flow [2024-06-04 17:58:34,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:34,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:34,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:34,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:58:34,251 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-04 17:58:34,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:34,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1449251018, now seen corresponding path program 1 times [2024-06-04 17:58:34,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:34,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043075917] [2024-06-04 17:58:34,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:34,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:37,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:37,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043075917] [2024-06-04 17:58:37,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043075917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:37,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:37,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:58:37,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832507901] [2024-06-04 17:58:37,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:37,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:58:37,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:37,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:58:37,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:58:37,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:37,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 82 transitions, 690 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:37,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:37,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:37,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:38,306 INFO L124 PetriNetUnfolderBase]: 236/422 cut-off events. [2024-06-04 17:58:38,306 INFO L125 PetriNetUnfolderBase]: For 5984/5984 co-relation queries the response was YES. [2024-06-04 17:58:38,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2275 conditions, 422 events. 236/422 cut-off events. For 5984/5984 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1605 event pairs, 25 based on Foata normal form. 2/423 useless extension candidates. Maximal degree in co-relation 2229. Up to 315 conditions per place. [2024-06-04 17:58:38,310 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 73 selfloop transitions, 30 changer transitions 0/105 dead transitions. [2024-06-04 17:58:38,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 105 transitions, 1000 flow [2024-06-04 17:58:38,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:58:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:58:38,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:58:38,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35333333333333333 [2024-06-04 17:58:38,311 INFO L175 Difference]: Start difference. First operand has 96 places, 82 transitions, 690 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:58:38,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 105 transitions, 1000 flow [2024-06-04 17:58:38,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 105 transitions, 953 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:58:38,319 INFO L231 Difference]: Finished difference. Result has 99 places, 83 transitions, 717 flow [2024-06-04 17:58:38,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=717, PETRI_PLACES=99, PETRI_TRANSITIONS=83} [2024-06-04 17:58:38,320 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 70 predicate places. [2024-06-04 17:58:38,320 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 83 transitions, 717 flow [2024-06-04 17:58:38,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:38,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:38,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:38,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:58:38,321 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-04 17:58:38,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash 200506150, now seen corresponding path program 2 times [2024-06-04 17:58:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:38,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792545231] [2024-06-04 17:58:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:38,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:42,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:42,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:42,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792545231] [2024-06-04 17:58:42,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792545231] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:42,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:42,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:58:42,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117734866] [2024-06-04 17:58:42,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:42,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:58:42,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:42,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:58:42,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:58:42,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:42,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 83 transitions, 717 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:42,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:42,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:42,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:42,383 INFO L124 PetriNetUnfolderBase]: 240/430 cut-off events. [2024-06-04 17:58:42,383 INFO L125 PetriNetUnfolderBase]: For 6646/6646 co-relation queries the response was YES. [2024-06-04 17:58:42,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2359 conditions, 430 events. 240/430 cut-off events. For 6646/6646 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1655 event pairs, 39 based on Foata normal form. 2/431 useless extension candidates. Maximal degree in co-relation 2313. Up to 358 conditions per place. [2024-06-04 17:58:42,386 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 73 selfloop transitions, 29 changer transitions 0/104 dead transitions. [2024-06-04 17:58:42,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 104 transitions, 981 flow [2024-06-04 17:58:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:58:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:58:42,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:58:42,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35333333333333333 [2024-06-04 17:58:42,387 INFO L175 Difference]: Start difference. First operand has 99 places, 83 transitions, 717 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:58:42,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 104 transitions, 981 flow [2024-06-04 17:58:42,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 104 transitions, 913 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:58:42,397 INFO L231 Difference]: Finished difference. Result has 102 places, 84 transitions, 725 flow [2024-06-04 17:58:42,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=725, PETRI_PLACES=102, PETRI_TRANSITIONS=84} [2024-06-04 17:58:42,397 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 73 predicate places. [2024-06-04 17:58:42,397 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 84 transitions, 725 flow [2024-06-04 17:58:42,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:42,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:42,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:42,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:58:42,398 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-04 17:58:42,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:42,399 INFO L85 PathProgramCache]: Analyzing trace with hash -17469676, now seen corresponding path program 1 times [2024-06-04 17:58:42,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:42,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449262262] [2024-06-04 17:58:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:42,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:45,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:45,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449262262] [2024-06-04 17:58:45,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449262262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:45,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:45,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:58:45,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661259406] [2024-06-04 17:58:45,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:45,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:58:45,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:45,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:58:45,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:58:46,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:46,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 84 transitions, 725 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:46,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:46,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:46,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:46,318 INFO L124 PetriNetUnfolderBase]: 236/424 cut-off events. [2024-06-04 17:58:46,318 INFO L125 PetriNetUnfolderBase]: For 6688/6688 co-relation queries the response was YES. [2024-06-04 17:58:46,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 424 events. 236/424 cut-off events. For 6688/6688 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1616 event pairs, 24 based on Foata normal form. 2/425 useless extension candidates. Maximal degree in co-relation 2248. Up to 295 conditions per place. [2024-06-04 17:58:46,321 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 65 selfloop transitions, 43 changer transitions 0/110 dead transitions. [2024-06-04 17:58:46,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 110 transitions, 1087 flow [2024-06-04 17:58:46,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:58:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:58:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 17:58:46,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2024-06-04 17:58:46,323 INFO L175 Difference]: Start difference. First operand has 102 places, 84 transitions, 725 flow. Second operand 10 states and 112 transitions. [2024-06-04 17:58:46,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 110 transitions, 1087 flow [2024-06-04 17:58:46,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 110 transitions, 1021 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 17:58:46,333 INFO L231 Difference]: Finished difference. Result has 106 places, 89 transitions, 833 flow [2024-06-04 17:58:46,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=833, PETRI_PLACES=106, PETRI_TRANSITIONS=89} [2024-06-04 17:58:46,334 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 77 predicate places. [2024-06-04 17:58:46,334 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 89 transitions, 833 flow [2024-06-04 17:58:46,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:46,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:46,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:46,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:58:46,335 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-04 17:58:46,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:46,335 INFO L85 PathProgramCache]: Analyzing trace with hash -17474450, now seen corresponding path program 3 times [2024-06-04 17:58:46,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:46,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983479797] [2024-06-04 17:58:46,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:46,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:50,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:50,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983479797] [2024-06-04 17:58:50,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983479797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:50,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:50,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:58:50,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401255910] [2024-06-04 17:58:50,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:50,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:58:50,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:50,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:58:50,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:58:50,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:50,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 89 transitions, 833 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:50,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:50,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:50,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:50,424 INFO L124 PetriNetUnfolderBase]: 240/432 cut-off events. [2024-06-04 17:58:50,424 INFO L125 PetriNetUnfolderBase]: For 7417/7417 co-relation queries the response was YES. [2024-06-04 17:58:50,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2452 conditions, 432 events. 240/432 cut-off events. For 7417/7417 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1676 event pairs, 38 based on Foata normal form. 2/433 useless extension candidates. Maximal degree in co-relation 2402. Up to 378 conditions per place. [2024-06-04 17:58:50,427 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 83 selfloop transitions, 22 changer transitions 0/107 dead transitions. [2024-06-04 17:58:50,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 107 transitions, 1092 flow [2024-06-04 17:58:50,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:58:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:58:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-04 17:58:50,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34 [2024-06-04 17:58:50,428 INFO L175 Difference]: Start difference. First operand has 106 places, 89 transitions, 833 flow. Second operand 10 states and 102 transitions. [2024-06-04 17:58:50,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 107 transitions, 1092 flow [2024-06-04 17:58:50,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 107 transitions, 1023 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-04 17:58:50,439 INFO L231 Difference]: Finished difference. Result has 108 places, 90 transitions, 823 flow [2024-06-04 17:58:50,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=823, PETRI_PLACES=108, PETRI_TRANSITIONS=90} [2024-06-04 17:58:50,440 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-04 17:58:50,440 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 90 transitions, 823 flow [2024-06-04 17:58:50,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:50,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:50,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:50,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:58:50,440 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-04 17:58:50,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:50,441 INFO L85 PathProgramCache]: Analyzing trace with hash 318593830, now seen corresponding path program 4 times [2024-06-04 17:58:50,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:50,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936898559] [2024-06-04 17:58:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:50,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:54,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:54,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936898559] [2024-06-04 17:58:54,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936898559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:54,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:54,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:58:54,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730093416] [2024-06-04 17:58:54,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:54,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:58:54,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:54,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:58:54,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:58:54,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:54,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 90 transitions, 823 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:54,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:54,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:54,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:54,705 INFO L124 PetriNetUnfolderBase]: 237/427 cut-off events. [2024-06-04 17:58:54,706 INFO L125 PetriNetUnfolderBase]: For 6840/6840 co-relation queries the response was YES. [2024-06-04 17:58:54,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 427 events. 237/427 cut-off events. For 6840/6840 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1656 event pairs, 24 based on Foata normal form. 2/428 useless extension candidates. Maximal degree in co-relation 2303. Up to 344 conditions per place. [2024-06-04 17:58:54,708 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 82 selfloop transitions, 24 changer transitions 0/108 dead transitions. [2024-06-04 17:58:54,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 108 transitions, 1079 flow [2024-06-04 17:58:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:58:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:58:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-04 17:58:54,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37916666666666665 [2024-06-04 17:58:54,709 INFO L175 Difference]: Start difference. First operand has 108 places, 90 transitions, 823 flow. Second operand 8 states and 91 transitions. [2024-06-04 17:58:54,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 108 transitions, 1079 flow [2024-06-04 17:58:54,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 108 transitions, 1027 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 17:58:54,718 INFO L231 Difference]: Finished difference. Result has 108 places, 90 transitions, 826 flow [2024-06-04 17:58:54,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=826, PETRI_PLACES=108, PETRI_TRANSITIONS=90} [2024-06-04 17:58:54,719 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-04 17:58:54,719 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 90 transitions, 826 flow [2024-06-04 17:58:54,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:54,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:54,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:54,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:58:54,720 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-04 17:58:54,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash 97821494, now seen corresponding path program 2 times [2024-06-04 17:58:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:54,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387959702] [2024-06-04 17:58:54,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:54,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:58,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-04 17:58:58,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:58,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387959702] [2024-06-04 17:58:58,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387959702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:58,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:58,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:58:58,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36249173] [2024-06-04 17:58:58,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:58,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:58:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:58,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:58:58,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:58:58,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:58:58,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 90 transitions, 826 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:58,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:58,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:58:58,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:58,375 INFO L124 PetriNetUnfolderBase]: 239/431 cut-off events. [2024-06-04 17:58:58,375 INFO L125 PetriNetUnfolderBase]: For 7330/7330 co-relation queries the response was YES. [2024-06-04 17:58:58,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2346 conditions, 431 events. 239/431 cut-off events. For 7330/7330 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1687 event pairs, 26 based on Foata normal form. 4/434 useless extension candidates. Maximal degree in co-relation 2295. Up to 295 conditions per place. [2024-06-04 17:58:58,378 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 71 selfloop transitions, 41 changer transitions 0/114 dead transitions. [2024-06-04 17:58:58,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 1134 flow [2024-06-04 17:58:58,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:58:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:58:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 17:58:58,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3962962962962963 [2024-06-04 17:58:58,379 INFO L175 Difference]: Start difference. First operand has 108 places, 90 transitions, 826 flow. Second operand 9 states and 107 transitions. [2024-06-04 17:58:58,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 1134 flow [2024-06-04 17:58:58,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 114 transitions, 1070 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 17:58:58,392 INFO L231 Difference]: Finished difference. Result has 109 places, 92 transitions, 891 flow [2024-06-04 17:58:58,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=891, PETRI_PLACES=109, PETRI_TRANSITIONS=92} [2024-06-04 17:58:58,392 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 80 predicate places. [2024-06-04 17:58:58,393 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 92 transitions, 891 flow [2024-06-04 17:58:58,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:58,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:58,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:58,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:58:58,394 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-04 17:58:58,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash 98001418, now seen corresponding path program 1 times [2024-06-04 17:58:58,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:58,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244200584] [2024-06-04 17:58:58,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:58,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:01,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:01,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244200584] [2024-06-04 17:59:01,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244200584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:01,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:01,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:59:01,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705422167] [2024-06-04 17:59:01,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:01,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:59:01,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:01,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:59:01,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:59:02,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:02,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 92 transitions, 891 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:02,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:02,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:02,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:02,241 INFO L124 PetriNetUnfolderBase]: 243/439 cut-off events. [2024-06-04 17:59:02,241 INFO L125 PetriNetUnfolderBase]: For 6880/6880 co-relation queries the response was YES. [2024-06-04 17:59:02,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2432 conditions, 439 events. 243/439 cut-off events. For 6880/6880 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1735 event pairs, 30 based on Foata normal form. 2/440 useless extension candidates. Maximal degree in co-relation 2381. Up to 377 conditions per place. [2024-06-04 17:59:02,244 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 84 selfloop transitions, 22 changer transitions 0/108 dead transitions. [2024-06-04 17:59:02,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 108 transitions, 1147 flow [2024-06-04 17:59:02,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:59:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:59:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-04 17:59:02,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34814814814814815 [2024-06-04 17:59:02,246 INFO L175 Difference]: Start difference. First operand has 109 places, 92 transitions, 891 flow. Second operand 9 states and 94 transitions. [2024-06-04 17:59:02,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 108 transitions, 1147 flow [2024-06-04 17:59:02,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 108 transitions, 1080 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 17:59:02,258 INFO L231 Difference]: Finished difference. Result has 110 places, 93 transitions, 881 flow [2024-06-04 17:59:02,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=881, PETRI_PLACES=110, PETRI_TRANSITIONS=93} [2024-06-04 17:59:02,259 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 81 predicate places. [2024-06-04 17:59:02,259 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 93 transitions, 881 flow [2024-06-04 17:59:02,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:02,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:02,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:02,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:59:02,259 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-04 17:59:02,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1658705178, now seen corresponding path program 3 times [2024-06-04 17:59:02,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:02,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532195257] [2024-06-04 17:59:02,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:02,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:05,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:05,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:05,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532195257] [2024-06-04 17:59:05,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532195257] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:05,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:05,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:59:05,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737305096] [2024-06-04 17:59:05,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:05,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:59:05,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:05,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:59:05,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:59:05,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:05,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 93 transitions, 881 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:05,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:05,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:05,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:05,853 INFO L124 PetriNetUnfolderBase]: 240/435 cut-off events. [2024-06-04 17:59:05,854 INFO L125 PetriNetUnfolderBase]: For 5857/5857 co-relation queries the response was YES. [2024-06-04 17:59:05,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 435 events. 240/435 cut-off events. For 5857/5857 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1717 event pairs, 30 based on Foata normal form. 2/436 useless extension candidates. Maximal degree in co-relation 2279. Up to 317 conditions per place. [2024-06-04 17:59:05,857 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 76 selfloop transitions, 36 changer transitions 0/114 dead transitions. [2024-06-04 17:59:05,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 114 transitions, 1209 flow [2024-06-04 17:59:05,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:59:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:59:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-04 17:59:05,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-04 17:59:05,859 INFO L175 Difference]: Start difference. First operand has 110 places, 93 transitions, 881 flow. Second operand 8 states and 99 transitions. [2024-06-04 17:59:05,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 114 transitions, 1209 flow [2024-06-04 17:59:05,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 114 transitions, 1164 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-04 17:59:05,870 INFO L231 Difference]: Finished difference. Result has 111 places, 93 transitions, 924 flow [2024-06-04 17:59:05,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=924, PETRI_PLACES=111, PETRI_TRANSITIONS=93} [2024-06-04 17:59:05,871 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 82 predicate places. [2024-06-04 17:59:05,871 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 93 transitions, 924 flow [2024-06-04 17:59:05,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:05,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:05,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:05,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:59:05,871 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-04 17:59:05,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1658698234, now seen corresponding path program 2 times [2024-06-04 17:59:05,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:05,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574882066] [2024-06-04 17:59:05,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:05,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:09,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:09,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574882066] [2024-06-04 17:59:09,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574882066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:09,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:09,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:59:09,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80086829] [2024-06-04 17:59:09,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:09,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:59:09,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:09,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:59:09,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:59:09,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:09,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 93 transitions, 924 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:09,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:09,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:09,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:09,689 INFO L124 PetriNetUnfolderBase]: 244/443 cut-off events. [2024-06-04 17:59:09,689 INFO L125 PetriNetUnfolderBase]: For 6343/6343 co-relation queries the response was YES. [2024-06-04 17:59:09,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 443 events. 244/443 cut-off events. For 6343/6343 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1762 event pairs, 38 based on Foata normal form. 2/444 useless extension candidates. Maximal degree in co-relation 2387. Up to 413 conditions per place. [2024-06-04 17:59:09,692 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 90 selfloop transitions, 12 changer transitions 0/104 dead transitions. [2024-06-04 17:59:09,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 104 transitions, 1160 flow [2024-06-04 17:59:09,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:59:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:59:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2024-06-04 17:59:09,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 17:59:09,700 INFO L175 Difference]: Start difference. First operand has 111 places, 93 transitions, 924 flow. Second operand 8 states and 80 transitions. [2024-06-04 17:59:09,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 104 transitions, 1160 flow [2024-06-04 17:59:09,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 1077 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 17:59:09,712 INFO L231 Difference]: Finished difference. Result has 113 places, 94 transitions, 879 flow [2024-06-04 17:59:09,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=879, PETRI_PLACES=113, PETRI_TRANSITIONS=94} [2024-06-04 17:59:09,712 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2024-06-04 17:59:09,713 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 94 transitions, 879 flow [2024-06-04 17:59:09,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:09,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:09,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:09,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:59:09,713 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-04 17:59:09,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:09,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1650127354, now seen corresponding path program 3 times [2024-06-04 17:59:09,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:09,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734654450] [2024-06-04 17:59:09,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:09,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:12,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:12,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734654450] [2024-06-04 17:59:12,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734654450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:12,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:12,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:59:12,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568434352] [2024-06-04 17:59:12,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:12,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:59:12,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:12,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:59:12,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:59:13,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:13,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 94 transitions, 879 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:13,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:13,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:13,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:13,317 INFO L124 PetriNetUnfolderBase]: 248/451 cut-off events. [2024-06-04 17:59:13,318 INFO L125 PetriNetUnfolderBase]: For 6647/6647 co-relation queries the response was YES. [2024-06-04 17:59:13,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2412 conditions, 451 events. 248/451 cut-off events. For 6647/6647 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1810 event pairs, 36 based on Foata normal form. 2/452 useless extension candidates. Maximal degree in co-relation 2360. Up to 419 conditions per place. [2024-06-04 17:59:13,321 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 92 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2024-06-04 17:59:13,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 104 transitions, 1113 flow [2024-06-04 17:59:13,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:59:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:59:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2024-06-04 17:59:13,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3380952380952381 [2024-06-04 17:59:13,322 INFO L175 Difference]: Start difference. First operand has 113 places, 94 transitions, 879 flow. Second operand 7 states and 71 transitions. [2024-06-04 17:59:13,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 104 transitions, 1113 flow [2024-06-04 17:59:13,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 104 transitions, 1085 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 17:59:13,335 INFO L231 Difference]: Finished difference. Result has 114 places, 95 transitions, 887 flow [2024-06-04 17:59:13,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=887, PETRI_PLACES=114, PETRI_TRANSITIONS=95} [2024-06-04 17:59:13,336 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 85 predicate places. [2024-06-04 17:59:13,336 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 95 transitions, 887 flow [2024-06-04 17:59:13,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:13,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:13,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:13,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:59:13,337 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-04 17:59:13,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2140269182, now seen corresponding path program 4 times [2024-06-04 17:59:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:13,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068334075] [2024-06-04 17:59:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:13,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:16,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:16,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068334075] [2024-06-04 17:59:16,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068334075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:16,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:16,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:59:16,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834760063] [2024-06-04 17:59:16,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:16,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:59:16,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:16,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:59:16,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:59:16,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:16,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 95 transitions, 887 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:16,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:16,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:16,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:16,921 INFO L124 PetriNetUnfolderBase]: 245/446 cut-off events. [2024-06-04 17:59:16,921 INFO L125 PetriNetUnfolderBase]: For 6404/6404 co-relation queries the response was YES. [2024-06-04 17:59:16,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2350 conditions, 446 events. 245/446 cut-off events. For 6404/6404 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1792 event pairs, 35 based on Foata normal form. 2/447 useless extension candidates. Maximal degree in co-relation 2297. Up to 407 conditions per place. [2024-06-04 17:59:16,924 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 88 selfloop transitions, 14 changer transitions 0/104 dead transitions. [2024-06-04 17:59:16,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 104 transitions, 1113 flow [2024-06-04 17:59:16,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:59:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:59:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2024-06-04 17:59:16,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3476190476190476 [2024-06-04 17:59:16,925 INFO L175 Difference]: Start difference. First operand has 114 places, 95 transitions, 887 flow. Second operand 7 states and 73 transitions. [2024-06-04 17:59:16,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 104 transitions, 1113 flow [2024-06-04 17:59:16,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 104 transitions, 1087 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:59:16,938 INFO L231 Difference]: Finished difference. Result has 116 places, 95 transitions, 895 flow [2024-06-04 17:59:16,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=895, PETRI_PLACES=116, PETRI_TRANSITIONS=95} [2024-06-04 17:59:16,939 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 87 predicate places. [2024-06-04 17:59:16,939 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 95 transitions, 895 flow [2024-06-04 17:59:16,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:16,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:16,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:16,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:59:16,939 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-04 17:59:16,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:16,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2140268934, now seen corresponding path program 1 times [2024-06-04 17:59:16,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:16,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83635130] [2024-06-04 17:59:16,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:16,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:20,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:20,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83635130] [2024-06-04 17:59:20,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83635130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:20,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:20,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:59:20,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540850669] [2024-06-04 17:59:20,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:20,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:59:20,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:20,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:59:20,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:59:20,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:20,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 95 transitions, 895 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:20,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:20,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:20,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:20,602 INFO L124 PetriNetUnfolderBase]: 242/441 cut-off events. [2024-06-04 17:59:20,602 INFO L125 PetriNetUnfolderBase]: For 6033/6033 co-relation queries the response was YES. [2024-06-04 17:59:20,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2312 conditions, 441 events. 242/441 cut-off events. For 6033/6033 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1761 event pairs, 35 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 2258. Up to 403 conditions per place. [2024-06-04 17:59:20,604 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 86 selfloop transitions, 16 changer transitions 0/104 dead transitions. [2024-06-04 17:59:20,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 104 transitions, 1123 flow [2024-06-04 17:59:20,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:59:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:59:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-04 17:59:20,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2024-06-04 17:59:20,605 INFO L175 Difference]: Start difference. First operand has 116 places, 95 transitions, 895 flow. Second operand 7 states and 74 transitions. [2024-06-04 17:59:20,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 104 transitions, 1123 flow [2024-06-04 17:59:20,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 104 transitions, 1069 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 17:59:20,618 INFO L231 Difference]: Finished difference. Result has 117 places, 95 transitions, 881 flow [2024-06-04 17:59:20,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=881, PETRI_PLACES=117, PETRI_TRANSITIONS=95} [2024-06-04 17:59:20,619 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 88 predicate places. [2024-06-04 17:59:20,619 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 95 transitions, 881 flow [2024-06-04 17:59:20,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:20,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:20,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:20,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:59:20,619 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-04 17:59:20,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:20,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1918850294, now seen corresponding path program 1 times [2024-06-04 17:59:20,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:20,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319895224] [2024-06-04 17:59:20,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:20,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:24,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:24,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319895224] [2024-06-04 17:59:24,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319895224] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:24,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:24,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:59:24,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475266668] [2024-06-04 17:59:24,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:24,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:59:24,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:24,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:59:24,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:59:24,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:24,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 95 transitions, 881 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:24,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:24,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:24,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:24,876 INFO L124 PetriNetUnfolderBase]: 302/561 cut-off events. [2024-06-04 17:59:24,876 INFO L125 PetriNetUnfolderBase]: For 13569/13569 co-relation queries the response was YES. [2024-06-04 17:59:24,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3022 conditions, 561 events. 302/561 cut-off events. For 13569/13569 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2446 event pairs, 60 based on Foata normal form. 8/568 useless extension candidates. Maximal degree in co-relation 2967. Up to 229 conditions per place. [2024-06-04 17:59:24,879 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 80 selfloop transitions, 37 changer transitions 13/132 dead transitions. [2024-06-04 17:59:24,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 132 transitions, 1347 flow [2024-06-04 17:59:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:59:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:59:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 17:59:24,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-04 17:59:24,880 INFO L175 Difference]: Start difference. First operand has 117 places, 95 transitions, 881 flow. Second operand 11 states and 124 transitions. [2024-06-04 17:59:24,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 132 transitions, 1347 flow [2024-06-04 17:59:24,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 132 transitions, 1249 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 17:59:24,897 INFO L231 Difference]: Finished difference. Result has 121 places, 96 transitions, 910 flow [2024-06-04 17:59:24,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=910, PETRI_PLACES=121, PETRI_TRANSITIONS=96} [2024-06-04 17:59:24,897 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 92 predicate places. [2024-06-04 17:59:24,897 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 96 transitions, 910 flow [2024-06-04 17:59:24,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:24,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:24,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:24,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:59:24,898 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-04 17:59:24,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1920724244, now seen corresponding path program 2 times [2024-06-04 17:59:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:24,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679890297] [2024-06-04 17:59:24,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:28,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:28,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679890297] [2024-06-04 17:59:28,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679890297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:28,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:28,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:59:28,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054511639] [2024-06-04 17:59:28,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:28,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:59:28,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:28,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:59:28,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:59:28,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:28,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 96 transitions, 910 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:28,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:28,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:28,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:29,159 INFO L124 PetriNetUnfolderBase]: 322/603 cut-off events. [2024-06-04 17:59:29,160 INFO L125 PetriNetUnfolderBase]: For 19664/19664 co-relation queries the response was YES. [2024-06-04 17:59:29,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3533 conditions, 603 events. 322/603 cut-off events. For 19664/19664 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2736 event pairs, 72 based on Foata normal form. 8/610 useless extension candidates. Maximal degree in co-relation 3477. Up to 341 conditions per place. [2024-06-04 17:59:29,166 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 79 selfloop transitions, 37 changer transitions 9/127 dead transitions. [2024-06-04 17:59:29,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 127 transitions, 1322 flow [2024-06-04 17:59:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:59:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:59:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2024-06-04 17:59:29,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-04 17:59:29,167 INFO L175 Difference]: Start difference. First operand has 121 places, 96 transitions, 910 flow. Second operand 12 states and 132 transitions. [2024-06-04 17:59:29,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 127 transitions, 1322 flow [2024-06-04 17:59:29,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 127 transitions, 1285 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 17:59:29,185 INFO L231 Difference]: Finished difference. Result has 121 places, 92 transitions, 922 flow [2024-06-04 17:59:29,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=922, PETRI_PLACES=121, PETRI_TRANSITIONS=92} [2024-06-04 17:59:29,185 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 92 predicate places. [2024-06-04 17:59:29,186 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 92 transitions, 922 flow [2024-06-04 17:59:29,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:29,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:29,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:29,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:59:29,186 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-04 17:59:29,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:29,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1920727964, now seen corresponding path program 3 times [2024-06-04 17:59:29,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:29,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820157745] [2024-06-04 17:59:29,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:29,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:33,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:33,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820157745] [2024-06-04 17:59:33,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820157745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:33,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:33,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:59:33,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962173681] [2024-06-04 17:59:33,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:33,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:59:33,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:33,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:59:33,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:59:33,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:33,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 92 transitions, 922 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:33,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:33,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:33,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:33,445 INFO L124 PetriNetUnfolderBase]: 311/586 cut-off events. [2024-06-04 17:59:33,446 INFO L125 PetriNetUnfolderBase]: For 19315/19315 co-relation queries the response was YES. [2024-06-04 17:59:33,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3433 conditions, 586 events. 311/586 cut-off events. For 19315/19315 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2652 event pairs, 77 based on Foata normal form. 12/597 useless extension candidates. Maximal degree in co-relation 3378. Up to 410 conditions per place. [2024-06-04 17:59:33,449 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 69 selfloop transitions, 34 changer transitions 14/119 dead transitions. [2024-06-04 17:59:33,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 119 transitions, 1248 flow [2024-06-04 17:59:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:59:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:59:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 129 transitions. [2024-06-04 17:59:33,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-04 17:59:33,451 INFO L175 Difference]: Start difference. First operand has 121 places, 92 transitions, 922 flow. Second operand 12 states and 129 transitions. [2024-06-04 17:59:33,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 119 transitions, 1248 flow [2024-06-04 17:59:33,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 119 transitions, 1167 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-04 17:59:33,468 INFO L231 Difference]: Finished difference. Result has 118 places, 86 transitions, 860 flow [2024-06-04 17:59:33,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=860, PETRI_PLACES=118, PETRI_TRANSITIONS=86} [2024-06-04 17:59:33,468 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 89 predicate places. [2024-06-04 17:59:33,468 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 86 transitions, 860 flow [2024-06-04 17:59:33,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:33,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:33,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:33,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:59:33,469 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-04 17:59:33,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1967553144, now seen corresponding path program 4 times [2024-06-04 17:59:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:33,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281561125] [2024-06-04 17:59:33,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:33,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:36,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:36,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281561125] [2024-06-04 17:59:36,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281561125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:36,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:36,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:59:36,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627506887] [2024-06-04 17:59:36,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:36,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:59:36,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:36,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:59:36,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:59:36,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:36,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 86 transitions, 860 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:36,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:36,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:36,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:37,127 INFO L124 PetriNetUnfolderBase]: 281/531 cut-off events. [2024-06-04 17:59:37,127 INFO L125 PetriNetUnfolderBase]: For 14443/14443 co-relation queries the response was YES. [2024-06-04 17:59:37,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3041 conditions, 531 events. 281/531 cut-off events. For 14443/14443 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2348 event pairs, 50 based on Foata normal form. 10/540 useless extension candidates. Maximal degree in co-relation 2988. Up to 364 conditions per place. [2024-06-04 17:59:37,130 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 60 selfloop transitions, 34 changer transitions 11/107 dead transitions. [2024-06-04 17:59:37,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 107 transitions, 1134 flow [2024-06-04 17:59:37,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:59:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:59:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-04 17:59:37,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3814814814814815 [2024-06-04 17:59:37,131 INFO L175 Difference]: Start difference. First operand has 118 places, 86 transitions, 860 flow. Second operand 9 states and 103 transitions. [2024-06-04 17:59:37,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 107 transitions, 1134 flow [2024-06-04 17:59:37,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 107 transitions, 1034 flow, removed 14 selfloop flow, removed 13 redundant places. [2024-06-04 17:59:37,145 INFO L231 Difference]: Finished difference. Result has 111 places, 83 transitions, 808 flow [2024-06-04 17:59:37,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=808, PETRI_PLACES=111, PETRI_TRANSITIONS=83} [2024-06-04 17:59:37,146 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 82 predicate places. [2024-06-04 17:59:37,146 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 83 transitions, 808 flow [2024-06-04 17:59:37,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:37,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:37,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:37,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:59:37,146 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-04 17:59:37,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1292193040, now seen corresponding path program 1 times [2024-06-04 17:59:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:37,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016867629] [2024-06-04 17:59:37,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:37,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:40,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:40,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016867629] [2024-06-04 17:59:40,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016867629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:40,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:40,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:59:40,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470276067] [2024-06-04 17:59:40,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:40,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:59:40,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:40,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:59:40,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:59:40,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:40,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 83 transitions, 808 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:40,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:40,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:40,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:41,166 INFO L124 PetriNetUnfolderBase]: 259/489 cut-off events. [2024-06-04 17:59:41,166 INFO L125 PetriNetUnfolderBase]: For 11931/11931 co-relation queries the response was YES. [2024-06-04 17:59:41,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2878 conditions, 489 events. 259/489 cut-off events. For 11931/11931 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2094 event pairs, 50 based on Foata normal form. 2/490 useless extension candidates. Maximal degree in co-relation 2826. Up to 334 conditions per place. [2024-06-04 17:59:41,169 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 54 selfloop transitions, 49 changer transitions 0/105 dead transitions. [2024-06-04 17:59:41,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 105 transitions, 1090 flow [2024-06-04 17:59:41,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:59:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:59:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2024-06-04 17:59:41,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2024-06-04 17:59:41,170 INFO L175 Difference]: Start difference. First operand has 111 places, 83 transitions, 808 flow. Second operand 12 states and 124 transitions. [2024-06-04 17:59:41,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 105 transitions, 1090 flow [2024-06-04 17:59:41,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 105 transitions, 1018 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-04 17:59:41,183 INFO L231 Difference]: Finished difference. Result has 112 places, 84 transitions, 861 flow [2024-06-04 17:59:41,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=861, PETRI_PLACES=112, PETRI_TRANSITIONS=84} [2024-06-04 17:59:41,183 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 83 predicate places. [2024-06-04 17:59:41,184 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 84 transitions, 861 flow [2024-06-04 17:59:41,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:41,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:41,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:41,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:59:41,184 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-04 17:59:41,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1286628850, now seen corresponding path program 2 times [2024-06-04 17:59:41,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:41,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963048908] [2024-06-04 17:59:41,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:41,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:44,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-04 17:59:44,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:44,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963048908] [2024-06-04 17:59:44,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963048908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:44,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:44,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:59:44,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266744144] [2024-06-04 17:59:44,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:44,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:59:44,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:44,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:59:44,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:59:44,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:44,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 84 transitions, 861 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:44,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:44,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:44,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:45,104 INFO L124 PetriNetUnfolderBase]: 272/520 cut-off events. [2024-06-04 17:59:45,104 INFO L125 PetriNetUnfolderBase]: For 13736/13736 co-relation queries the response was YES. [2024-06-04 17:59:45,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2917 conditions, 520 events. 272/520 cut-off events. For 13736/13736 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2307 event pairs, 53 based on Foata normal form. 12/531 useless extension candidates. Maximal degree in co-relation 2866. Up to 317 conditions per place. [2024-06-04 17:59:45,107 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 56 selfloop transitions, 39 changer transitions 10/107 dead transitions. [2024-06-04 17:59:45,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 107 transitions, 1159 flow [2024-06-04 17:59:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:59:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:59:45,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 17:59:45,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2024-06-04 17:59:45,108 INFO L175 Difference]: Start difference. First operand has 112 places, 84 transitions, 861 flow. Second operand 10 states and 112 transitions. [2024-06-04 17:59:45,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 107 transitions, 1159 flow [2024-06-04 17:59:45,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 107 transitions, 1046 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-04 17:59:45,120 INFO L231 Difference]: Finished difference. Result has 112 places, 79 transitions, 795 flow [2024-06-04 17:59:45,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=795, PETRI_PLACES=112, PETRI_TRANSITIONS=79} [2024-06-04 17:59:45,120 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 83 predicate places. [2024-06-04 17:59:45,121 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 79 transitions, 795 flow [2024-06-04 17:59:45,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:45,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:45,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:45,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:59:45,121 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-04 17:59:45,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:45,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1286622898, now seen corresponding path program 5 times [2024-06-04 17:59:45,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:45,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181100383] [2024-06-04 17:59:45,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:45,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:49,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:49,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181100383] [2024-06-04 17:59:49,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181100383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:49,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:49,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:59:49,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809790349] [2024-06-04 17:59:49,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:49,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:59:49,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:49,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:59:49,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:59:49,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:49,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 79 transitions, 795 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:49,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:49,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:49,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:49,801 INFO L124 PetriNetUnfolderBase]: 256/496 cut-off events. [2024-06-04 17:59:49,802 INFO L125 PetriNetUnfolderBase]: For 13787/13787 co-relation queries the response was YES. [2024-06-04 17:59:49,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2770 conditions, 496 events. 256/496 cut-off events. For 13787/13787 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2175 event pairs, 55 based on Foata normal form. 10/505 useless extension candidates. Maximal degree in co-relation 2718. Up to 305 conditions per place. [2024-06-04 17:59:49,804 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 56 selfloop transitions, 33 changer transitions 12/103 dead transitions. [2024-06-04 17:59:49,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 103 transitions, 1069 flow [2024-06-04 17:59:49,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:59:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:59:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-04 17:59:49,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 17:59:49,805 INFO L175 Difference]: Start difference. First operand has 112 places, 79 transitions, 795 flow. Second operand 11 states and 120 transitions. [2024-06-04 17:59:49,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 103 transitions, 1069 flow [2024-06-04 17:59:49,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 103 transitions, 943 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-04 17:59:49,819 INFO L231 Difference]: Finished difference. Result has 113 places, 73 transitions, 678 flow [2024-06-04 17:59:49,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=678, PETRI_PLACES=113, PETRI_TRANSITIONS=73} [2024-06-04 17:59:49,819 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2024-06-04 17:59:49,819 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 73 transitions, 678 flow [2024-06-04 17:59:49,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:49,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:49,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:49,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:59:49,820 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-04 17:59:49,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:49,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1262648086, now seen corresponding path program 6 times [2024-06-04 17:59:49,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:49,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543318136] [2024-06-04 17:59:49,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:49,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:53,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:53,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543318136] [2024-06-04 17:59:53,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543318136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:53,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:53,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:59:53,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12375319] [2024-06-04 17:59:53,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:53,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:59:53,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:53,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:59:53,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:59:53,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:53,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 73 transitions, 678 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:53,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:53,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:53,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:54,077 INFO L124 PetriNetUnfolderBase]: 218/434 cut-off events. [2024-06-04 17:59:54,077 INFO L125 PetriNetUnfolderBase]: For 12349/12349 co-relation queries the response was YES. [2024-06-04 17:59:54,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 434 events. 218/434 cut-off events. For 12349/12349 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1854 event pairs, 61 based on Foata normal form. 8/441 useless extension candidates. Maximal degree in co-relation 2298. Up to 289 conditions per place. [2024-06-04 17:59:54,079 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 67 selfloop transitions, 15 changer transitions 10/94 dead transitions. [2024-06-04 17:59:54,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 94 transitions, 974 flow [2024-06-04 17:59:54,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:59:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:59:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:59:54,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.362962962962963 [2024-06-04 17:59:54,089 INFO L175 Difference]: Start difference. First operand has 113 places, 73 transitions, 678 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:59:54,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 94 transitions, 974 flow [2024-06-04 17:59:54,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 94 transitions, 893 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 17:59:54,104 INFO L231 Difference]: Finished difference. Result has 110 places, 68 transitions, 577 flow [2024-06-04 17:59:54,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=577, PETRI_PLACES=110, PETRI_TRANSITIONS=68} [2024-06-04 17:59:54,105 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 81 predicate places. [2024-06-04 17:59:54,105 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 68 transitions, 577 flow [2024-06-04 17:59:54,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:54,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:54,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:54,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:59:54,106 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-04 17:59:54,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1292200480, now seen corresponding path program 3 times [2024-06-04 17:59:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:54,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611634550] [2024-06-04 17:59:54,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:57,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:57,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611634550] [2024-06-04 17:59:57,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611634550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:57,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:57,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:59:57,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119634025] [2024-06-04 17:59:57,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:57,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:59:57,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:57,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:59:57,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:59:57,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 17:59:57,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 68 transitions, 577 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:57,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:57,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 17:59:57,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:58,087 INFO L124 PetriNetUnfolderBase]: 200/396 cut-off events. [2024-06-04 17:59:58,087 INFO L125 PetriNetUnfolderBase]: For 10228/10228 co-relation queries the response was YES. [2024-06-04 17:59:58,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2191 conditions, 396 events. 200/396 cut-off events. For 10228/10228 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1623 event pairs, 41 based on Foata normal form. 2/397 useless extension candidates. Maximal degree in co-relation 2138. Up to 251 conditions per place. [2024-06-04 17:59:58,090 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 50 selfloop transitions, 38 changer transitions 0/90 dead transitions. [2024-06-04 17:59:58,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 90 transitions, 831 flow [2024-06-04 17:59:58,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:59:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:59:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2024-06-04 17:59:58,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3388888888888889 [2024-06-04 17:59:58,092 INFO L175 Difference]: Start difference. First operand has 110 places, 68 transitions, 577 flow. Second operand 12 states and 122 transitions. [2024-06-04 17:59:58,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 90 transitions, 831 flow [2024-06-04 17:59:58,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 90 transitions, 772 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-04 17:59:58,104 INFO L231 Difference]: Finished difference. Result has 108 places, 69 transitions, 624 flow [2024-06-04 17:59:58,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=624, PETRI_PLACES=108, PETRI_TRANSITIONS=69} [2024-06-04 17:59:58,105 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-04 17:59:58,105 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 69 transitions, 624 flow [2024-06-04 17:59:58,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:58,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:58,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:58,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:59:58,106 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-04 17:59:58,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1291985278, now seen corresponding path program 7 times [2024-06-04 17:59:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:58,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685971884] [2024-06-04 17:59:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:02,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:02,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685971884] [2024-06-04 18:00:02,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685971884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:02,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:02,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:00:02,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732429686] [2024-06-04 18:00:02,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:02,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:00:02,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:02,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:00:02,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:00:02,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:00:02,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 69 transitions, 624 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:02,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:02,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:00:02,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:02,804 INFO L124 PetriNetUnfolderBase]: 216/432 cut-off events. [2024-06-04 18:00:02,805 INFO L125 PetriNetUnfolderBase]: For 12304/12304 co-relation queries the response was YES. [2024-06-04 18:00:02,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 432 events. 216/432 cut-off events. For 12304/12304 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1843 event pairs, 49 based on Foata normal form. 10/441 useless extension candidates. Maximal degree in co-relation 2246. Up to 263 conditions per place. [2024-06-04 18:00:02,807 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 52 selfloop transitions, 29 changer transitions 12/95 dead transitions. [2024-06-04 18:00:02,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 95 transitions, 886 flow [2024-06-04 18:00:02,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 18:00:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 18:00:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 131 transitions. [2024-06-04 18:00:02,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33589743589743587 [2024-06-04 18:00:02,808 INFO L175 Difference]: Start difference. First operand has 108 places, 69 transitions, 624 flow. Second operand 13 states and 131 transitions. [2024-06-04 18:00:02,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 95 transitions, 886 flow [2024-06-04 18:00:02,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 95 transitions, 790 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-04 18:00:02,821 INFO L231 Difference]: Finished difference. Result has 111 places, 63 transitions, 546 flow [2024-06-04 18:00:02,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=546, PETRI_PLACES=111, PETRI_TRANSITIONS=63} [2024-06-04 18:00:02,822 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 82 predicate places. [2024-06-04 18:00:02,822 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 63 transitions, 546 flow [2024-06-04 18:00:02,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:02,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:02,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:02,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 18:00:02,822 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-04 18:00:02,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:02,823 INFO L85 PathProgramCache]: Analyzing trace with hash 119955562, now seen corresponding path program 4 times [2024-06-04 18:00:02,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:02,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316939723] [2024-06-04 18:00:02,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:02,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:06,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:06,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316939723] [2024-06-04 18:00:06,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316939723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:06,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:06,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:00:06,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833727176] [2024-06-04 18:00:06,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:06,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:00:06,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:06,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:00:06,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:00:06,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:00:06,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 63 transitions, 546 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:06,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:06,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:00:06,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:06,937 INFO L124 PetriNetUnfolderBase]: 184/376 cut-off events. [2024-06-04 18:00:06,937 INFO L125 PetriNetUnfolderBase]: For 10190/10190 co-relation queries the response was YES. [2024-06-04 18:00:06,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2097 conditions, 376 events. 184/376 cut-off events. For 10190/10190 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1548 event pairs, 54 based on Foata normal form. 2/377 useless extension candidates. Maximal degree in co-relation 2046. Up to 338 conditions per place. [2024-06-04 18:00:06,953 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 59 selfloop transitions, 14 changer transitions 0/75 dead transitions. [2024-06-04 18:00:06,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 75 transitions, 746 flow [2024-06-04 18:00:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:00:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:00:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-04 18:00:06,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2024-06-04 18:00:06,959 INFO L175 Difference]: Start difference. First operand has 111 places, 63 transitions, 546 flow. Second operand 8 states and 82 transitions. [2024-06-04 18:00:06,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 75 transitions, 746 flow [2024-06-04 18:00:06,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 75 transitions, 675 flow, removed 4 selfloop flow, removed 14 redundant places. [2024-06-04 18:00:06,974 INFO L231 Difference]: Finished difference. Result has 103 places, 64 transitions, 535 flow [2024-06-04 18:00:06,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=535, PETRI_PLACES=103, PETRI_TRANSITIONS=64} [2024-06-04 18:00:06,976 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 74 predicate places. [2024-06-04 18:00:06,976 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 64 transitions, 535 flow [2024-06-04 18:00:06,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:06,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:06,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:06,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 18:00:06,977 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-04 18:00:06,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:06,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1924095376, now seen corresponding path program 5 times [2024-06-04 18:00:06,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:06,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749100429] [2024-06-04 18:00:06,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:06,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:10,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:10,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749100429] [2024-06-04 18:00:10,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749100429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:10,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:10,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:00:10,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174662769] [2024-06-04 18:00:10,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:10,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:00:10,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:10,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:00:10,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:00:10,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:00:10,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 64 transitions, 535 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:10,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:10,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:00:10,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:11,135 INFO L124 PetriNetUnfolderBase]: 188/384 cut-off events. [2024-06-04 18:00:11,135 INFO L125 PetriNetUnfolderBase]: For 9931/9931 co-relation queries the response was YES. [2024-06-04 18:00:11,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 384 events. 188/384 cut-off events. For 9931/9931 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1581 event pairs, 53 based on Foata normal form. 2/385 useless extension candidates. Maximal degree in co-relation 2053. Up to 344 conditions per place. [2024-06-04 18:00:11,138 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 63 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2024-06-04 18:00:11,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 76 transitions, 735 flow [2024-06-04 18:00:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:00:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:00:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2024-06-04 18:00:11,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32916666666666666 [2024-06-04 18:00:11,139 INFO L175 Difference]: Start difference. First operand has 103 places, 64 transitions, 535 flow. Second operand 8 states and 79 transitions. [2024-06-04 18:00:11,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 76 transitions, 735 flow [2024-06-04 18:00:11,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 76 transitions, 685 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-04 18:00:11,153 INFO L231 Difference]: Finished difference. Result has 105 places, 65 transitions, 541 flow [2024-06-04 18:00:11,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=541, PETRI_PLACES=105, PETRI_TRANSITIONS=65} [2024-06-04 18:00:11,153 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 76 predicate places. [2024-06-04 18:00:11,153 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 65 transitions, 541 flow [2024-06-04 18:00:11,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:11,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:11,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:11,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 18:00:11,154 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-04 18:00:11,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:11,154 INFO L85 PathProgramCache]: Analyzing trace with hash 376463512, now seen corresponding path program 6 times [2024-06-04 18:00:11,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:11,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511458859] [2024-06-04 18:00:11,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:11,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:14,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:14,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511458859] [2024-06-04 18:00:14,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511458859] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:14,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:14,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:00:14,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718981529] [2024-06-04 18:00:14,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:14,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:00:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:00:14,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:00:15,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:00:15,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 65 transitions, 541 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:15,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:15,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:00:15,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:15,321 INFO L124 PetriNetUnfolderBase]: 192/392 cut-off events. [2024-06-04 18:00:15,321 INFO L125 PetriNetUnfolderBase]: For 10748/10748 co-relation queries the response was YES. [2024-06-04 18:00:15,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2158 conditions, 392 events. 192/392 cut-off events. For 10748/10748 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1643 event pairs, 55 based on Foata normal form. 2/393 useless extension candidates. Maximal degree in co-relation 2107. Up to 315 conditions per place. [2024-06-04 18:00:15,324 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 57 selfloop transitions, 19 changer transitions 0/78 dead transitions. [2024-06-04 18:00:15,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 78 transitions, 805 flow [2024-06-04 18:00:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:00:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:00:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2024-06-04 18:00:15,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-04 18:00:15,326 INFO L175 Difference]: Start difference. First operand has 105 places, 65 transitions, 541 flow. Second operand 8 states and 84 transitions. [2024-06-04 18:00:15,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 78 transitions, 805 flow [2024-06-04 18:00:15,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 78 transitions, 759 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 18:00:15,341 INFO L231 Difference]: Finished difference. Result has 107 places, 66 transitions, 568 flow [2024-06-04 18:00:15,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=568, PETRI_PLACES=107, PETRI_TRANSITIONS=66} [2024-06-04 18:00:15,341 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 78 predicate places. [2024-06-04 18:00:15,342 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 66 transitions, 568 flow [2024-06-04 18:00:15,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:15,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:15,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:15,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 18:00:15,342 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-04 18:00:15,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:15,342 INFO L85 PathProgramCache]: Analyzing trace with hash 376456072, now seen corresponding path program 7 times [2024-06-04 18:00:15,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:15,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560798063] [2024-06-04 18:00:15,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:15,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:18,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:18,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560798063] [2024-06-04 18:00:18,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560798063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:18,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:18,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:00:18,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846469707] [2024-06-04 18:00:18,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:18,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:00:18,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:18,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:00:18,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:00:19,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:00:19,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 66 transitions, 568 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:19,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:19,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:00:19,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:19,332 INFO L124 PetriNetUnfolderBase]: 189/387 cut-off events. [2024-06-04 18:00:19,332 INFO L125 PetriNetUnfolderBase]: For 10442/10442 co-relation queries the response was YES. [2024-06-04 18:00:19,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 387 events. 189/387 cut-off events. For 10442/10442 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1629 event pairs, 60 based on Foata normal form. 2/388 useless extension candidates. Maximal degree in co-relation 2015. Up to 337 conditions per place. [2024-06-04 18:00:19,335 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 57 selfloop transitions, 18 changer transitions 0/77 dead transitions. [2024-06-04 18:00:19,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 77 transitions, 746 flow [2024-06-04 18:00:19,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:00:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:00:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-04 18:00:19,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2024-06-04 18:00:19,349 INFO L175 Difference]: Start difference. First operand has 107 places, 66 transitions, 568 flow. Second operand 8 states and 82 transitions. [2024-06-04 18:00:19,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 77 transitions, 746 flow [2024-06-04 18:00:19,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 77 transitions, 629 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-04 18:00:19,366 INFO L231 Difference]: Finished difference. Result has 107 places, 66 transitions, 493 flow [2024-06-04 18:00:19,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=493, PETRI_PLACES=107, PETRI_TRANSITIONS=66} [2024-06-04 18:00:19,367 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 78 predicate places. [2024-06-04 18:00:19,368 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 66 transitions, 493 flow [2024-06-04 18:00:19,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:19,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:19,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:19,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 18:00:19,368 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-04 18:00:19,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1916470864, now seen corresponding path program 8 times [2024-06-04 18:00:19,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:19,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347777590] [2024-06-04 18:00:19,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:23,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-04 18:00:23,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:23,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347777590] [2024-06-04 18:00:23,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347777590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:23,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:23,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:00:23,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266840667] [2024-06-04 18:00:23,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:23,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:00:23,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:23,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:00:23,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:00:23,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:00:23,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 66 transitions, 493 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:23,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:23,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:00:23,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:23,839 INFO L124 PetriNetUnfolderBase]: 201/415 cut-off events. [2024-06-04 18:00:23,839 INFO L125 PetriNetUnfolderBase]: For 12893/12893 co-relation queries the response was YES. [2024-06-04 18:00:23,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 415 events. 201/415 cut-off events. For 12893/12893 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1801 event pairs, 57 based on Foata normal form. 10/424 useless extension candidates. Maximal degree in co-relation 1904. Up to 327 conditions per place. [2024-06-04 18:00:23,842 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 62 selfloop transitions, 13 changer transitions 9/86 dead transitions. [2024-06-04 18:00:23,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 86 transitions, 725 flow [2024-06-04 18:00:23,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:00:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:00:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-04 18:00:23,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34 [2024-06-04 18:00:23,843 INFO L175 Difference]: Start difference. First operand has 107 places, 66 transitions, 493 flow. Second operand 10 states and 102 transitions. [2024-06-04 18:00:23,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 86 transitions, 725 flow [2024-06-04 18:00:23,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 86 transitions, 656 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 18:00:23,857 INFO L231 Difference]: Finished difference. Result has 109 places, 65 transitions, 451 flow [2024-06-04 18:00:23,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=451, PETRI_PLACES=109, PETRI_TRANSITIONS=65} [2024-06-04 18:00:23,857 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 80 predicate places. [2024-06-04 18:00:23,857 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 65 transitions, 451 flow [2024-06-04 18:00:23,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:23,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:23,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:23,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 18:00:23,858 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-04 18:00:23,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:23,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1279124911, now seen corresponding path program 1 times [2024-06-04 18:00:23,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:23,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291877994] [2024-06-04 18:00:23,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:23,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:28,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:28,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291877994] [2024-06-04 18:00:28,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291877994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:28,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:28,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:00:28,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762282767] [2024-06-04 18:00:28,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:28,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:00:28,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:28,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:00:28,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:00:28,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:00:28,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 65 transitions, 451 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:28,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:28,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:00:28,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:28,591 INFO L124 PetriNetUnfolderBase]: 168/352 cut-off events. [2024-06-04 18:00:28,591 INFO L125 PetriNetUnfolderBase]: For 7501/7501 co-relation queries the response was YES. [2024-06-04 18:00:28,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 352 events. 168/352 cut-off events. For 7501/7501 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1442 event pairs, 35 based on Foata normal form. 6/357 useless extension candidates. Maximal degree in co-relation 1475. Up to 205 conditions per place. [2024-06-04 18:00:28,593 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 41 selfloop transitions, 25 changer transitions 17/85 dead transitions. [2024-06-04 18:00:28,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 85 transitions, 669 flow [2024-06-04 18:00:28,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:00:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:00:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-04 18:00:28,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 18:00:28,594 INFO L175 Difference]: Start difference. First operand has 109 places, 65 transitions, 451 flow. Second operand 11 states and 110 transitions. [2024-06-04 18:00:28,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 85 transitions, 669 flow [2024-06-04 18:00:28,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 85 transitions, 635 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 18:00:28,605 INFO L231 Difference]: Finished difference. Result has 109 places, 60 transitions, 436 flow [2024-06-04 18:00:28,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=436, PETRI_PLACES=109, PETRI_TRANSITIONS=60} [2024-06-04 18:00:28,605 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 80 predicate places. [2024-06-04 18:00:28,606 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 60 transitions, 436 flow [2024-06-04 18:00:28,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:28,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:28,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:28,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 18:00:28,606 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-04 18:00:28,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:28,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1230789421, now seen corresponding path program 2 times [2024-06-04 18:00:28,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:28,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419208422] [2024-06-04 18:00:28,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:28,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:32,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:32,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419208422] [2024-06-04 18:00:32,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419208422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:32,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:32,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:00:32,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870718074] [2024-06-04 18:00:32,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:32,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:00:32,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:32,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:00:32,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:00:32,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:00:32,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 60 transitions, 436 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:32,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:32,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:00:32,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:32,925 INFO L124 PetriNetUnfolderBase]: 148/311 cut-off events. [2024-06-04 18:00:32,925 INFO L125 PetriNetUnfolderBase]: For 7547/7547 co-relation queries the response was YES. [2024-06-04 18:00:32,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 311 events. 148/311 cut-off events. For 7547/7547 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1250 event pairs, 23 based on Foata normal form. 12/322 useless extension candidates. Maximal degree in co-relation 1204. Up to 159 conditions per place. [2024-06-04 18:00:32,926 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 41 selfloop transitions, 14 changer transitions 20/77 dead transitions. [2024-06-04 18:00:32,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 77 transitions, 632 flow [2024-06-04 18:00:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:00:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:00:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2024-06-04 18:00:32,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 18:00:32,927 INFO L175 Difference]: Start difference. First operand has 109 places, 60 transitions, 436 flow. Second operand 10 states and 100 transitions. [2024-06-04 18:00:32,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 77 transitions, 632 flow [2024-06-04 18:00:32,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 77 transitions, 574 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 18:00:32,932 INFO L231 Difference]: Finished difference. Result has 100 places, 48 transitions, 334 flow [2024-06-04 18:00:32,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=334, PETRI_PLACES=100, PETRI_TRANSITIONS=48} [2024-06-04 18:00:32,933 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2024-06-04 18:00:32,933 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 48 transitions, 334 flow [2024-06-04 18:00:32,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:32,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:32,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:32,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 18:00:32,933 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-04 18:00:32,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash -309895255, now seen corresponding path program 3 times [2024-06-04 18:00:32,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:32,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639262543] [2024-06-04 18:00:32,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:32,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:37,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-04 18:00:37,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:37,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639262543] [2024-06-04 18:00:37,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639262543] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:37,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:37,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:00:37,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963190206] [2024-06-04 18:00:37,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:37,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:00:37,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:37,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:00:37,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:00:37,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:00:37,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 48 transitions, 334 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:37,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:37,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:00:37,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:37,455 INFO L124 PetriNetUnfolderBase]: 118/249 cut-off events. [2024-06-04 18:00:37,455 INFO L125 PetriNetUnfolderBase]: For 4244/4244 co-relation queries the response was YES. [2024-06-04 18:00:37,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 249 events. 118/249 cut-off events. For 4244/4244 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 911 event pairs, 25 based on Foata normal form. 6/254 useless extension candidates. Maximal degree in co-relation 958. Up to 157 conditions per place. [2024-06-04 18:00:37,457 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 34 selfloop transitions, 11 changer transitions 20/67 dead transitions. [2024-06-04 18:00:37,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 67 transitions, 515 flow [2024-06-04 18:00:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:00:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:00:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2024-06-04 18:00:37,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32666666666666666 [2024-06-04 18:00:37,458 INFO L175 Difference]: Start difference. First operand has 100 places, 48 transitions, 334 flow. Second operand 10 states and 98 transitions. [2024-06-04 18:00:37,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 67 transitions, 515 flow [2024-06-04 18:00:37,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 67 transitions, 455 flow, removed 8 selfloop flow, removed 17 redundant places. [2024-06-04 18:00:37,462 INFO L231 Difference]: Finished difference. Result has 82 places, 44 transitions, 278 flow [2024-06-04 18:00:37,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=278, PETRI_PLACES=82, PETRI_TRANSITIONS=44} [2024-06-04 18:00:37,466 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2024-06-04 18:00:37,466 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 44 transitions, 278 flow [2024-06-04 18:00:37,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:37,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:37,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:37,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 18:00:37,467 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-04 18:00:37,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash -929432411, now seen corresponding path program 4 times [2024-06-04 18:00:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:37,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269623695] [2024-06-04 18:00:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:41,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:41,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269623695] [2024-06-04 18:00:41,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269623695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:41,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:41,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:00:41,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616620778] [2024-06-04 18:00:41,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:41,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:00:41,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:41,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:00:41,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:00:41,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:00:41,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 44 transitions, 278 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:41,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:41,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:00:41,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:41,639 INFO L124 PetriNetUnfolderBase]: 101/213 cut-off events. [2024-06-04 18:00:41,639 INFO L125 PetriNetUnfolderBase]: For 2155/2155 co-relation queries the response was YES. [2024-06-04 18:00:41,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 213 events. 101/213 cut-off events. For 2155/2155 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 725 event pairs, 21 based on Foata normal form. 6/218 useless extension candidates. Maximal degree in co-relation 778. Up to 149 conditions per place. [2024-06-04 18:00:41,641 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 34 selfloop transitions, 6 changer transitions 14/56 dead transitions. [2024-06-04 18:00:41,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 56 transitions, 414 flow [2024-06-04 18:00:41,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:00:41,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:00:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2024-06-04 18:00:41,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2024-06-04 18:00:41,642 INFO L175 Difference]: Start difference. First operand has 82 places, 44 transitions, 278 flow. Second operand 9 states and 84 transitions. [2024-06-04 18:00:41,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 56 transitions, 414 flow [2024-06-04 18:00:41,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 56 transitions, 381 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 18:00:41,645 INFO L231 Difference]: Finished difference. Result has 74 places, 40 transitions, 240 flow [2024-06-04 18:00:41,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=74, PETRI_TRANSITIONS=40} [2024-06-04 18:00:41,646 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 45 predicate places. [2024-06-04 18:00:41,646 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 40 transitions, 240 flow [2024-06-04 18:00:41,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:41,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:41,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:41,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 18:00:41,646 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-04 18:00:41,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:41,647 INFO L85 PathProgramCache]: Analyzing trace with hash -576344139, now seen corresponding path program 5 times [2024-06-04 18:00:41,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:41,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124854430] [2024-06-04 18:00:41,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:41,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:45,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:45,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:45,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124854430] [2024-06-04 18:00:45,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124854430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:45,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:45,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:00:45,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252798316] [2024-06-04 18:00:45,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:45,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:00:45,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:45,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:00:45,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:00:45,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:00:45,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 40 transitions, 240 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:45,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:45,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:00:45,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:45,826 INFO L124 PetriNetUnfolderBase]: 87/187 cut-off events. [2024-06-04 18:00:45,826 INFO L125 PetriNetUnfolderBase]: For 2111/2111 co-relation queries the response was YES. [2024-06-04 18:00:45,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 187 events. 87/187 cut-off events. For 2111/2111 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 602 event pairs, 21 based on Foata normal form. 6/192 useless extension candidates. Maximal degree in co-relation 686. Up to 100 conditions per place. [2024-06-04 18:00:45,827 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 26 selfloop transitions, 10 changer transitions 12/50 dead transitions. [2024-06-04 18:00:45,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 50 transitions, 362 flow [2024-06-04 18:00:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:00:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:00:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2024-06-04 18:00:45,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32083333333333336 [2024-06-04 18:00:45,841 INFO L175 Difference]: Start difference. First operand has 74 places, 40 transitions, 240 flow. Second operand 8 states and 77 transitions. [2024-06-04 18:00:45,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 50 transitions, 362 flow [2024-06-04 18:00:45,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 50 transitions, 342 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 18:00:45,844 INFO L231 Difference]: Finished difference. Result has 67 places, 35 transitions, 204 flow [2024-06-04 18:00:45,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=204, PETRI_PLACES=67, PETRI_TRANSITIONS=35} [2024-06-04 18:00:45,844 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 38 predicate places. [2024-06-04 18:00:45,845 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 35 transitions, 204 flow [2024-06-04 18:00:45,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:45,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:45,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:45,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 18:00:45,845 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-04 18:00:45,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:45,846 INFO L85 PathProgramCache]: Analyzing trace with hash -576113499, now seen corresponding path program 6 times [2024-06-04 18:00:45,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:45,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051171879] [2024-06-04 18:00:45,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:45,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:49,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:49,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051171879] [2024-06-04 18:00:49,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051171879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:49,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:49,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:00:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754516305] [2024-06-04 18:00:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:49,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:00:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:49,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:00:49,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:00:50,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:00:50,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 35 transitions, 204 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:50,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:50,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:00:50,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:50,250 INFO L124 PetriNetUnfolderBase]: 75/167 cut-off events. [2024-06-04 18:00:50,250 INFO L125 PetriNetUnfolderBase]: For 1447/1447 co-relation queries the response was YES. [2024-06-04 18:00:50,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 167 events. 75/167 cut-off events. For 1447/1447 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 514 event pairs, 20 based on Foata normal form. 6/172 useless extension candidates. Maximal degree in co-relation 598. Up to 105 conditions per place. [2024-06-04 18:00:50,251 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 26 selfloop transitions, 6 changer transitions 14/48 dead transitions. [2024-06-04 18:00:50,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 48 transitions, 329 flow [2024-06-04 18:00:50,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:00:50,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:00:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2024-06-04 18:00:50,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3074074074074074 [2024-06-04 18:00:50,252 INFO L175 Difference]: Start difference. First operand has 67 places, 35 transitions, 204 flow. Second operand 9 states and 83 transitions. [2024-06-04 18:00:50,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 48 transitions, 329 flow [2024-06-04 18:00:50,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 48 transitions, 303 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-04 18:00:50,254 INFO L231 Difference]: Finished difference. Result has 64 places, 32 transitions, 169 flow [2024-06-04 18:00:50,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=169, PETRI_PLACES=64, PETRI_TRANSITIONS=32} [2024-06-04 18:00:50,255 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-04 18:00:50,255 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 32 transitions, 169 flow [2024-06-04 18:00:50,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:50,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:50,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:50,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 18:00:50,255 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-04 18:00:50,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:50,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1865539519, now seen corresponding path program 7 times [2024-06-04 18:00:50,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:50,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033907076] [2024-06-04 18:00:50,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:50,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:54,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:54,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033907076] [2024-06-04 18:00:54,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033907076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:54,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:54,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:00:54,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479152602] [2024-06-04 18:00:54,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:54,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:00:54,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:54,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:00:54,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:00:54,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:00:54,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 32 transitions, 169 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:54,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:54,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:00:54,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:55,115 INFO L124 PetriNetUnfolderBase]: 63/143 cut-off events. [2024-06-04 18:00:55,115 INFO L125 PetriNetUnfolderBase]: For 1236/1236 co-relation queries the response was YES. [2024-06-04 18:00:55,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 143 events. 63/143 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 414 event pairs, 15 based on Foata normal form. 6/148 useless extension candidates. Maximal degree in co-relation 506. Up to 69 conditions per place. [2024-06-04 18:00:55,116 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 20 selfloop transitions, 7 changer transitions 15/44 dead transitions. [2024-06-04 18:00:55,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 44 transitions, 281 flow [2024-06-04 18:00:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:00:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:00:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2024-06-04 18:00:55,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2024-06-04 18:00:55,117 INFO L175 Difference]: Start difference. First operand has 64 places, 32 transitions, 169 flow. Second operand 10 states and 92 transitions. [2024-06-04 18:00:55,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 44 transitions, 281 flow [2024-06-04 18:00:55,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 44 transitions, 259 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 18:00:55,119 INFO L231 Difference]: Finished difference. Result has 60 places, 26 transitions, 135 flow [2024-06-04 18:00:55,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=135, PETRI_PLACES=60, PETRI_TRANSITIONS=26} [2024-06-04 18:00:55,119 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2024-06-04 18:00:55,119 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 26 transitions, 135 flow [2024-06-04 18:00:55,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:55,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:55,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:55,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 18:00:55,119 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-04 18:00:55,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash -354705609, now seen corresponding path program 8 times [2024-06-04 18:00:55,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:55,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556857920] [2024-06-04 18:00:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:55,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:58,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:58,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556857920] [2024-06-04 18:00:58,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556857920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:58,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:58,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:00:58,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082900214] [2024-06-04 18:00:58,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:58,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:00:58,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:58,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:00:58,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:00:58,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:00:58,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 26 transitions, 135 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:58,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:58,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:00:58,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:59,116 INFO L124 PetriNetUnfolderBase]: 47/111 cut-off events. [2024-06-04 18:00:59,116 INFO L125 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2024-06-04 18:00:59,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 111 events. 47/111 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 279 event pairs, 20 based on Foata normal form. 8/118 useless extension candidates. Maximal degree in co-relation 380. Up to 52 conditions per place. [2024-06-04 18:00:59,116 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 17 selfloop transitions, 5 changer transitions 11/35 dead transitions. [2024-06-04 18:00:59,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 35 transitions, 223 flow [2024-06-04 18:00:59,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:00:59,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:00:59,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2024-06-04 18:00:59,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29259259259259257 [2024-06-04 18:00:59,117 INFO L175 Difference]: Start difference. First operand has 60 places, 26 transitions, 135 flow. Second operand 9 states and 79 transitions. [2024-06-04 18:00:59,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 35 transitions, 223 flow [2024-06-04 18:00:59,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 195 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-06-04 18:00:59,118 INFO L231 Difference]: Finished difference. Result has 49 places, 21 transitions, 94 flow [2024-06-04 18:00:59,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=94, PETRI_PLACES=49, PETRI_TRANSITIONS=21} [2024-06-04 18:00:59,119 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2024-06-04 18:00:59,119 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 21 transitions, 94 flow [2024-06-04 18:00:59,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:59,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:59,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:59,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 18:00:59,120 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-04 18:00:59,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:59,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1214532281, now seen corresponding path program 9 times [2024-06-04 18:00:59,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:59,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820149817] [2024-06-04 18:00:59,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:59,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:01:03,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:03,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820149817] [2024-06-04 18:01:03,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820149817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:03,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:03,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:01:03,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486427486] [2024-06-04 18:01:03,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:03,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:01:03,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:03,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:01:03,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:01:03,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:01:03,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 21 transitions, 94 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:03,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:03,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:01:03,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:03,482 INFO L124 PetriNetUnfolderBase]: 22/60 cut-off events. [2024-06-04 18:01:03,482 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2024-06-04 18:01:03,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 60 events. 22/60 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 1 based on Foata normal form. 6/65 useless extension candidates. Maximal degree in co-relation 158. Up to 24 conditions per place. [2024-06-04 18:01:03,483 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 0 selfloop transitions, 0 changer transitions 27/27 dead transitions. [2024-06-04 18:01:03,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 27 transitions, 138 flow [2024-06-04 18:01:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:01:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:01:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2024-06-04 18:01:03,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26296296296296295 [2024-06-04 18:01:03,483 INFO L175 Difference]: Start difference. First operand has 49 places, 21 transitions, 94 flow. Second operand 9 states and 71 transitions. [2024-06-04 18:01:03,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 27 transitions, 138 flow [2024-06-04 18:01:03,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 110 flow, removed 2 selfloop flow, removed 13 redundant places. [2024-06-04 18:01:03,484 INFO L231 Difference]: Finished difference. Result has 38 places, 0 transitions, 0 flow [2024-06-04 18:01:03,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=38, PETRI_TRANSITIONS=0} [2024-06-04 18:01:03,484 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-06-04 18:01:03,484 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 0 transitions, 0 flow [2024-06-04 18:01:03,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:03,487 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-04 18:01:03,489 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 18:01:03,489 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-04 18:01:03,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 18:01:03,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 18:01:03,493 INFO L445 BasicCegarLoop]: Path program histogram: [9, 8, 7, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:03,498 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 18:01:03,498 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 18:01:03,501 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-04 18:01:03,502 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-04 18:01:03,502 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 06:01:03 BasicIcfg [2024-06-04 18:01:03,502 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 18:01:03,503 INFO L158 Benchmark]: Toolchain (without parser) took 222663.81ms. Allocated memory was 174.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 143.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 361.3MB. Max. memory is 16.1GB. [2024-06-04 18:01:03,503 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 18:01:03,508 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 18:01:03,508 INFO L158 Benchmark]: CACSL2BoogieTranslator took 668.50ms. Allocated memory is still 174.1MB. Free memory was 142.8MB in the beginning and 96.7MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-06-04 18:01:03,508 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.63ms. Allocated memory is still 174.1MB. Free memory was 96.7MB in the beginning and 84.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-04 18:01:03,508 INFO L158 Benchmark]: Boogie Preprocessor took 99.03ms. Allocated memory is still 174.1MB. Free memory was 84.1MB in the beginning and 77.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-04 18:01:03,508 INFO L158 Benchmark]: RCFGBuilder took 824.17ms. Allocated memory is still 174.1MB. Free memory was 77.8MB in the beginning and 59.5MB in the end (delta: 18.3MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2024-06-04 18:01:03,509 INFO L158 Benchmark]: TraceAbstraction took 220977.41ms. Allocated memory was 174.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 59.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 276.9MB. Max. memory is 16.1GB. [2024-06-04 18:01:03,509 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 668.50ms. Allocated memory is still 174.1MB. Free memory was 142.8MB in the beginning and 96.7MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.63ms. Allocated memory is still 174.1MB. Free memory was 96.7MB in the beginning and 84.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.03ms. Allocated memory is still 174.1MB. Free memory was 84.1MB in the beginning and 77.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 824.17ms. Allocated memory is still 174.1MB. Free memory was 77.8MB in the beginning and 59.5MB in the end (delta: 18.3MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * TraceAbstraction took 220977.41ms. Allocated memory was 174.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 59.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 276.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 795]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 796]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 220.9s, OverallIterations: 58, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3010 SdHoareTripleChecker+Valid, 13.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2611 mSDsluCounter, 843 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 596 mSDsCounter, 571 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16250 IncrementalHoareTripleChecker+Invalid, 16821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 571 mSolverCounterUnsat, 247 mSDtfsCounter, 16250 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 585 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 578 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=924occurred in iteration=30, InterpolantAutomatonStates: 493, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 197.6s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 842 ConstructedInterpolants, 0 QuantifiedInterpolants, 39897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 58 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-04 18:01:03,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE