./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe022_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/safe022_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/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe022_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-03 22:37:24,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:37:24,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:37:24,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:37:24,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:37:24,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:37:24,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:37:24,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:37:24,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:37:24,429 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:37:24,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:37:24,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:37:24,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:37:24,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:37:24,435 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:37:24,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:37:24,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:37:24,438 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:37:24,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:37:24,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:37:24,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:37:24,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:37:24,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:37:24,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:37:24,440 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:37:24,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:37:24,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:37:24,441 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:37:24,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:37:24,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:37:24,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:37:24,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:37:24,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:37:24,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:37:24,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:37:24,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:37:24,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:37:24,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:37:24,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:37:24,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:37:24,444 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:37:24,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:37:24,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:37:24,445 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-03 22:37:24,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:37:24,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:37:24,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:37:24,658 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:37:24,659 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:37:24,660 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/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-03 22:37:24,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:37:24,785 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:37:24,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:37:25,808 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:37:25,999 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:37:26,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:37:26,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1141b966f/d5632b4c7c0043fcac076bb389854047/FLAGbd533a9a8 [2024-06-03 22:37:26,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1141b966f/d5632b4c7c0043fcac076bb389854047 [2024-06-03 22:37:26,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:37:26,034 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:37:26,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:37:26,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:37:26,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:37:26,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:37:24" (1/2) ... [2024-06-03 22:37:26,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a2324eb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:26, skipping insertion in model container [2024-06-03 22:37:26,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:37:24" (1/2) ... [2024-06-03 22:37:26,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1b95c313 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:26, skipping insertion in model container [2024-06-03 22:37:26,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:37:26" (2/2) ... [2024-06-03 22:37:26,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a2324eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26, skipping insertion in model container [2024-06-03 22:37:26,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:37:26" (2/2) ... [2024-06-03 22:37:26,043 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:37:26,090 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:37:26,090 INFO L97 edCorrectnessWitness]: Location invariant before [L811-L811] (((((((((((((((! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$read_delayed == (_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_thd1) + (long long )y$w_buff0 >= 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_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_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) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (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 )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_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 )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_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 )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_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) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (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) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (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 )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_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$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && 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) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:37:26,091 INFO L97 edCorrectnessWitness]: Location invariant before [L810-L810] (((((((((((((((! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$read_delayed == (_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_thd1) + (long long )y$w_buff0 >= 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_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_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) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (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 )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_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 )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_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 )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_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) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (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) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (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 )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_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$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && 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) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:37:26,092 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:37:26,092 INFO L106 edCorrectnessWitness]: ghost_update [L808-L808] multithreaded = 1; [2024-06-03 22:37:26,127 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:37:26,461 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:37:26,468 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:37:26,728 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:37:26,779 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:37:26,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26 WrapperNode [2024-06-03 22:37:26,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:37:26,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:37:26,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:37:26,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:37:26,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26" (1/1) ... [2024-06-03 22:37:26,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26" (1/1) ... [2024-06-03 22:37:26,867 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 113 [2024-06-03 22:37:26,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:37:26,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:37:26,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:37:26,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:37:26,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26" (1/1) ... [2024-06-03 22:37:26,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26" (1/1) ... [2024-06-03 22:37:26,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26" (1/1) ... [2024-06-03 22:37:26,927 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-03 22:37:26,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26" (1/1) ... [2024-06-03 22:37:26,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26" (1/1) ... [2024-06-03 22:37:26,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26" (1/1) ... [2024-06-03 22:37:26,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26" (1/1) ... [2024-06-03 22:37:26,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26" (1/1) ... [2024-06-03 22:37:26,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26" (1/1) ... [2024-06-03 22:37:26,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:37:26,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:37:26,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:37:26,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:37:26,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26" (1/1) ... [2024-06-03 22:37:26,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:37:26,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:37:27,003 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-03 22:37:27,013 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-03 22:37:27,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:37:27,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:37:27,034 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:37:27,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:37:27,034 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:37:27,035 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:37:27,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:37:27,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:37:27,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:37:27,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:37:27,037 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 22:37:27,158 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:37:27,159 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:37:27,835 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:37:27,835 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:37:27,987 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:37:27,987 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:37:27,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:37:27 BoogieIcfgContainer [2024-06-03 22:37:27,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:37:27,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:37:27,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:37:27,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:37:27,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:37:24" (1/4) ... [2024-06-03 22:37:27,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73278339 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:37:27, skipping insertion in model container [2024-06-03 22:37:27,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:37:26" (2/4) ... [2024-06-03 22:37:28,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73278339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:37:27, skipping insertion in model container [2024-06-03 22:37:28,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:26" (3/4) ... [2024-06-03 22:37:28,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73278339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:37:28, skipping insertion in model container [2024-06-03 22:37:28,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:37:27" (4/4) ... [2024-06-03 22:37:28,004 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:37:28,017 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:37:28,018 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 22:37:28,018 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:37:28,092 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:37:28,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2024-06-03 22:37:28,153 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-03 22:37:28,153 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:37:28,154 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-03 22:37:28,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2024-06-03 22:37:28,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2024-06-03 22:37:28,168 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:37:28,174 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;@a3af13d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:37:28,175 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 22:37:28,180 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:37:28,180 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:37:28,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:37:28,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:28,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:37:28,181 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-03 22:37:28,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:28,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1470245525, now seen corresponding path program 1 times [2024-06-03 22:37:28,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:28,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842343874] [2024-06-03 22:37:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:37:31,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:31,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842343874] [2024-06-03 22:37:31,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842343874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:31,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:31,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:37:31,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311042188] [2024-06-03 22:37:31,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:31,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:37:31,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:31,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:37:31,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:37:31,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-06-03 22:37:31,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:31,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:31,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-06-03 22:37:31,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:31,923 INFO L124 PetriNetUnfolderBase]: 131/247 cut-off events. [2024-06-03 22:37:31,923 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-03 22:37:31,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 247 events. 131/247 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 848 event pairs, 79 based on Foata normal form. 3/244 useless extension candidates. Maximal degree in co-relation 495. Up to 231 conditions per place. [2024-06-03 22:37:31,927 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 24 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-03 22:37:31,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 123 flow [2024-06-03 22:37:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:37:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:37:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-06-03 22:37:31,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-06-03 22:37:31,937 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 53 transitions. [2024-06-03 22:37:31,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 123 flow [2024-06-03 22:37:31,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 22:37:31,941 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2024-06-03 22:37:31,942 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-03 22:37:31,954 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-06-03 22:37:31,957 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2024-06-03 22:37:31,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:31,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:31,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:37:31,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:37:31,958 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-03 22:37:31,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:31,959 INFO L85 PathProgramCache]: Analyzing trace with hash -138254860, now seen corresponding path program 1 times [2024-06-03 22:37:31,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:31,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496508535] [2024-06-03 22:37:31,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:31,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:37:34,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:34,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496508535] [2024-06-03 22:37:34,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496508535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:34,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:34,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:37:34,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160645175] [2024-06-03 22:37:34,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:34,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:37:34,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:34,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:37:34,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:37:34,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-06-03 22:37:34,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:34,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:34,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-06-03 22:37:34,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:34,841 INFO L124 PetriNetUnfolderBase]: 134/252 cut-off events. [2024-06-03 22:37:34,842 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-06-03 22:37:34,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 252 events. 134/252 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 871 event pairs, 53 based on Foata normal form. 4/255 useless extension candidates. Maximal degree in co-relation 580. Up to 227 conditions per place. [2024-06-03 22:37:34,844 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 30 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2024-06-03 22:37:34,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 176 flow [2024-06-03 22:37:34,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:37:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:37:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-03 22:37:34,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2024-06-03 22:37:34,846 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 4 states and 67 transitions. [2024-06-03 22:37:34,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 176 flow [2024-06-03 22:37:34,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:37:34,847 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 106 flow [2024-06-03 22:37:34,848 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-06-03 22:37:34,848 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2024-06-03 22:37:34,848 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 106 flow [2024-06-03 22:37:34,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:34,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:34,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:37:34,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:37:34,849 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-03 22:37:34,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:34,850 INFO L85 PathProgramCache]: Analyzing trace with hash 9067822, now seen corresponding path program 1 times [2024-06-03 22:37:34,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:34,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984054905] [2024-06-03 22:37:34,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:34,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:37:37,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:37,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984054905] [2024-06-03 22:37:37,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984054905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:37,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:37,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:37:37,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715422773] [2024-06-03 22:37:37,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:37,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:37:37,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:37,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:37:37,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:37:37,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-03 22:37:37,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:37,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:37,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-03 22:37:37,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:37,531 INFO L124 PetriNetUnfolderBase]: 154/285 cut-off events. [2024-06-03 22:37:37,531 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2024-06-03 22:37:37,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 285 events. 154/285 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 952 event pairs, 58 based on Foata normal form. 2/286 useless extension candidates. Maximal degree in co-relation 761. Up to 258 conditions per place. [2024-06-03 22:37:37,534 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 37 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2024-06-03 22:37:37,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 245 flow [2024-06-03 22:37:37,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:37:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:37:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2024-06-03 22:37:37,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-03 22:37:37,535 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 106 flow. Second operand 5 states and 75 transitions. [2024-06-03 22:37:37,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 245 flow [2024-06-03 22:37:37,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 238 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-03 22:37:37,538 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 155 flow [2024-06-03 22:37:37,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2024-06-03 22:37:37,538 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2024-06-03 22:37:37,539 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 155 flow [2024-06-03 22:37:37,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:37,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:37,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:37:37,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:37:37,539 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-03 22:37:37,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:37,540 INFO L85 PathProgramCache]: Analyzing trace with hash 946038819, now seen corresponding path program 1 times [2024-06-03 22:37:37,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:37,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492367120] [2024-06-03 22:37:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:37,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:37:40,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:40,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492367120] [2024-06-03 22:37:40,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492367120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:40,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:40,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:37:40,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366534289] [2024-06-03 22:37:40,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:40,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:37:40,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:40,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:37:40,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:37:40,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-03 22:37:40,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:40,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:40,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-03 22:37:40,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:40,736 INFO L124 PetriNetUnfolderBase]: 151/280 cut-off events. [2024-06-03 22:37:40,737 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2024-06-03 22:37:40,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 280 events. 151/280 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 930 event pairs, 40 based on Foata normal form. 2/281 useless extension candidates. Maximal degree in co-relation 833. Up to 244 conditions per place. [2024-06-03 22:37:40,739 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 41 selfloop transitions, 9 changer transitions 0/52 dead transitions. [2024-06-03 22:37:40,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 301 flow [2024-06-03 22:37:40,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:37:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:37:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-06-03 22:37:40,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-03 22:37:40,757 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 155 flow. Second operand 6 states and 88 transitions. [2024-06-03 22:37:40,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 301 flow [2024-06-03 22:37:40,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 301 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-03 22:37:40,760 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 190 flow [2024-06-03 22:37:40,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-06-03 22:37:40,761 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2024-06-03 22:37:40,761 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 190 flow [2024-06-03 22:37:40,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:40,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:40,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:37:40,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:37:40,761 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-03 22:37:40,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:40,762 INFO L85 PathProgramCache]: Analyzing trace with hash -737566435, now seen corresponding path program 1 times [2024-06-03 22:37:40,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:40,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776045821] [2024-06-03 22:37:40,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:40,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:37:43,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:43,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776045821] [2024-06-03 22:37:43,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776045821] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:43,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:43,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:37:43,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063427817] [2024-06-03 22:37:43,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:43,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:37:43,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:43,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:37:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:37:43,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-03 22:37:43,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-03 22:37:43,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:43,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-03 22:37:43,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:44,039 INFO L124 PetriNetUnfolderBase]: 147/272 cut-off events. [2024-06-03 22:37:44,040 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2024-06-03 22:37:44,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 272 events. 147/272 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 886 event pairs, 21 based on Foata normal form. 4/275 useless extension candidates. Maximal degree in co-relation 883. Up to 218 conditions per place. [2024-06-03 22:37:44,042 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 41 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2024-06-03 22:37:44,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 326 flow [2024-06-03 22:37:44,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:37:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:37:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-03 22:37:44,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-03 22:37:44,044 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 190 flow. Second operand 7 states and 96 transitions. [2024-06-03 22:37:44,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 326 flow [2024-06-03 22:37:44,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 309 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-03 22:37:44,049 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 187 flow [2024-06-03 22:37:44,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2024-06-03 22:37:44,051 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2024-06-03 22:37:44,053 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 187 flow [2024-06-03 22:37:44,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-03 22:37:44,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:44,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:37:44,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:37:44,058 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-03 22:37:44,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:44,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2137059725, now seen corresponding path program 1 times [2024-06-03 22:37:44,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:44,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909477394] [2024-06-03 22:37:44,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:44,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:37:48,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:48,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909477394] [2024-06-03 22:37:48,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909477394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:48,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:48,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:37:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408336469] [2024-06-03 22:37:48,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:48,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:37:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:48,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:37:48,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:37:48,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:37:48,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 187 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:48,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:48,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:37:48,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:49,132 INFO L124 PetriNetUnfolderBase]: 166/303 cut-off events. [2024-06-03 22:37:49,132 INFO L125 PetriNetUnfolderBase]: For 562/562 co-relation queries the response was YES. [2024-06-03 22:37:49,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 303 events. 166/303 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1026 event pairs, 39 based on Foata normal form. 3/305 useless extension candidates. Maximal degree in co-relation 1016. Up to 235 conditions per place. [2024-06-03 22:37:49,136 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 43 selfloop transitions, 14 changer transitions 0/59 dead transitions. [2024-06-03 22:37:49,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 383 flow [2024-06-03 22:37:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:37:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:37:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-03 22:37:49,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-03 22:37:49,143 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 187 flow. Second operand 7 states and 93 transitions. [2024-06-03 22:37:49,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 383 flow [2024-06-03 22:37:49,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 356 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 22:37:49,146 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 217 flow [2024-06-03 22:37:49,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-06-03 22:37:49,149 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2024-06-03 22:37:49,149 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 217 flow [2024-06-03 22:37:49,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:49,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:49,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:37:49,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:37:49,150 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-03 22:37:49,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:49,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1111055291, now seen corresponding path program 2 times [2024-06-03 22:37:49,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:49,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217911322] [2024-06-03 22:37:49,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:37:54,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:54,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217911322] [2024-06-03 22:37:54,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217911322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:54,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:54,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:37:54,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936218340] [2024-06-03 22:37:54,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:54,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:37:54,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:54,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:37:54,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:37:54,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:37:54,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 217 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:54,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:54,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:37:54,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:54,495 INFO L124 PetriNetUnfolderBase]: 184/333 cut-off events. [2024-06-03 22:37:54,496 INFO L125 PetriNetUnfolderBase]: For 834/834 co-relation queries the response was YES. [2024-06-03 22:37:54,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 333 events. 184/333 cut-off events. For 834/834 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1161 event pairs, 40 based on Foata normal form. 3/335 useless extension candidates. Maximal degree in co-relation 1186. Up to 281 conditions per place. [2024-06-03 22:37:54,498 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 44 selfloop transitions, 13 changer transitions 0/59 dead transitions. [2024-06-03 22:37:54,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 401 flow [2024-06-03 22:37:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:37:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:37:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2024-06-03 22:37:54,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2024-06-03 22:37:54,501 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 217 flow. Second operand 7 states and 88 transitions. [2024-06-03 22:37:54,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 401 flow [2024-06-03 22:37:54,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 382 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-03 22:37:54,505 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 261 flow [2024-06-03 22:37:54,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-06-03 22:37:54,506 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2024-06-03 22:37:54,506 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 261 flow [2024-06-03 22:37:54,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:54,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:54,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:37:54,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:37:54,508 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-03 22:37:54,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:54,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1264656335, now seen corresponding path program 1 times [2024-06-03 22:37:54,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:54,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211401699] [2024-06-03 22:37:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:54,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:37:59,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:59,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211401699] [2024-06-03 22:37:59,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211401699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:59,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:59,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:37:59,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534387948] [2024-06-03 22:37:59,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:59,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:37:59,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:59,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:37:59,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:37:59,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:37:59,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 261 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:59,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:59,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:37:59,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:59,562 INFO L124 PetriNetUnfolderBase]: 180/327 cut-off events. [2024-06-03 22:37:59,562 INFO L125 PetriNetUnfolderBase]: For 970/970 co-relation queries the response was YES. [2024-06-03 22:37:59,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 327 events. 180/327 cut-off events. For 970/970 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1147 event pairs, 33 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 1226. Up to 274 conditions per place. [2024-06-03 22:37:59,576 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 41 selfloop transitions, 13 changer transitions 0/56 dead transitions. [2024-06-03 22:37:59,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 409 flow [2024-06-03 22:37:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:37:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:37:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2024-06-03 22:37:59,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2024-06-03 22:37:59,579 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 261 flow. Second operand 5 states and 68 transitions. [2024-06-03 22:37:59,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 409 flow [2024-06-03 22:37:59,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 380 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 22:37:59,582 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 286 flow [2024-06-03 22:37:59,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-06-03 22:37:59,584 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2024-06-03 22:37:59,585 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 286 flow [2024-06-03 22:37:59,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:59,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:59,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:37:59,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:37:59,585 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-03 22:37:59,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:59,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1242550421, now seen corresponding path program 3 times [2024-06-03 22:37:59,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:59,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330921060] [2024-06-03 22:37:59,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:59,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:38:03,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:03,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330921060] [2024-06-03 22:38:03,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330921060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:03,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:03,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:38:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130799839] [2024-06-03 22:38:03,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:03,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:38:03,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:03,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:38:03,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:38:04,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:38:04,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 286 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:04,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:04,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:38:04,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:04,271 INFO L124 PetriNetUnfolderBase]: 174/318 cut-off events. [2024-06-03 22:38:04,271 INFO L125 PetriNetUnfolderBase]: For 1141/1141 co-relation queries the response was YES. [2024-06-03 22:38:04,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1263 conditions, 318 events. 174/318 cut-off events. For 1141/1141 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1102 event pairs, 40 based on Foata normal form. 3/320 useless extension candidates. Maximal degree in co-relation 1233. Up to 266 conditions per place. [2024-06-03 22:38:04,273 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 46 selfloop transitions, 13 changer transitions 0/61 dead transitions. [2024-06-03 22:38:04,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 446 flow [2024-06-03 22:38:04,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:38:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:38:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2024-06-03 22:38:04,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-03 22:38:04,275 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 286 flow. Second operand 6 states and 81 transitions. [2024-06-03 22:38:04,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 446 flow [2024-06-03 22:38:04,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 61 transitions, 424 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-03 22:38:04,278 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 298 flow [2024-06-03 22:38:04,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-06-03 22:38:04,279 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2024-06-03 22:38:04,279 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 298 flow [2024-06-03 22:38:04,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:04,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:04,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:04,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:38:04,280 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-03 22:38:04,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1264647407, now seen corresponding path program 1 times [2024-06-03 22:38:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:04,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475803091] [2024-06-03 22:38:04,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:04,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:38:10,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:10,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475803091] [2024-06-03 22:38:10,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475803091] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:10,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:10,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:38:10,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052609048] [2024-06-03 22:38:10,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:10,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:38:10,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:10,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:38:10,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:38:10,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:38:10,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 298 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:10,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:10,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:38:10,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:10,641 INFO L124 PetriNetUnfolderBase]: 171/313 cut-off events. [2024-06-03 22:38:10,642 INFO L125 PetriNetUnfolderBase]: For 1322/1322 co-relation queries the response was YES. [2024-06-03 22:38:10,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 313 events. 171/313 cut-off events. For 1322/1322 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1069 event pairs, 40 based on Foata normal form. 2/314 useless extension candidates. Maximal degree in co-relation 1245. Up to 289 conditions per place. [2024-06-03 22:38:10,644 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 43 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-03 22:38:10,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 414 flow [2024-06-03 22:38:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:38:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:38:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2024-06-03 22:38:10,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2024-06-03 22:38:10,645 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 298 flow. Second operand 5 states and 61 transitions. [2024-06-03 22:38:10,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 414 flow [2024-06-03 22:38:10,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 375 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-03 22:38:10,647 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 277 flow [2024-06-03 22:38:10,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-06-03 22:38:10,648 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2024-06-03 22:38:10,648 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 277 flow [2024-06-03 22:38:10,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:10,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:10,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:10,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:38:10,649 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-03 22:38:10,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1079636854, now seen corresponding path program 1 times [2024-06-03 22:38:10,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:10,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801707990] [2024-06-03 22:38:10,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:10,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:38:15,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801707990] [2024-06-03 22:38:15,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801707990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:15,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:15,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:38:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545399411] [2024-06-03 22:38:15,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:15,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:38:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:15,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:38:15,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:38:16,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:38:16,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 277 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:16,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:16,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:38:16,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:16,447 INFO L124 PetriNetUnfolderBase]: 190/344 cut-off events. [2024-06-03 22:38:16,447 INFO L125 PetriNetUnfolderBase]: For 1413/1413 co-relation queries the response was YES. [2024-06-03 22:38:16,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 344 events. 190/344 cut-off events. For 1413/1413 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1233 event pairs, 34 based on Foata normal form. 3/346 useless extension candidates. Maximal degree in co-relation 1304. Up to 218 conditions per place. [2024-06-03 22:38:16,449 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 50 selfloop transitions, 26 changer transitions 0/78 dead transitions. [2024-06-03 22:38:16,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 547 flow [2024-06-03 22:38:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:38:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:38:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-03 22:38:16,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2024-06-03 22:38:16,450 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 277 flow. Second operand 9 states and 119 transitions. [2024-06-03 22:38:16,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 547 flow [2024-06-03 22:38:16,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 533 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 22:38:16,453 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 370 flow [2024-06-03 22:38:16,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=370, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2024-06-03 22:38:16,453 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-03 22:38:16,453 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 370 flow [2024-06-03 22:38:16,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:16,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:16,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:16,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:38:16,454 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-03 22:38:16,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1921402206, now seen corresponding path program 2 times [2024-06-03 22:38:16,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:16,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070726654] [2024-06-03 22:38:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:16,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:38:21,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:21,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070726654] [2024-06-03 22:38:21,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070726654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:21,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:21,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:38:21,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665232373] [2024-06-03 22:38:21,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:21,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:38:21,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:21,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:38:21,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:38:21,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:38:21,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 370 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:21,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:21,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:38:21,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:21,967 INFO L124 PetriNetUnfolderBase]: 193/349 cut-off events. [2024-06-03 22:38:21,967 INFO L125 PetriNetUnfolderBase]: For 1739/1739 co-relation queries the response was YES. [2024-06-03 22:38:21,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 349 events. 193/349 cut-off events. For 1739/1739 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1240 event pairs, 39 based on Foata normal form. 1/349 useless extension candidates. Maximal degree in co-relation 1511. Up to 316 conditions per place. [2024-06-03 22:38:21,969 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 53 selfloop transitions, 15 changer transitions 0/70 dead transitions. [2024-06-03 22:38:21,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 600 flow [2024-06-03 22:38:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:38:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:38:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-03 22:38:21,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37916666666666665 [2024-06-03 22:38:21,971 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 370 flow. Second operand 8 states and 91 transitions. [2024-06-03 22:38:21,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 600 flow [2024-06-03 22:38:21,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 554 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-03 22:38:21,974 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 451 flow [2024-06-03 22:38:21,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=451, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2024-06-03 22:38:21,975 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2024-06-03 22:38:21,975 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 451 flow [2024-06-03 22:38:21,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:21,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:21,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:21,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:38:21,976 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-03 22:38:21,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:21,976 INFO L85 PathProgramCache]: Analyzing trace with hash -556997100, now seen corresponding path program 3 times [2024-06-03 22:38:21,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:21,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866779500] [2024-06-03 22:38:21,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:21,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:38:26,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:26,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866779500] [2024-06-03 22:38:26,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866779500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:26,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:26,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:38:26,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785075799] [2024-06-03 22:38:26,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:26,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:38:26,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:26,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:38:26,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:38:26,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:38:26,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 451 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:26,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:26,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:38:26,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:27,138 INFO L124 PetriNetUnfolderBase]: 191/346 cut-off events. [2024-06-03 22:38:27,139 INFO L125 PetriNetUnfolderBase]: For 1941/1941 co-relation queries the response was YES. [2024-06-03 22:38:27,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 346 events. 191/346 cut-off events. For 1941/1941 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1236 event pairs, 39 based on Foata normal form. 1/346 useless extension candidates. Maximal degree in co-relation 1551. Up to 298 conditions per place. [2024-06-03 22:38:27,141 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 59 selfloop transitions, 17 changer transitions 0/78 dead transitions. [2024-06-03 22:38:27,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 78 transitions, 671 flow [2024-06-03 22:38:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:38:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:38:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-03 22:38:27,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 22:38:27,143 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 451 flow. Second operand 7 states and 90 transitions. [2024-06-03 22:38:27,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 78 transitions, 671 flow [2024-06-03 22:38:27,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 78 transitions, 643 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-03 22:38:27,147 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 505 flow [2024-06-03 22:38:27,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=505, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2024-06-03 22:38:27,148 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2024-06-03 22:38:27,148 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 505 flow [2024-06-03 22:38:27,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:27,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:27,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:27,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:38:27,148 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-03 22:38:27,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:27,149 INFO L85 PathProgramCache]: Analyzing trace with hash -549639715, now seen corresponding path program 1 times [2024-06-03 22:38:27,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:27,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621478161] [2024-06-03 22:38:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:38:31,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:31,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621478161] [2024-06-03 22:38:31,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621478161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:31,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:31,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:38:31,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592340096] [2024-06-03 22:38:31,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:31,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:38:31,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:31,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:38:31,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:38:31,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:38:31,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 505 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:31,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:31,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:38:31,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:32,024 INFO L124 PetriNetUnfolderBase]: 187/340 cut-off events. [2024-06-03 22:38:32,024 INFO L125 PetriNetUnfolderBase]: For 2170/2170 co-relation queries the response was YES. [2024-06-03 22:38:32,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 340 events. 187/340 cut-off events. For 2170/2170 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1198 event pairs, 36 based on Foata normal form. 2/341 useless extension candidates. Maximal degree in co-relation 1587. Up to 266 conditions per place. [2024-06-03 22:38:32,027 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 57 selfloop transitions, 20 changer transitions 0/79 dead transitions. [2024-06-03 22:38:32,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 711 flow [2024-06-03 22:38:32,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:38:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:38:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-06-03 22:38:32,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2024-06-03 22:38:32,032 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 505 flow. Second operand 6 states and 83 transitions. [2024-06-03 22:38:32,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 711 flow [2024-06-03 22:38:32,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 79 transitions, 677 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:38:32,037 INFO L231 Difference]: Finished difference. Result has 78 places, 64 transitions, 544 flow [2024-06-03 22:38:32,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=544, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2024-06-03 22:38:32,038 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 49 predicate places. [2024-06-03 22:38:32,038 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 544 flow [2024-06-03 22:38:32,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:32,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:32,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:32,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:38:32,039 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-03 22:38:32,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1840836968, now seen corresponding path program 1 times [2024-06-03 22:38:32,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:32,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129687489] [2024-06-03 22:38:32,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:32,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:37,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:38:37,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:37,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129687489] [2024-06-03 22:38:37,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129687489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:37,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:37,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:38:37,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007406665] [2024-06-03 22:38:37,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:37,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:38:37,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:37,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:38:37,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:38:37,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:38:37,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 64 transitions, 544 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:37,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:37,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:38:37,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:37,899 INFO L124 PetriNetUnfolderBase]: 191/348 cut-off events. [2024-06-03 22:38:37,900 INFO L125 PetriNetUnfolderBase]: For 2579/2579 co-relation queries the response was YES. [2024-06-03 22:38:37,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1737 conditions, 348 events. 191/348 cut-off events. For 2579/2579 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1258 event pairs, 24 based on Foata normal form. 2/349 useless extension candidates. Maximal degree in co-relation 1694. Up to 244 conditions per place. [2024-06-03 22:38:37,902 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 60 selfloop transitions, 27 changer transitions 0/89 dead transitions. [2024-06-03 22:38:37,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 89 transitions, 830 flow [2024-06-03 22:38:37,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:38:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:38:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-03 22:38:37,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:38:37,904 INFO L175 Difference]: Start difference. First operand has 78 places, 64 transitions, 544 flow. Second operand 9 states and 108 transitions. [2024-06-03 22:38:37,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 89 transitions, 830 flow [2024-06-03 22:38:37,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 89 transitions, 777 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-03 22:38:37,909 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 614 flow [2024-06-03 22:38:37,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=614, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2024-06-03 22:38:37,910 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 55 predicate places. [2024-06-03 22:38:37,910 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 614 flow [2024-06-03 22:38:37,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:37,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:37,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:37,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:38:37,911 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-03 22:38:37,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:37,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1840776394, now seen corresponding path program 1 times [2024-06-03 22:38:37,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:37,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866812081] [2024-06-03 22:38:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:37,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:38:43,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:43,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866812081] [2024-06-03 22:38:43,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866812081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:43,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:43,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:38:43,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848712269] [2024-06-03 22:38:43,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:43,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:38:43,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:43,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:38:43,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:38:43,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:38:43,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 614 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:43,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:43,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:38:43,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:44,193 INFO L124 PetriNetUnfolderBase]: 210/379 cut-off events. [2024-06-03 22:38:44,193 INFO L125 PetriNetUnfolderBase]: For 2459/2459 co-relation queries the response was YES. [2024-06-03 22:38:44,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 379 events. 210/379 cut-off events. For 2459/2459 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1383 event pairs, 33 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 1872. Up to 233 conditions per place. [2024-06-03 22:38:44,196 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 58 selfloop transitions, 37 changer transitions 0/97 dead transitions. [2024-06-03 22:38:44,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 97 transitions, 934 flow [2024-06-03 22:38:44,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:38:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:38:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-03 22:38:44,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2024-06-03 22:38:44,199 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 614 flow. Second operand 9 states and 116 transitions. [2024-06-03 22:38:44,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 97 transitions, 934 flow [2024-06-03 22:38:44,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 97 transitions, 869 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-03 22:38:44,204 INFO L231 Difference]: Finished difference. Result has 89 places, 74 transitions, 689 flow [2024-06-03 22:38:44,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=689, PETRI_PLACES=89, PETRI_TRANSITIONS=74} [2024-06-03 22:38:44,204 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-03 22:38:44,205 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 74 transitions, 689 flow [2024-06-03 22:38:44,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:44,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:44,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:44,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:38:44,205 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-03 22:38:44,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:44,206 INFO L85 PathProgramCache]: Analyzing trace with hash 447987146, now seen corresponding path program 2 times [2024-06-03 22:38:44,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:44,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858871915] [2024-06-03 22:38:44,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:44,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:38:49,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:49,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858871915] [2024-06-03 22:38:49,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858871915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:49,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:49,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:38:49,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404417780] [2024-06-03 22:38:49,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:49,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:38:49,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:49,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:38:49,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:38:49,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:38:49,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 74 transitions, 689 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:49,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:49,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:38:49,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:50,373 INFO L124 PetriNetUnfolderBase]: 214/387 cut-off events. [2024-06-03 22:38:50,373 INFO L125 PetriNetUnfolderBase]: For 2806/2806 co-relation queries the response was YES. [2024-06-03 22:38:50,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1984 conditions, 387 events. 214/387 cut-off events. For 2806/2806 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1429 event pairs, 33 based on Foata normal form. 2/388 useless extension candidates. Maximal degree in co-relation 1938. Up to 254 conditions per place. [2024-06-03 22:38:50,377 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 59 selfloop transitions, 37 changer transitions 0/98 dead transitions. [2024-06-03 22:38:50,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 98 transitions, 966 flow [2024-06-03 22:38:50,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:38:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:38:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-03 22:38:50,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-03 22:38:50,379 INFO L175 Difference]: Start difference. First operand has 89 places, 74 transitions, 689 flow. Second operand 9 states and 115 transitions. [2024-06-03 22:38:50,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 98 transitions, 966 flow [2024-06-03 22:38:50,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 98 transitions, 918 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-03 22:38:50,387 INFO L231 Difference]: Finished difference. Result has 94 places, 75 transitions, 726 flow [2024-06-03 22:38:50,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=726, PETRI_PLACES=94, PETRI_TRANSITIONS=75} [2024-06-03 22:38:50,388 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-03 22:38:50,388 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 75 transitions, 726 flow [2024-06-03 22:38:50,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:50,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:50,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:50,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:38:50,389 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-03 22:38:50,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:50,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1837979884, now seen corresponding path program 2 times [2024-06-03 22:38:50,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:50,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601493427] [2024-06-03 22:38:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:50,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:55,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-03 22:38:55,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:55,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601493427] [2024-06-03 22:38:55,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601493427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:55,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:55,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:38:55,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625593163] [2024-06-03 22:38:55,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:55,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:38:55,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:55,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:38:55,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:38:56,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:38:56,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 75 transitions, 726 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:56,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:56,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:38:56,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:56,374 INFO L124 PetriNetUnfolderBase]: 220/397 cut-off events. [2024-06-03 22:38:56,374 INFO L125 PetriNetUnfolderBase]: For 3179/3179 co-relation queries the response was YES. [2024-06-03 22:38:56,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 397 events. 220/397 cut-off events. For 3179/3179 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1486 event pairs, 34 based on Foata normal form. 2/398 useless extension candidates. Maximal degree in co-relation 2064. Up to 297 conditions per place. [2024-06-03 22:38:56,377 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 66 selfloop transitions, 29 changer transitions 0/97 dead transitions. [2024-06-03 22:38:56,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 97 transitions, 982 flow [2024-06-03 22:38:56,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:38:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:38:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-03 22:38:56,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4185185185185185 [2024-06-03 22:38:56,379 INFO L175 Difference]: Start difference. First operand has 94 places, 75 transitions, 726 flow. Second operand 9 states and 113 transitions. [2024-06-03 22:38:56,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 97 transitions, 982 flow [2024-06-03 22:38:56,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 97 transitions, 922 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-03 22:38:56,386 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 753 flow [2024-06-03 22:38:56,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=753, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2024-06-03 22:38:56,387 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-03 22:38:56,387 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 753 flow [2024-06-03 22:38:56,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:56,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:56,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:56,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:38:56,387 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-03 22:38:56,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:56,388 INFO L85 PathProgramCache]: Analyzing trace with hash 450783656, now seen corresponding path program 3 times [2024-06-03 22:38:56,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:56,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906860534] [2024-06-03 22:38:56,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:39:01,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:01,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906860534] [2024-06-03 22:39:01,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906860534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:01,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:01,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:39:01,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548993745] [2024-06-03 22:39:01,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:01,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:39:01,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:01,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:39:01,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:39:01,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:39:01,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 753 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:01,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:01,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:39:01,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:02,210 INFO L124 PetriNetUnfolderBase]: 224/405 cut-off events. [2024-06-03 22:39:02,210 INFO L125 PetriNetUnfolderBase]: For 3557/3557 co-relation queries the response was YES. [2024-06-03 22:39:02,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2164 conditions, 405 events. 224/405 cut-off events. For 3557/3557 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1549 event pairs, 38 based on Foata normal form. 2/406 useless extension candidates. Maximal degree in co-relation 2116. Up to 351 conditions per place. [2024-06-03 22:39:02,213 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 71 selfloop transitions, 21 changer transitions 0/94 dead transitions. [2024-06-03 22:39:02,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 94 transitions, 982 flow [2024-06-03 22:39:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:39:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:39:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-03 22:39:02,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3851851851851852 [2024-06-03 22:39:02,215 INFO L175 Difference]: Start difference. First operand has 96 places, 77 transitions, 753 flow. Second operand 9 states and 104 transitions. [2024-06-03 22:39:02,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 94 transitions, 982 flow [2024-06-03 22:39:02,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 94 transitions, 893 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 22:39:02,220 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 719 flow [2024-06-03 22:39:02,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=719, PETRI_PLACES=97, PETRI_TRANSITIONS=78} [2024-06-03 22:39:02,221 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 68 predicate places. [2024-06-03 22:39:02,221 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 719 flow [2024-06-03 22:39:02,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:02,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:02,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:02,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:39:02,222 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-03 22:39:02,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:02,222 INFO L85 PathProgramCache]: Analyzing trace with hash 566259524, now seen corresponding path program 1 times [2024-06-03 22:39:02,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:02,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140313007] [2024-06-03 22:39:02,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:02,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:07,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-03 22:39:07,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:07,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140313007] [2024-06-03 22:39:07,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140313007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:07,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:07,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:39:07,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543099104] [2024-06-03 22:39:07,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:07,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:39:07,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:07,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:39:07,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:39:07,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:39:07,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 78 transitions, 719 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:07,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:07,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:39:07,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:07,617 INFO L124 PetriNetUnfolderBase]: 231/418 cut-off events. [2024-06-03 22:39:07,617 INFO L125 PetriNetUnfolderBase]: For 3812/3812 co-relation queries the response was YES. [2024-06-03 22:39:07,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2172 conditions, 418 events. 231/418 cut-off events. For 3812/3812 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1601 event pairs, 29 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 2123. Up to 364 conditions per place. [2024-06-03 22:39:07,620 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 77 selfloop transitions, 18 changer transitions 0/97 dead transitions. [2024-06-03 22:39:07,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 97 transitions, 971 flow [2024-06-03 22:39:07,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:39:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:39:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-03 22:39:07,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-03 22:39:07,623 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 719 flow. Second operand 8 states and 95 transitions. [2024-06-03 22:39:07,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 97 transitions, 971 flow [2024-06-03 22:39:07,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 897 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:39:07,629 INFO L231 Difference]: Finished difference. Result has 99 places, 83 transitions, 740 flow [2024-06-03 22:39:07,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=740, PETRI_PLACES=99, PETRI_TRANSITIONS=83} [2024-06-03 22:39:07,629 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 70 predicate places. [2024-06-03 22:39:07,629 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 83 transitions, 740 flow [2024-06-03 22:39:07,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:07,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:07,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:07,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:39:07,630 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-03 22:39:07,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash 566252580, now seen corresponding path program 3 times [2024-06-03 22:39:07,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:07,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113302506] [2024-06-03 22:39:07,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:07,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:12,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-03 22:39:12,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:12,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113302506] [2024-06-03 22:39:12,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113302506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:12,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:12,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:39:12,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544759483] [2024-06-03 22:39:12,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:12,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:39:12,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:12,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:39:12,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:39:12,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:39:12,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 83 transitions, 740 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:12,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:12,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:39:12,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:13,224 INFO L124 PetriNetUnfolderBase]: 243/438 cut-off events. [2024-06-03 22:39:13,225 INFO L125 PetriNetUnfolderBase]: For 4390/4390 co-relation queries the response was YES. [2024-06-03 22:39:13,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2331 conditions, 438 events. 243/438 cut-off events. For 4390/4390 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1716 event pairs, 34 based on Foata normal form. 2/439 useless extension candidates. Maximal degree in co-relation 2280. Up to 374 conditions per place. [2024-06-03 22:39:13,228 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 82 selfloop transitions, 22 changer transitions 0/106 dead transitions. [2024-06-03 22:39:13,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 106 transitions, 1038 flow [2024-06-03 22:39:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:39:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:39:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-03 22:39:13,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-03 22:39:13,230 INFO L175 Difference]: Start difference. First operand has 99 places, 83 transitions, 740 flow. Second operand 11 states and 124 transitions. [2024-06-03 22:39:13,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 106 transitions, 1038 flow [2024-06-03 22:39:13,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 106 transitions, 1011 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-03 22:39:13,237 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 804 flow [2024-06-03 22:39:13,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=804, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2024-06-03 22:39:13,237 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 76 predicate places. [2024-06-03 22:39:13,238 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 804 flow [2024-06-03 22:39:13,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:13,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:13,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:13,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:39:13,238 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-03 22:39:13,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:13,239 INFO L85 PathProgramCache]: Analyzing trace with hash 566079600, now seen corresponding path program 4 times [2024-06-03 22:39:13,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:13,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514212283] [2024-06-03 22:39:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:39:18,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:18,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514212283] [2024-06-03 22:39:18,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514212283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:18,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:18,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:39:18,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683213156] [2024-06-03 22:39:18,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:18,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:39:18,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:18,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:39:18,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:39:18,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:39:18,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 804 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:18,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:18,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:39:18,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:19,033 INFO L124 PetriNetUnfolderBase]: 249/448 cut-off events. [2024-06-03 22:39:19,033 INFO L125 PetriNetUnfolderBase]: For 4904/4904 co-relation queries the response was YES. [2024-06-03 22:39:19,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 448 events. 249/448 cut-off events. For 4904/4904 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1774 event pairs, 36 based on Foata normal form. 2/449 useless extension candidates. Maximal degree in co-relation 2382. Up to 384 conditions per place. [2024-06-03 22:39:19,036 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 83 selfloop transitions, 21 changer transitions 0/106 dead transitions. [2024-06-03 22:39:19,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 106 transitions, 1086 flow [2024-06-03 22:39:19,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:39:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:39:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-03 22:39:19,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:39:19,038 INFO L175 Difference]: Start difference. First operand has 105 places, 87 transitions, 804 flow. Second operand 9 states and 108 transitions. [2024-06-03 22:39:19,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 106 transitions, 1086 flow [2024-06-03 22:39:19,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 106 transitions, 1027 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-03 22:39:19,046 INFO L231 Difference]: Finished difference. Result has 105 places, 89 transitions, 822 flow [2024-06-03 22:39:19,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=822, PETRI_PLACES=105, PETRI_TRANSITIONS=89} [2024-06-03 22:39:19,047 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 76 predicate places. [2024-06-03 22:39:19,047 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 89 transitions, 822 flow [2024-06-03 22:39:19,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:19,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:19,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:19,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:39:19,047 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-03 22:39:19,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1722688838, now seen corresponding path program 4 times [2024-06-03 22:39:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:19,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629127025] [2024-06-03 22:39:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:19,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:39:24,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:24,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629127025] [2024-06-03 22:39:24,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629127025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:24,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:24,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:39:24,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594931804] [2024-06-03 22:39:24,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:24,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:39:24,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:24,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:39:24,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:39:24,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:39:24,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 89 transitions, 822 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:24,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:24,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:39:24,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:24,998 INFO L124 PetriNetUnfolderBase]: 253/456 cut-off events. [2024-06-03 22:39:24,998 INFO L125 PetriNetUnfolderBase]: For 5382/5382 co-relation queries the response was YES. [2024-06-03 22:39:24,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 456 events. 253/456 cut-off events. For 5382/5382 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1814 event pairs, 42 based on Foata normal form. 2/457 useless extension candidates. Maximal degree in co-relation 2421. Up to 417 conditions per place. [2024-06-03 22:39:25,001 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 85 selfloop transitions, 16 changer transitions 0/103 dead transitions. [2024-06-03 22:39:25,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 103 transitions, 1063 flow [2024-06-03 22:39:25,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:39:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:39:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-03 22:39:25,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2024-06-03 22:39:25,004 INFO L175 Difference]: Start difference. First operand has 105 places, 89 transitions, 822 flow. Second operand 9 states and 100 transitions. [2024-06-03 22:39:25,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 103 transitions, 1063 flow [2024-06-03 22:39:25,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 103 transitions, 1010 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-03 22:39:25,015 INFO L231 Difference]: Finished difference. Result has 107 places, 90 transitions, 816 flow [2024-06-03 22:39:25,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=816, PETRI_PLACES=107, PETRI_TRANSITIONS=90} [2024-06-03 22:39:25,015 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 78 predicate places. [2024-06-03 22:39:25,016 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 90 transitions, 816 flow [2024-06-03 22:39:25,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:25,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:25,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:25,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:39:25,016 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-03 22:39:25,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:25,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1722688714, now seen corresponding path program 5 times [2024-06-03 22:39:25,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:25,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268637316] [2024-06-03 22:39:25,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:25,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:39:29,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:29,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268637316] [2024-06-03 22:39:29,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268637316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:29,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:29,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:39:29,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967066554] [2024-06-03 22:39:29,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:29,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:39:29,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:29,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:39:29,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:39:30,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:39:30,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 90 transitions, 816 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:30,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:30,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:39:30,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:30,447 INFO L124 PetriNetUnfolderBase]: 259/466 cut-off events. [2024-06-03 22:39:30,447 INFO L125 PetriNetUnfolderBase]: For 5847/5847 co-relation queries the response was YES. [2024-06-03 22:39:30,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 466 events. 259/466 cut-off events. For 5847/5847 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1869 event pairs, 33 based on Foata normal form. 2/467 useless extension candidates. Maximal degree in co-relation 2467. Up to 370 conditions per place. [2024-06-03 22:39:30,451 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 75 selfloop transitions, 32 changer transitions 0/109 dead transitions. [2024-06-03 22:39:30,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 109 transitions, 1102 flow [2024-06-03 22:39:30,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:39:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:39:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-03 22:39:30,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2024-06-03 22:39:30,452 INFO L175 Difference]: Start difference. First operand has 107 places, 90 transitions, 816 flow. Second operand 9 states and 111 transitions. [2024-06-03 22:39:30,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 109 transitions, 1102 flow [2024-06-03 22:39:30,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 1066 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 22:39:30,462 INFO L231 Difference]: Finished difference. Result has 109 places, 92 transitions, 877 flow [2024-06-03 22:39:30,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=877, PETRI_PLACES=109, PETRI_TRANSITIONS=92} [2024-06-03 22:39:30,462 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 80 predicate places. [2024-06-03 22:39:30,462 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 92 transitions, 877 flow [2024-06-03 22:39:30,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:30,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:30,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:30,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:39:30,463 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-03 22:39:30,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1104369530, now seen corresponding path program 6 times [2024-06-03 22:39:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:30,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020588232] [2024-06-03 22:39:30,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:30,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:39:35,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:35,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020588232] [2024-06-03 22:39:35,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020588232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:35,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:35,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:39:35,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489990166] [2024-06-03 22:39:35,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:35,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:39:35,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:35,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:39:35,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:39:36,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:39:36,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 92 transitions, 877 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:36,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:36,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:39:36,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:36,501 INFO L124 PetriNetUnfolderBase]: 255/460 cut-off events. [2024-06-03 22:39:36,501 INFO L125 PetriNetUnfolderBase]: For 5972/5972 co-relation queries the response was YES. [2024-06-03 22:39:36,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2522 conditions, 460 events. 255/460 cut-off events. For 5972/5972 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1841 event pairs, 33 based on Foata normal form. 2/461 useless extension candidates. Maximal degree in co-relation 2468. Up to 379 conditions per place. [2024-06-03 22:39:36,504 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 89 selfloop transitions, 23 changer transitions 0/114 dead transitions. [2024-06-03 22:39:36,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 1203 flow [2024-06-03 22:39:36,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:39:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:39:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-03 22:39:36,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2024-06-03 22:39:36,505 INFO L175 Difference]: Start difference. First operand has 109 places, 92 transitions, 877 flow. Second operand 8 states and 107 transitions. [2024-06-03 22:39:36,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 1203 flow [2024-06-03 22:39:36,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 114 transitions, 1126 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:39:36,514 INFO L231 Difference]: Finished difference. Result has 110 places, 92 transitions, 851 flow [2024-06-03 22:39:36,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=851, PETRI_PLACES=110, PETRI_TRANSITIONS=92} [2024-06-03 22:39:36,515 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 81 predicate places. [2024-06-03 22:39:36,515 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 92 transitions, 851 flow [2024-06-03 22:39:36,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:36,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:36,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:36,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:39:36,516 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-03 22:39:36,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1104191900, now seen corresponding path program 7 times [2024-06-03 22:39:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:36,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843483522] [2024-06-03 22:39:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:39:41,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:41,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843483522] [2024-06-03 22:39:41,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843483522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:41,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:41,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:39:41,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151793190] [2024-06-03 22:39:41,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:41,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:39:41,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:41,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:39:41,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:39:41,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:39:41,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 92 transitions, 851 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:41,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:41,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:39:41,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:42,369 INFO L124 PetriNetUnfolderBase]: 267/480 cut-off events. [2024-06-03 22:39:42,370 INFO L125 PetriNetUnfolderBase]: For 6504/6504 co-relation queries the response was YES. [2024-06-03 22:39:42,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2636 conditions, 480 events. 267/480 cut-off events. For 6504/6504 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1966 event pairs, 39 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 2581. Up to 416 conditions per place. [2024-06-03 22:39:42,373 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 89 selfloop transitions, 19 changer transitions 0/110 dead transitions. [2024-06-03 22:39:42,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 110 transitions, 1161 flow [2024-06-03 22:39:42,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:39:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:39:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-03 22:39:42,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:39:42,374 INFO L175 Difference]: Start difference. First operand has 110 places, 92 transitions, 851 flow. Second operand 8 states and 96 transitions. [2024-06-03 22:39:42,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 110 transitions, 1161 flow [2024-06-03 22:39:42,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 110 transitions, 1051 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-03 22:39:42,384 INFO L231 Difference]: Finished difference. Result has 111 places, 96 transitions, 844 flow [2024-06-03 22:39:42,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=844, PETRI_PLACES=111, PETRI_TRANSITIONS=96} [2024-06-03 22:39:42,385 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 82 predicate places. [2024-06-03 22:39:42,385 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 96 transitions, 844 flow [2024-06-03 22:39:42,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:42,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:42,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:42,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:39:42,386 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-03 22:39:42,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:42,387 INFO L85 PathProgramCache]: Analyzing trace with hash -87035074, now seen corresponding path program 8 times [2024-06-03 22:39:42,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:42,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847254973] [2024-06-03 22:39:42,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:42,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:39:47,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:47,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847254973] [2024-06-03 22:39:47,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847254973] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:47,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:47,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:39:47,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270853868] [2024-06-03 22:39:47,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:47,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:39:47,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:47,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:39:47,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:39:47,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:39:47,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 96 transitions, 844 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:47,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:47,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:39:47,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:47,772 INFO L124 PetriNetUnfolderBase]: 266/479 cut-off events. [2024-06-03 22:39:47,772 INFO L125 PetriNetUnfolderBase]: For 6374/6374 co-relation queries the response was YES. [2024-06-03 22:39:47,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2514 conditions, 479 events. 266/479 cut-off events. For 6374/6374 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1974 event pairs, 35 based on Foata normal form. 2/480 useless extension candidates. Maximal degree in co-relation 2458. Up to 398 conditions per place. [2024-06-03 22:39:47,776 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 89 selfloop transitions, 25 changer transitions 0/116 dead transitions. [2024-06-03 22:39:47,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 1136 flow [2024-06-03 22:39:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:39:47,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:39:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-03 22:39:47,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-03 22:39:47,777 INFO L175 Difference]: Start difference. First operand has 111 places, 96 transitions, 844 flow. Second operand 8 states and 102 transitions. [2024-06-03 22:39:47,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 1136 flow [2024-06-03 22:39:47,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 116 transitions, 1060 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-03 22:39:47,788 INFO L231 Difference]: Finished difference. Result has 114 places, 98 transitions, 853 flow [2024-06-03 22:39:47,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=853, PETRI_PLACES=114, PETRI_TRANSITIONS=98} [2024-06-03 22:39:47,788 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 85 predicate places. [2024-06-03 22:39:47,789 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 98 transitions, 853 flow [2024-06-03 22:39:47,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:47,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:47,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:47,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:39:47,789 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-03 22:39:47,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:47,789 INFO L85 PathProgramCache]: Analyzing trace with hash -86855150, now seen corresponding path program 2 times [2024-06-03 22:39:47,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:47,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300334224] [2024-06-03 22:39:47,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:47,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:39:52,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:52,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300334224] [2024-06-03 22:39:52,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300334224] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:52,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:52,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:39:52,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049002166] [2024-06-03 22:39:52,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:52,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:39:52,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:52,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:39:52,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:39:52,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:39:52,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 98 transitions, 853 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:52,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:52,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:39:52,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:53,177 INFO L124 PetriNetUnfolderBase]: 270/487 cut-off events. [2024-06-03 22:39:53,178 INFO L125 PetriNetUnfolderBase]: For 6679/6679 co-relation queries the response was YES. [2024-06-03 22:39:53,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2538 conditions, 487 events. 270/487 cut-off events. For 6679/6679 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2006 event pairs, 36 based on Foata normal form. 2/488 useless extension candidates. Maximal degree in co-relation 2482. Up to 436 conditions per place. [2024-06-03 22:39:53,181 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 93 selfloop transitions, 16 changer transitions 0/111 dead transitions. [2024-06-03 22:39:53,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 111 transitions, 1107 flow [2024-06-03 22:39:53,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:39:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:39:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-03 22:39:53,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-03 22:39:53,184 INFO L175 Difference]: Start difference. First operand has 114 places, 98 transitions, 853 flow. Second operand 7 states and 83 transitions. [2024-06-03 22:39:53,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 111 transitions, 1107 flow [2024-06-03 22:39:53,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 1045 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:39:53,194 INFO L231 Difference]: Finished difference. Result has 115 places, 99 transitions, 837 flow [2024-06-03 22:39:53,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=837, PETRI_PLACES=115, PETRI_TRANSITIONS=99} [2024-06-03 22:39:53,198 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 86 predicate places. [2024-06-03 22:39:53,198 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 99 transitions, 837 flow [2024-06-03 22:39:53,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:53,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:53,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:53,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:39:53,199 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-03 22:39:53,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:53,199 INFO L85 PathProgramCache]: Analyzing trace with hash -87039848, now seen corresponding path program 5 times [2024-06-03 22:39:53,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:53,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590027088] [2024-06-03 22:39:53,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:53,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:39:58,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:58,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590027088] [2024-06-03 22:39:58,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590027088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:58,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:58,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:39:58,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641930172] [2024-06-03 22:39:58,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:58,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:39:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:58,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:39:58,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:39:58,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:39:58,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 99 transitions, 837 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:58,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:58,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:39:58,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:59,029 INFO L124 PetriNetUnfolderBase]: 267/482 cut-off events. [2024-06-03 22:39:59,029 INFO L125 PetriNetUnfolderBase]: For 6499/6499 co-relation queries the response was YES. [2024-06-03 22:39:59,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 482 events. 267/482 cut-off events. For 6499/6499 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1976 event pairs, 29 based on Foata normal form. 2/483 useless extension candidates. Maximal degree in co-relation 2402. Up to 410 conditions per place. [2024-06-03 22:39:59,032 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 96 selfloop transitions, 19 changer transitions 0/117 dead transitions. [2024-06-03 22:39:59,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 117 transitions, 1111 flow [2024-06-03 22:39:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:39:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:39:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-03 22:39:59,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-03 22:39:59,035 INFO L175 Difference]: Start difference. First operand has 115 places, 99 transitions, 837 flow. Second operand 8 states and 99 transitions. [2024-06-03 22:39:59,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 117 transitions, 1111 flow [2024-06-03 22:39:59,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 117 transitions, 1081 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 22:39:59,045 INFO L231 Difference]: Finished difference. Result has 119 places, 99 transitions, 851 flow [2024-06-03 22:39:59,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=851, PETRI_PLACES=119, PETRI_TRANSITIONS=99} [2024-06-03 22:39:59,045 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 90 predicate places. [2024-06-03 22:39:59,045 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 99 transitions, 851 flow [2024-06-03 22:39:59,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:59,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:59,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:59,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:39:59,046 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-03 22:39:59,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:59,046 INFO L85 PathProgramCache]: Analyzing trace with hash 141046000, now seen corresponding path program 3 times [2024-06-03 22:39:59,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:59,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123053348] [2024-06-03 22:39:59,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:59,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:03,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:03,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123053348] [2024-06-03 22:40:03,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123053348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:03,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:03,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:40:03,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105973789] [2024-06-03 22:40:03,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:03,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:40:03,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:03,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:40:03,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:40:03,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:40:03,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 99 transitions, 851 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:03,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:03,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:40:03,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:04,049 INFO L124 PetriNetUnfolderBase]: 271/490 cut-off events. [2024-06-03 22:40:04,050 INFO L125 PetriNetUnfolderBase]: For 6487/6487 co-relation queries the response was YES. [2024-06-03 22:40:04,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2494 conditions, 490 events. 271/490 cut-off events. For 6487/6487 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2025 event pairs, 34 based on Foata normal form. 2/491 useless extension candidates. Maximal degree in co-relation 2436. Up to 416 conditions per place. [2024-06-03 22:40:04,053 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 88 selfloop transitions, 21 changer transitions 0/111 dead transitions. [2024-06-03 22:40:04,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 111 transitions, 1103 flow [2024-06-03 22:40:04,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:40:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:40:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-06-03 22:40:04,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2024-06-03 22:40:04,054 INFO L175 Difference]: Start difference. First operand has 119 places, 99 transitions, 851 flow. Second operand 6 states and 77 transitions. [2024-06-03 22:40:04,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 111 transitions, 1103 flow [2024-06-03 22:40:04,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 111 transitions, 1049 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:40:04,063 INFO L231 Difference]: Finished difference. Result has 117 places, 100 transitions, 856 flow [2024-06-03 22:40:04,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=856, PETRI_PLACES=117, PETRI_TRANSITIONS=100} [2024-06-03 22:40:04,064 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 88 predicate places. [2024-06-03 22:40:04,064 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 100 transitions, 856 flow [2024-06-03 22:40:04,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:04,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:04,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:04,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:40:04,064 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-03 22:40:04,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:04,065 INFO L85 PathProgramCache]: Analyzing trace with hash 141039056, now seen corresponding path program 9 times [2024-06-03 22:40:04,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:04,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620458771] [2024-06-03 22:40:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:08,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:08,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620458771] [2024-06-03 22:40:08,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620458771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:08,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:08,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:40:08,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850191787] [2024-06-03 22:40:08,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:08,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:40:08,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:08,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:40:08,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:40:09,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:40:09,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 100 transitions, 856 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:09,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:09,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:40:09,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:09,450 INFO L124 PetriNetUnfolderBase]: 267/484 cut-off events. [2024-06-03 22:40:09,451 INFO L125 PetriNetUnfolderBase]: For 5957/5957 co-relation queries the response was YES. [2024-06-03 22:40:09,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2421 conditions, 484 events. 267/484 cut-off events. For 5957/5957 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2014 event pairs, 42 based on Foata normal form. 2/485 useless extension candidates. Maximal degree in co-relation 2363. Up to 400 conditions per place. [2024-06-03 22:40:09,454 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 90 selfloop transitions, 29 changer transitions 0/121 dead transitions. [2024-06-03 22:40:09,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 121 transitions, 1168 flow [2024-06-03 22:40:09,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:40:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:40:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-03 22:40:09,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-03 22:40:09,461 INFO L175 Difference]: Start difference. First operand has 117 places, 100 transitions, 856 flow. Second operand 7 states and 98 transitions. [2024-06-03 22:40:09,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 121 transitions, 1168 flow [2024-06-03 22:40:09,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 121 transitions, 1127 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 22:40:09,471 INFO L231 Difference]: Finished difference. Result has 120 places, 102 transitions, 911 flow [2024-06-03 22:40:09,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=911, PETRI_PLACES=120, PETRI_TRANSITIONS=102} [2024-06-03 22:40:09,472 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 91 predicate places. [2024-06-03 22:40:09,472 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 102 transitions, 911 flow [2024-06-03 22:40:09,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:09,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:09,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:09,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:40:09,473 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-03 22:40:09,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:09,473 INFO L85 PathProgramCache]: Analyzing trace with hash 149616880, now seen corresponding path program 4 times [2024-06-03 22:40:09,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:09,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761565295] [2024-06-03 22:40:09,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:09,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:14,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:14,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761565295] [2024-06-03 22:40:14,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761565295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:14,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:14,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:40:14,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006661763] [2024-06-03 22:40:14,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:14,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:40:14,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:14,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:40:14,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:40:14,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:40:14,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 102 transitions, 911 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:14,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:14,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:40:14,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:14,598 INFO L124 PetriNetUnfolderBase]: 264/479 cut-off events. [2024-06-03 22:40:14,598 INFO L125 PetriNetUnfolderBase]: For 5296/5296 co-relation queries the response was YES. [2024-06-03 22:40:14,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 479 events. 264/479 cut-off events. For 5296/5296 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1989 event pairs, 41 based on Foata normal form. 2/480 useless extension candidates. Maximal degree in co-relation 2342. Up to 447 conditions per place. [2024-06-03 22:40:14,601 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 99 selfloop transitions, 9 changer transitions 0/110 dead transitions. [2024-06-03 22:40:14,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 110 transitions, 1145 flow [2024-06-03 22:40:14,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:40:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:40:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-03 22:40:14,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-03 22:40:14,613 INFO L175 Difference]: Start difference. First operand has 120 places, 102 transitions, 911 flow. Second operand 6 states and 70 transitions. [2024-06-03 22:40:14,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 110 transitions, 1145 flow [2024-06-03 22:40:14,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 110 transitions, 1072 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 22:40:14,624 INFO L231 Difference]: Finished difference. Result has 120 places, 102 transitions, 860 flow [2024-06-03 22:40:14,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=860, PETRI_PLACES=120, PETRI_TRANSITIONS=102} [2024-06-03 22:40:14,624 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 91 predicate places. [2024-06-03 22:40:14,624 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 102 transitions, 860 flow [2024-06-03 22:40:14,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:14,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:14,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:14,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:40:14,625 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-03 22:40:14,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1002614340, now seen corresponding path program 1 times [2024-06-03 22:40:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:14,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242498085] [2024-06-03 22:40:14,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:14,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:19,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:19,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242498085] [2024-06-03 22:40:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242498085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:19,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:19,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:40:19,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489259718] [2024-06-03 22:40:19,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:19,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:40:19,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:19,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:40:19,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:40:19,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:40:19,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 102 transitions, 860 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:19,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:19,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:40:19,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:20,195 INFO L124 PetriNetUnfolderBase]: 291/540 cut-off events. [2024-06-03 22:40:20,195 INFO L125 PetriNetUnfolderBase]: For 8272/8272 co-relation queries the response was YES. [2024-06-03 22:40:20,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2642 conditions, 540 events. 291/540 cut-off events. For 8272/8272 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2315 event pairs, 40 based on Foata normal form. 8/547 useless extension candidates. Maximal degree in co-relation 2583. Up to 177 conditions per place. [2024-06-03 22:40:20,198 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 58 selfloop transitions, 60 changer transitions 13/133 dead transitions. [2024-06-03 22:40:20,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 133 transitions, 1268 flow [2024-06-03 22:40:20,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:40:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:40:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-03 22:40:20,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43 [2024-06-03 22:40:20,200 INFO L175 Difference]: Start difference. First operand has 120 places, 102 transitions, 860 flow. Second operand 10 states and 129 transitions. [2024-06-03 22:40:20,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 133 transitions, 1268 flow [2024-06-03 22:40:20,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 133 transitions, 1230 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:40:20,212 INFO L231 Difference]: Finished difference. Result has 125 places, 99 transitions, 920 flow [2024-06-03 22:40:20,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=920, PETRI_PLACES=125, PETRI_TRANSITIONS=99} [2024-06-03 22:40:20,213 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 96 predicate places. [2024-06-03 22:40:20,213 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 99 transitions, 920 flow [2024-06-03 22:40:20,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:20,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:20,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:20,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:40:20,214 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-03 22:40:20,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:20,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1002700830, now seen corresponding path program 2 times [2024-06-03 22:40:20,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:20,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351426168] [2024-06-03 22:40:20,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:20,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:25,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:25,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351426168] [2024-06-03 22:40:25,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351426168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:25,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:25,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:40:25,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315007035] [2024-06-03 22:40:25,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:25,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:40:25,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:25,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:40:25,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:40:25,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:40:25,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 99 transitions, 920 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:25,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:25,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:40:25,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:26,001 INFO L124 PetriNetUnfolderBase]: 304/569 cut-off events. [2024-06-03 22:40:26,001 INFO L125 PetriNetUnfolderBase]: For 12091/12091 co-relation queries the response was YES. [2024-06-03 22:40:26,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3103 conditions, 569 events. 304/569 cut-off events. For 12091/12091 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2547 event pairs, 47 based on Foata normal form. 8/576 useless extension candidates. Maximal degree in co-relation 3043. Up to 254 conditions per place. [2024-06-03 22:40:26,004 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 60 selfloop transitions, 60 changer transitions 7/129 dead transitions. [2024-06-03 22:40:26,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 129 transitions, 1336 flow [2024-06-03 22:40:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:40:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:40:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-03 22:40:26,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-03 22:40:26,005 INFO L175 Difference]: Start difference. First operand has 125 places, 99 transitions, 920 flow. Second operand 10 states and 130 transitions. [2024-06-03 22:40:26,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 129 transitions, 1336 flow [2024-06-03 22:40:26,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 129 transitions, 1232 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:40:26,021 INFO L231 Difference]: Finished difference. Result has 123 places, 97 transitions, 928 flow [2024-06-03 22:40:26,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=928, PETRI_PLACES=123, PETRI_TRANSITIONS=97} [2024-06-03 22:40:26,021 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 94 predicate places. [2024-06-03 22:40:26,021 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 97 transitions, 928 flow [2024-06-03 22:40:26,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:26,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:26,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:26,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:40:26,022 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-03 22:40:26,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:26,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1002704550, now seen corresponding path program 3 times [2024-06-03 22:40:26,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:26,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048544698] [2024-06-03 22:40:26,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:26,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:31,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:31,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048544698] [2024-06-03 22:40:31,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048544698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:31,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:31,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:40:31,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628501584] [2024-06-03 22:40:31,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:31,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:40:31,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:31,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:40:31,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:40:31,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:40:31,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 97 transitions, 928 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:31,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:31,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:40:31,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:32,089 INFO L124 PetriNetUnfolderBase]: 277/516 cut-off events. [2024-06-03 22:40:32,089 INFO L125 PetriNetUnfolderBase]: For 9109/9109 co-relation queries the response was YES. [2024-06-03 22:40:32,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822 conditions, 516 events. 277/516 cut-off events. For 9109/9109 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2218 event pairs, 44 based on Foata normal form. 6/521 useless extension candidates. Maximal degree in co-relation 2763. Up to 318 conditions per place. [2024-06-03 22:40:32,092 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 69 selfloop transitions, 51 changer transitions 0/122 dead transitions. [2024-06-03 22:40:32,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 122 transitions, 1254 flow [2024-06-03 22:40:32,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:40:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:40:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-03 22:40:32,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2024-06-03 22:40:32,094 INFO L175 Difference]: Start difference. First operand has 123 places, 97 transitions, 928 flow. Second operand 10 states and 122 transitions. [2024-06-03 22:40:32,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 122 transitions, 1254 flow [2024-06-03 22:40:32,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 1132 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:40:32,106 INFO L231 Difference]: Finished difference. Result has 122 places, 99 transitions, 942 flow [2024-06-03 22:40:32,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=942, PETRI_PLACES=122, PETRI_TRANSITIONS=99} [2024-06-03 22:40:32,106 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 93 predicate places. [2024-06-03 22:40:32,106 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 99 transitions, 942 flow [2024-06-03 22:40:32,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:32,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:32,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:32,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:40:32,106 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-03 22:40:32,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:32,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1089540510, now seen corresponding path program 4 times [2024-06-03 22:40:32,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:32,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138729770] [2024-06-03 22:40:32,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:32,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:38,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:38,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138729770] [2024-06-03 22:40:38,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138729770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:38,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:38,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:40:38,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456161347] [2024-06-03 22:40:38,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:38,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:40:38,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:38,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:40:38,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:40:39,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:40:39,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 99 transitions, 942 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:39,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:39,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:40:39,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:39,484 INFO L124 PetriNetUnfolderBase]: 305/580 cut-off events. [2024-06-03 22:40:39,484 INFO L125 PetriNetUnfolderBase]: For 11402/11402 co-relation queries the response was YES. [2024-06-03 22:40:39,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3015 conditions, 580 events. 305/580 cut-off events. For 11402/11402 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2648 event pairs, 64 based on Foata normal form. 18/597 useless extension candidates. Maximal degree in co-relation 2957. Up to 409 conditions per place. [2024-06-03 22:40:39,487 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 82 selfloop transitions, 25 changer transitions 16/125 dead transitions. [2024-06-03 22:40:39,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 125 transitions, 1284 flow [2024-06-03 22:40:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:40:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:40:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-03 22:40:39,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41 [2024-06-03 22:40:39,488 INFO L175 Difference]: Start difference. First operand has 122 places, 99 transitions, 942 flow. Second operand 10 states and 123 transitions. [2024-06-03 22:40:39,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 125 transitions, 1284 flow [2024-06-03 22:40:39,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 125 transitions, 1166 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-03 22:40:39,501 INFO L231 Difference]: Finished difference. Result has 124 places, 94 transitions, 840 flow [2024-06-03 22:40:39,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=840, PETRI_PLACES=124, PETRI_TRANSITIONS=94} [2024-06-03 22:40:39,501 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 95 predicate places. [2024-06-03 22:40:39,502 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 94 transitions, 840 flow [2024-06-03 22:40:39,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:39,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:39,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:39,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:40:39,502 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-03 22:40:39,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:39,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1089396360, now seen corresponding path program 5 times [2024-06-03 22:40:39,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:39,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458588051] [2024-06-03 22:40:39,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:39,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:44,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:44,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458588051] [2024-06-03 22:40:44,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458588051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:44,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:44,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:40:44,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629705161] [2024-06-03 22:40:44,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:44,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:40:44,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:44,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:40:44,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:40:44,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:40:44,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 94 transitions, 840 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:44,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:44,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:40:44,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:45,194 INFO L124 PetriNetUnfolderBase]: 279/530 cut-off events. [2024-06-03 22:40:45,194 INFO L125 PetriNetUnfolderBase]: For 9960/9960 co-relation queries the response was YES. [2024-06-03 22:40:45,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2746 conditions, 530 events. 279/530 cut-off events. For 9960/9960 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2331 event pairs, 56 based on Foata normal form. 10/539 useless extension candidates. Maximal degree in co-relation 2687. Up to 368 conditions per place. [2024-06-03 22:40:45,197 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 69 selfloop transitions, 36 changer transitions 11/118 dead transitions. [2024-06-03 22:40:45,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 118 transitions, 1158 flow [2024-06-03 22:40:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:40:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:40:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-03 22:40:45,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2024-06-03 22:40:45,198 INFO L175 Difference]: Start difference. First operand has 124 places, 94 transitions, 840 flow. Second operand 10 states and 122 transitions. [2024-06-03 22:40:45,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 118 transitions, 1158 flow [2024-06-03 22:40:45,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 118 transitions, 1081 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-03 22:40:45,211 INFO L231 Difference]: Finished difference. Result has 120 places, 91 transitions, 818 flow [2024-06-03 22:40:45,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=818, PETRI_PLACES=120, PETRI_TRANSITIONS=91} [2024-06-03 22:40:45,211 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 91 predicate places. [2024-06-03 22:40:45,211 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 91 transitions, 818 flow [2024-06-03 22:40:45,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:45,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:45,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:45,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:40:45,212 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-03 22:40:45,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:45,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1089392640, now seen corresponding path program 6 times [2024-06-03 22:40:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660814436] [2024-06-03 22:40:45,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:45,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:50,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:50,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660814436] [2024-06-03 22:40:50,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660814436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:50,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:50,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:40:50,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894796299] [2024-06-03 22:40:50,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:50,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:40:50,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:50,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:40:50,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:40:51,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:40:51,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 91 transitions, 818 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:51,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:51,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:40:51,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:51,309 INFO L124 PetriNetUnfolderBase]: 267/510 cut-off events. [2024-06-03 22:40:51,309 INFO L125 PetriNetUnfolderBase]: For 9374/9374 co-relation queries the response was YES. [2024-06-03 22:40:51,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2655 conditions, 510 events. 267/510 cut-off events. For 9374/9374 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2232 event pairs, 46 based on Foata normal form. 8/517 useless extension candidates. Maximal degree in co-relation 2598. Up to 384 conditions per place. [2024-06-03 22:40:51,312 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 76 selfloop transitions, 23 changer transitions 13/114 dead transitions. [2024-06-03 22:40:51,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 114 transitions, 1116 flow [2024-06-03 22:40:51,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:40:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:40:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-03 22:40:51,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39 [2024-06-03 22:40:51,313 INFO L175 Difference]: Start difference. First operand has 120 places, 91 transitions, 818 flow. Second operand 10 states and 117 transitions. [2024-06-03 22:40:51,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 114 transitions, 1116 flow [2024-06-03 22:40:51,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 114 transitions, 1040 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:40:51,325 INFO L231 Difference]: Finished difference. Result has 118 places, 87 transitions, 759 flow [2024-06-03 22:40:51,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=759, PETRI_PLACES=118, PETRI_TRANSITIONS=87} [2024-06-03 22:40:51,325 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 89 predicate places. [2024-06-03 22:40:51,325 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 87 transitions, 759 flow [2024-06-03 22:40:51,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:51,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:51,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:51,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:40:51,326 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-03 22:40:51,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1703213556, now seen corresponding path program 1 times [2024-06-03 22:40:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663743688] [2024-06-03 22:40:51,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:51,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:56,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:56,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663743688] [2024-06-03 22:40:56,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663743688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:56,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:56,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:40:56,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131143070] [2024-06-03 22:40:56,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:56,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:40:56,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:56,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:40:56,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:40:56,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:40:56,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 87 transitions, 759 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:56,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:56,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:40:56,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:57,030 INFO L124 PetriNetUnfolderBase]: 251/474 cut-off events. [2024-06-03 22:40:57,030 INFO L125 PetriNetUnfolderBase]: For 7126/7126 co-relation queries the response was YES. [2024-06-03 22:40:57,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2474 conditions, 474 events. 251/474 cut-off events. For 7126/7126 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2004 event pairs, 50 based on Foata normal form. 2/475 useless extension candidates. Maximal degree in co-relation 2418. Up to 412 conditions per place. [2024-06-03 22:40:57,033 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 84 selfloop transitions, 21 changer transitions 0/107 dead transitions. [2024-06-03 22:40:57,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 107 transitions, 1025 flow [2024-06-03 22:40:57,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:40:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:40:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-03 22:40:57,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-06-03 22:40:57,035 INFO L175 Difference]: Start difference. First operand has 118 places, 87 transitions, 759 flow. Second operand 11 states and 123 transitions. [2024-06-03 22:40:57,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 107 transitions, 1025 flow [2024-06-03 22:40:57,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 107 transitions, 973 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-03 22:40:57,045 INFO L231 Difference]: Finished difference. Result has 114 places, 88 transitions, 761 flow [2024-06-03 22:40:57,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=761, PETRI_PLACES=114, PETRI_TRANSITIONS=88} [2024-06-03 22:40:57,045 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 85 predicate places. [2024-06-03 22:40:57,045 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 88 transitions, 761 flow [2024-06-03 22:40:57,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:57,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:57,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:57,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:40:57,046 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-03 22:40:57,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:57,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1858234984, now seen corresponding path program 7 times [2024-06-03 22:40:57,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:57,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38408795] [2024-06-03 22:40:57,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:57,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:02,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:02,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38408795] [2024-06-03 22:41:02,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38408795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:02,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:02,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:41:02,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770810590] [2024-06-03 22:41:02,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:02,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:41:02,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:02,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:41:02,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:41:02,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:41:02,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 88 transitions, 761 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:02,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:02,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:41:02,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:02,810 INFO L124 PetriNetUnfolderBase]: 267/510 cut-off events. [2024-06-03 22:41:02,810 INFO L125 PetriNetUnfolderBase]: For 7776/7776 co-relation queries the response was YES. [2024-06-03 22:41:02,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2553 conditions, 510 events. 267/510 cut-off events. For 7776/7776 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2225 event pairs, 60 based on Foata normal form. 10/519 useless extension candidates. Maximal degree in co-relation 2499. Up to 404 conditions per place. [2024-06-03 22:41:02,812 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 81 selfloop transitions, 19 changer transitions 11/113 dead transitions. [2024-06-03 22:41:02,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 113 transitions, 1073 flow [2024-06-03 22:41:02,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:41:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:41:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2024-06-03 22:41:02,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2024-06-03 22:41:02,813 INFO L175 Difference]: Start difference. First operand has 114 places, 88 transitions, 761 flow. Second operand 12 states and 136 transitions. [2024-06-03 22:41:02,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 113 transitions, 1073 flow [2024-06-03 22:41:02,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 1029 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:41:02,822 INFO L231 Difference]: Finished difference. Result has 117 places, 85 transitions, 736 flow [2024-06-03 22:41:02,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=736, PETRI_PLACES=117, PETRI_TRANSITIONS=85} [2024-06-03 22:41:02,823 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 88 predicate places. [2024-06-03 22:41:02,823 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 85 transitions, 736 flow [2024-06-03 22:41:02,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:02,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:02,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:41:02,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:41:02,824 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-03 22:41:02,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:02,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1863597364, now seen corresponding path program 8 times [2024-06-03 22:41:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:02,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422369157] [2024-06-03 22:41:02,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:02,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:08,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:08,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:08,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422369157] [2024-06-03 22:41:08,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422369157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:08,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:08,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:41:08,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904036014] [2024-06-03 22:41:08,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:08,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:41:08,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:08,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:41:08,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:41:08,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:41:08,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 85 transitions, 736 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:08,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:08,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:41:08,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:08,593 INFO L124 PetriNetUnfolderBase]: 257/496 cut-off events. [2024-06-03 22:41:08,593 INFO L125 PetriNetUnfolderBase]: For 8455/8455 co-relation queries the response was YES. [2024-06-03 22:41:08,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2496 conditions, 496 events. 257/496 cut-off events. For 8455/8455 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2165 event pairs, 62 based on Foata normal form. 10/505 useless extension candidates. Maximal degree in co-relation 2441. Up to 390 conditions per place. [2024-06-03 22:41:08,596 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 78 selfloop transitions, 17 changer transitions 11/108 dead transitions. [2024-06-03 22:41:08,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 108 transitions, 1034 flow [2024-06-03 22:41:08,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:41:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:41:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-03 22:41:08,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:41:08,609 INFO L175 Difference]: Start difference. First operand has 117 places, 85 transitions, 736 flow. Second operand 10 states and 120 transitions. [2024-06-03 22:41:08,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 108 transitions, 1034 flow [2024-06-03 22:41:08,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 108 transitions, 992 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-03 22:41:08,618 INFO L231 Difference]: Finished difference. Result has 113 places, 82 transitions, 709 flow [2024-06-03 22:41:08,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=709, PETRI_PLACES=113, PETRI_TRANSITIONS=82} [2024-06-03 22:41:08,619 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2024-06-03 22:41:08,619 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 82 transitions, 709 flow [2024-06-03 22:41:08,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:08,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:08,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-03 22:41:08,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:41:08,620 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-03 22:41:08,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:08,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1858019782, now seen corresponding path program 2 times [2024-06-03 22:41:08,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:08,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171371045] [2024-06-03 22:41:08,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:08,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:14,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171371045] [2024-06-03 22:41:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171371045] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:41:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456503630] [2024-06-03 22:41:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:14,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:41:14,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:14,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:41:14,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:41:14,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:41:14,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 82 transitions, 709 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:14,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:14,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:41:14,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:14,761 INFO L124 PetriNetUnfolderBase]: 242/467 cut-off events. [2024-06-03 22:41:14,761 INFO L125 PetriNetUnfolderBase]: For 6517/6517 co-relation queries the response was YES. [2024-06-03 22:41:14,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 467 events. 242/467 cut-off events. For 6517/6517 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2008 event pairs, 55 based on Foata normal form. 2/468 useless extension candidates. Maximal degree in co-relation 2337. Up to 382 conditions per place. [2024-06-03 22:41:14,763 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 80 selfloop transitions, 22 changer transitions 0/104 dead transitions. [2024-06-03 22:41:14,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 104 transitions, 1021 flow [2024-06-03 22:41:14,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:41:14,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:41:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-03 22:41:14,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-06-03 22:41:14,765 INFO L175 Difference]: Start difference. First operand has 113 places, 82 transitions, 709 flow. Second operand 11 states and 123 transitions. [2024-06-03 22:41:14,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 104 transitions, 1021 flow [2024-06-03 22:41:14,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 104 transitions, 979 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 22:41:14,774 INFO L231 Difference]: Finished difference. Result has 112 places, 84 transitions, 737 flow [2024-06-03 22:41:14,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=737, PETRI_PLACES=112, PETRI_TRANSITIONS=84} [2024-06-03 22:41:14,774 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 83 predicate places. [2024-06-03 22:41:14,774 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 84 transitions, 737 flow [2024-06-03 22:41:14,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:14,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:14,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:41:14,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:41:14,775 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-03 22:41:14,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1863745234, now seen corresponding path program 9 times [2024-06-03 22:41:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:14,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113276261] [2024-06-03 22:41:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:14,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:20,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:20,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113276261] [2024-06-03 22:41:20,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113276261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:20,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:20,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:41:20,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618442876] [2024-06-03 22:41:20,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:20,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:41:20,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:20,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:41:20,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:41:20,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:41:20,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 84 transitions, 737 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:20,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:20,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:41:20,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:21,053 INFO L124 PetriNetUnfolderBase]: 283/554 cut-off events. [2024-06-03 22:41:21,054 INFO L125 PetriNetUnfolderBase]: For 9240/9240 co-relation queries the response was YES. [2024-06-03 22:41:21,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2884 conditions, 554 events. 283/554 cut-off events. For 9240/9240 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2540 event pairs, 64 based on Foata normal form. 8/561 useless extension candidates. Maximal degree in co-relation 2831. Up to 386 conditions per place. [2024-06-03 22:41:21,057 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 84 selfloop transitions, 18 changer transitions 7/111 dead transitions. [2024-06-03 22:41:21,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 111 transitions, 1105 flow [2024-06-03 22:41:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:41:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:41:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 22:41:21,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41333333333333333 [2024-06-03 22:41:21,058 INFO L175 Difference]: Start difference. First operand has 112 places, 84 transitions, 737 flow. Second operand 10 states and 124 transitions. [2024-06-03 22:41:21,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 111 transitions, 1105 flow [2024-06-03 22:41:21,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 1071 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 22:41:21,066 INFO L231 Difference]: Finished difference. Result has 115 places, 82 transitions, 728 flow [2024-06-03 22:41:21,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=728, PETRI_PLACES=115, PETRI_TRANSITIONS=82} [2024-06-03 22:41:21,067 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 86 predicate places. [2024-06-03 22:41:21,067 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 82 transitions, 728 flow [2024-06-03 22:41:21,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:21,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:21,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:41:21,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:41:21,067 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-03 22:41:21,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1863591412, now seen corresponding path program 3 times [2024-06-03 22:41:21,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:21,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656884056] [2024-06-03 22:41:21,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:21,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:26,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:26,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:26,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656884056] [2024-06-03 22:41:26,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656884056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:26,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:26,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:41:26,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836457283] [2024-06-03 22:41:26,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:26,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:41:26,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:26,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:41:26,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:41:26,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:41:26,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 82 transitions, 728 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:26,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:26,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:41:26,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:27,328 INFO L124 PetriNetUnfolderBase]: 262/511 cut-off events. [2024-06-03 22:41:27,328 INFO L125 PetriNetUnfolderBase]: For 8321/8321 co-relation queries the response was YES. [2024-06-03 22:41:27,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 511 events. 262/511 cut-off events. For 8321/8321 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2271 event pairs, 69 based on Foata normal form. 2/512 useless extension candidates. Maximal degree in co-relation 2688. Up to 449 conditions per place. [2024-06-03 22:41:27,331 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 79 selfloop transitions, 18 changer transitions 0/99 dead transitions. [2024-06-03 22:41:27,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 99 transitions, 968 flow [2024-06-03 22:41:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:41:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:41:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-03 22:41:27,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925925925925926 [2024-06-03 22:41:27,333 INFO L175 Difference]: Start difference. First operand has 115 places, 82 transitions, 728 flow. Second operand 9 states and 106 transitions. [2024-06-03 22:41:27,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 99 transitions, 968 flow [2024-06-03 22:41:27,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 99 transitions, 928 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:41:27,342 INFO L231 Difference]: Finished difference. Result has 113 places, 82 transitions, 728 flow [2024-06-03 22:41:27,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=728, PETRI_PLACES=113, PETRI_TRANSITIONS=82} [2024-06-03 22:41:27,342 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2024-06-03 22:41:27,343 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 82 transitions, 728 flow [2024-06-03 22:41:27,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:27,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:27,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:41:27,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:41:27,343 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-03 22:41:27,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1863741514, now seen corresponding path program 10 times [2024-06-03 22:41:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:27,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881184088] [2024-06-03 22:41:27,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:27,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:32,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:32,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881184088] [2024-06-03 22:41:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881184088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:32,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:32,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:41:32,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704454178] [2024-06-03 22:41:32,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:32,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:41:32,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:32,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:41:32,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:41:33,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:41:33,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 82 transitions, 728 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:33,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:33,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:41:33,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:33,441 INFO L124 PetriNetUnfolderBase]: 249/488 cut-off events. [2024-06-03 22:41:33,441 INFO L125 PetriNetUnfolderBase]: For 7215/7215 co-relation queries the response was YES. [2024-06-03 22:41:33,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2444 conditions, 488 events. 249/488 cut-off events. For 7215/7215 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2140 event pairs, 54 based on Foata normal form. 10/497 useless extension candidates. Maximal degree in co-relation 2390. Up to 381 conditions per place. [2024-06-03 22:41:33,443 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 74 selfloop transitions, 15 changer transitions 13/104 dead transitions. [2024-06-03 22:41:33,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 104 transitions, 1014 flow [2024-06-03 22:41:33,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:41:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:41:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-03 22:41:33,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3933333333333333 [2024-06-03 22:41:33,444 INFO L175 Difference]: Start difference. First operand has 113 places, 82 transitions, 728 flow. Second operand 10 states and 118 transitions. [2024-06-03 22:41:33,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 104 transitions, 1014 flow [2024-06-03 22:41:33,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 104 transitions, 972 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-03 22:41:33,453 INFO L231 Difference]: Finished difference. Result has 115 places, 78 transitions, 689 flow [2024-06-03 22:41:33,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=689, PETRI_PLACES=115, PETRI_TRANSITIONS=78} [2024-06-03 22:41:33,453 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 86 predicate places. [2024-06-03 22:41:33,453 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 78 transitions, 689 flow [2024-06-03 22:41:33,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:33,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:33,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:41:33,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:41:33,454 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-03 22:41:33,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:33,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1602451212, now seen corresponding path program 4 times [2024-06-03 22:41:33,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:33,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479984102] [2024-06-03 22:41:33,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:33,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:38,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:38,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479984102] [2024-06-03 22:41:38,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479984102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:38,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:38,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:41:38,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643791013] [2024-06-03 22:41:38,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:38,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:41:38,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:38,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:41:38,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:41:38,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:41:38,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 78 transitions, 689 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:38,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:38,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:41:38,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:39,159 INFO L124 PetriNetUnfolderBase]: 228/445 cut-off events. [2024-06-03 22:41:39,159 INFO L125 PetriNetUnfolderBase]: For 6072/6072 co-relation queries the response was YES. [2024-06-03 22:41:39,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 445 events. 228/445 cut-off events. For 6072/6072 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1886 event pairs, 55 based on Foata normal form. 2/446 useless extension candidates. Maximal degree in co-relation 2234. Up to 366 conditions per place. [2024-06-03 22:41:39,161 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 71 selfloop transitions, 21 changer transitions 0/94 dead transitions. [2024-06-03 22:41:39,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 94 transitions, 923 flow [2024-06-03 22:41:39,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:41:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:41:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-03 22:41:39,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-03 22:41:39,162 INFO L175 Difference]: Start difference. First operand has 115 places, 78 transitions, 689 flow. Second operand 8 states and 98 transitions. [2024-06-03 22:41:39,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 94 transitions, 923 flow [2024-06-03 22:41:39,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 94 transitions, 887 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:41:39,173 INFO L231 Difference]: Finished difference. Result has 108 places, 79 transitions, 711 flow [2024-06-03 22:41:39,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=711, PETRI_PLACES=108, PETRI_TRANSITIONS=79} [2024-06-03 22:41:39,174 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-03 22:41:39,174 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 79 transitions, 711 flow [2024-06-03 22:41:39,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:39,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:39,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:41:39,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:41:39,174 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-03 22:41:39,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:39,175 INFO L85 PathProgramCache]: Analyzing trace with hash 77250460, now seen corresponding path program 5 times [2024-06-03 22:41:39,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:39,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984342409] [2024-06-03 22:41:39,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984342409] [2024-06-03 22:41:44,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984342409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:44,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:44,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:41:44,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127111709] [2024-06-03 22:41:44,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:44,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:41:44,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:44,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:41:44,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:41:44,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:41:44,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 79 transitions, 711 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:44,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:44,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:41:44,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:44,893 INFO L124 PetriNetUnfolderBase]: 256/509 cut-off events. [2024-06-03 22:41:44,893 INFO L125 PetriNetUnfolderBase]: For 8007/8007 co-relation queries the response was YES. [2024-06-03 22:41:44,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 509 events. 256/509 cut-off events. For 8007/8007 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2312 event pairs, 66 based on Foata normal form. 18/526 useless extension candidates. Maximal degree in co-relation 2434. Up to 285 conditions per place. [2024-06-03 22:41:44,895 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 55 selfloop transitions, 19 changer transitions 26/102 dead transitions. [2024-06-03 22:41:44,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 102 transitions, 1005 flow [2024-06-03 22:41:44,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:41:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:41:44,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-03 22:41:44,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2024-06-03 22:41:44,896 INFO L175 Difference]: Start difference. First operand has 108 places, 79 transitions, 711 flow. Second operand 8 states and 107 transitions. [2024-06-03 22:41:44,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 102 transitions, 1005 flow [2024-06-03 22:41:44,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 102 transitions, 968 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:41:44,904 INFO L231 Difference]: Finished difference. Result has 111 places, 60 transitions, 546 flow [2024-06-03 22:41:44,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=546, PETRI_PLACES=111, PETRI_TRANSITIONS=60} [2024-06-03 22:41:44,904 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 82 predicate places. [2024-06-03 22:41:44,904 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 60 transitions, 546 flow [2024-06-03 22:41:44,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:44,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:44,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:41:44,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:41:44,905 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-03 22:41:44,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:44,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1596736920, now seen corresponding path program 11 times [2024-06-03 22:41:44,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:44,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479646027] [2024-06-03 22:41:44,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:44,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:50,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:50,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479646027] [2024-06-03 22:41:50,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479646027] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:50,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:50,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:41:50,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268704454] [2024-06-03 22:41:50,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:50,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:41:50,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:50,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:41:50,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:41:50,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:41:50,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 60 transitions, 546 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:50,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:50,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:41:50,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:50,749 INFO L124 PetriNetUnfolderBase]: 182/383 cut-off events. [2024-06-03 22:41:50,749 INFO L125 PetriNetUnfolderBase]: For 6621/6621 co-relation queries the response was YES. [2024-06-03 22:41:50,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 383 events. 182/383 cut-off events. For 6621/6621 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1639 event pairs, 59 based on Foata normal form. 10/392 useless extension candidates. Maximal degree in co-relation 1860. Up to 266 conditions per place. [2024-06-03 22:41:50,751 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 52 selfloop transitions, 17 changer transitions 11/82 dead transitions. [2024-06-03 22:41:50,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 82 transitions, 786 flow [2024-06-03 22:41:50,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:41:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:41:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-03 22:41:50,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-03 22:41:50,755 INFO L175 Difference]: Start difference. First operand has 111 places, 60 transitions, 546 flow. Second operand 9 states and 110 transitions. [2024-06-03 22:41:50,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 82 transitions, 786 flow [2024-06-03 22:41:50,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 82 transitions, 679 flow, removed 11 selfloop flow, removed 19 redundant places. [2024-06-03 22:41:50,763 INFO L231 Difference]: Finished difference. Result has 96 places, 57 transitions, 461 flow [2024-06-03 22:41:50,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=461, PETRI_PLACES=96, PETRI_TRANSITIONS=57} [2024-06-03 22:41:50,763 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-03 22:41:50,763 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 57 transitions, 461 flow [2024-06-03 22:41:50,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:50,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:50,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:41:50,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:41:50,763 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-03 22:41:50,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:50,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1504563070, now seen corresponding path program 12 times [2024-06-03 22:41:50,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:50,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358093978] [2024-06-03 22:41:50,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:50,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:56,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:56,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358093978] [2024-06-03 22:41:56,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358093978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:56,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:56,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:41:56,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082318303] [2024-06-03 22:41:56,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:56,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:41:56,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:56,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:41:56,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:41:56,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:41:56,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 57 transitions, 461 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:56,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:56,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:41:56,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:56,683 INFO L124 PetriNetUnfolderBase]: 148/317 cut-off events. [2024-06-03 22:41:56,683 INFO L125 PetriNetUnfolderBase]: For 3290/3290 co-relation queries the response was YES. [2024-06-03 22:41:56,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 317 events. 148/317 cut-off events. For 3290/3290 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1266 event pairs, 37 based on Foata normal form. 8/324 useless extension candidates. Maximal degree in co-relation 1336. Up to 210 conditions per place. [2024-06-03 22:41:56,685 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 50 selfloop transitions, 14 changer transitions 11/77 dead transitions. [2024-06-03 22:41:56,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 77 transitions, 661 flow [2024-06-03 22:41:56,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:41:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:41:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 22:41:56,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3962962962962963 [2024-06-03 22:41:56,685 INFO L175 Difference]: Start difference. First operand has 96 places, 57 transitions, 461 flow. Second operand 9 states and 107 transitions. [2024-06-03 22:41:56,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 77 transitions, 661 flow [2024-06-03 22:41:56,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 77 transitions, 619 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:41:56,690 INFO L231 Difference]: Finished difference. Result has 94 places, 52 transitions, 402 flow [2024-06-03 22:41:56,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=402, PETRI_PLACES=94, PETRI_TRANSITIONS=52} [2024-06-03 22:41:56,690 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-03 22:41:56,690 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 52 transitions, 402 flow [2024-06-03 22:41:56,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:56,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:56,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:41:56,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:41:56,691 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-03 22:41:56,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash 130005738, now seen corresponding path program 6 times [2024-06-03 22:41:56,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:56,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112057240] [2024-06-03 22:41:56,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:42:01,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:01,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112057240] [2024-06-03 22:42:01,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112057240] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:01,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:01,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:42:01,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365584486] [2024-06-03 22:42:01,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:01,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:42:01,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:01,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:42:01,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:42:01,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:42:01,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 52 transitions, 402 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:01,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:01,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:42:01,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:02,111 INFO L124 PetriNetUnfolderBase]: 132/281 cut-off events. [2024-06-03 22:42:02,112 INFO L125 PetriNetUnfolderBase]: For 2224/2224 co-relation queries the response was YES. [2024-06-03 22:42:02,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 281 events. 132/281 cut-off events. For 2224/2224 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1065 event pairs, 36 based on Foata normal form. 2/282 useless extension candidates. Maximal degree in co-relation 1198. Up to 219 conditions per place. [2024-06-03 22:42:02,113 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 53 selfloop transitions, 13 changer transitions 0/68 dead transitions. [2024-06-03 22:42:02,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 68 transitions, 582 flow [2024-06-03 22:42:02,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:42:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:42:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-03 22:42:02,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-03 22:42:02,114 INFO L175 Difference]: Start difference. First operand has 94 places, 52 transitions, 402 flow. Second operand 8 states and 95 transitions. [2024-06-03 22:42:02,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 68 transitions, 582 flow [2024-06-03 22:42:02,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 68 transitions, 539 flow, removed 2 selfloop flow, removed 13 redundant places. [2024-06-03 22:42:02,117 INFO L231 Difference]: Finished difference. Result has 86 places, 53 transitions, 401 flow [2024-06-03 22:42:02,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=401, PETRI_PLACES=86, PETRI_TRANSITIONS=53} [2024-06-03 22:42:02,118 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2024-06-03 22:42:02,118 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 53 transitions, 401 flow [2024-06-03 22:42:02,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:02,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:02,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:42:02,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:42:02,118 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-03 22:42:02,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:02,119 INFO L85 PathProgramCache]: Analyzing trace with hash 343156990, now seen corresponding path program 7 times [2024-06-03 22:42:02,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:02,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503956168] [2024-06-03 22:42:02,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:02,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:42:07,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:07,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503956168] [2024-06-03 22:42:07,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503956168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:07,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:07,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:42:07,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292203996] [2024-06-03 22:42:07,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:07,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:42:07,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:07,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:42:07,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:42:07,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:42:07,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 53 transitions, 401 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:07,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:07,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:42:07,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:07,729 INFO L124 PetriNetUnfolderBase]: 136/289 cut-off events. [2024-06-03 22:42:07,730 INFO L125 PetriNetUnfolderBase]: For 2029/2029 co-relation queries the response was YES. [2024-06-03 22:42:07,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 289 events. 136/289 cut-off events. For 2029/2029 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1106 event pairs, 37 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 1207. Up to 249 conditions per place. [2024-06-03 22:42:07,731 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 52 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2024-06-03 22:42:07,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 64 transitions, 559 flow [2024-06-03 22:42:07,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:42:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:42:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-03 22:42:07,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-03 22:42:07,732 INFO L175 Difference]: Start difference. First operand has 86 places, 53 transitions, 401 flow. Second operand 7 states and 79 transitions. [2024-06-03 22:42:07,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 64 transitions, 559 flow [2024-06-03 22:42:07,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 64 transitions, 521 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 22:42:07,735 INFO L231 Difference]: Finished difference. Result has 86 places, 54 transitions, 401 flow [2024-06-03 22:42:07,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=86, PETRI_TRANSITIONS=54} [2024-06-03 22:42:07,736 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2024-06-03 22:42:07,736 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 54 transitions, 401 flow [2024-06-03 22:42:07,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:07,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:07,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:42:07,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:42:07,737 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-03 22:42:07,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:07,737 INFO L85 PathProgramCache]: Analyzing trace with hash 333960220, now seen corresponding path program 8 times [2024-06-03 22:42:07,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:07,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649013565] [2024-06-03 22:42:07,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:07,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:13,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-03 22:42:13,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:13,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649013565] [2024-06-03 22:42:13,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649013565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:13,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:13,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:42:13,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995530234] [2024-06-03 22:42:13,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:13,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:42:13,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:13,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:42:13,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:42:13,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:42:13,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 54 transitions, 401 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:13,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:13,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:42:13,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:13,735 INFO L124 PetriNetUnfolderBase]: 133/284 cut-off events. [2024-06-03 22:42:13,735 INFO L125 PetriNetUnfolderBase]: For 1951/1951 co-relation queries the response was YES. [2024-06-03 22:42:13,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 284 events. 133/284 cut-off events. For 1951/1951 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1088 event pairs, 36 based on Foata normal form. 2/285 useless extension candidates. Maximal degree in co-relation 1146. Up to 200 conditions per place. [2024-06-03 22:42:13,736 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 49 selfloop transitions, 16 changer transitions 0/67 dead transitions. [2024-06-03 22:42:13,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 67 transitions, 563 flow [2024-06-03 22:42:13,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:42:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:42:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-03 22:42:13,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-03 22:42:13,737 INFO L175 Difference]: Start difference. First operand has 86 places, 54 transitions, 401 flow. Second operand 7 states and 87 transitions. [2024-06-03 22:42:13,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 67 transitions, 563 flow [2024-06-03 22:42:13,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 67 transitions, 535 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-03 22:42:13,741 INFO L231 Difference]: Finished difference. Result has 88 places, 54 transitions, 411 flow [2024-06-03 22:42:13,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=411, PETRI_PLACES=88, PETRI_TRANSITIONS=54} [2024-06-03 22:42:13,741 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2024-06-03 22:42:13,741 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 54 transitions, 411 flow [2024-06-03 22:42:13,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:13,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:13,741 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-03 22:42:13,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:42:13,741 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-03 22:42:13,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:13,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1291898555, now seen corresponding path program 1 times [2024-06-03 22:42:13,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:13,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446405772] [2024-06-03 22:42:13,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:13,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:42:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:19,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446405772] [2024-06-03 22:42:19,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446405772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:19,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:19,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:42:19,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788024700] [2024-06-03 22:42:19,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:19,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:42:19,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:19,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:42:19,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:42:19,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:42:19,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 54 transitions, 411 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:19,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:19,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:42:19,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:20,126 INFO L124 PetriNetUnfolderBase]: 141/304 cut-off events. [2024-06-03 22:42:20,126 INFO L125 PetriNetUnfolderBase]: For 2713/2713 co-relation queries the response was YES. [2024-06-03 22:42:20,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 304 events. 141/304 cut-off events. For 2713/2713 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1207 event pairs, 37 based on Foata normal form. 6/309 useless extension candidates. Maximal degree in co-relation 1217. Up to 209 conditions per place. [2024-06-03 22:42:20,127 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 49 selfloop transitions, 15 changer transitions 11/77 dead transitions. [2024-06-03 22:42:20,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 77 transitions, 625 flow [2024-06-03 22:42:20,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:42:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:42:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2024-06-03 22:42:20,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3638888888888889 [2024-06-03 22:42:20,128 INFO L175 Difference]: Start difference. First operand has 88 places, 54 transitions, 411 flow. Second operand 12 states and 131 transitions. [2024-06-03 22:42:20,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 77 transitions, 625 flow [2024-06-03 22:42:20,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 77 transitions, 562 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 22:42:20,132 INFO L231 Difference]: Finished difference. Result has 93 places, 51 transitions, 365 flow [2024-06-03 22:42:20,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=365, PETRI_PLACES=93, PETRI_TRANSITIONS=51} [2024-06-03 22:42:20,133 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-03 22:42:20,133 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 51 transitions, 365 flow [2024-06-03 22:42:20,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:20,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:20,133 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-03 22:42:20,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:42:20,133 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-03 22:42:20,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:20,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1285411805, now seen corresponding path program 2 times [2024-06-03 22:42:20,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:20,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507382579] [2024-06-03 22:42:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:20,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:42:26,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:26,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507382579] [2024-06-03 22:42:26,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507382579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:26,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:26,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:42:26,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187577654] [2024-06-03 22:42:26,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:26,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:42:26,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:26,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:42:26,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:42:26,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:42:26,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 51 transitions, 365 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:26,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:26,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:42:26,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:26,446 INFO L124 PetriNetUnfolderBase]: 131/286 cut-off events. [2024-06-03 22:42:26,446 INFO L125 PetriNetUnfolderBase]: For 2638/2638 co-relation queries the response was YES. [2024-06-03 22:42:26,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 286 events. 131/286 cut-off events. For 2638/2638 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1114 event pairs, 32 based on Foata normal form. 6/291 useless extension candidates. Maximal degree in co-relation 1091. Up to 194 conditions per place. [2024-06-03 22:42:26,447 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 48 selfloop transitions, 12 changer transitions 12/74 dead transitions. [2024-06-03 22:42:26,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 74 transitions, 571 flow [2024-06-03 22:42:26,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:42:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:42:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2024-06-03 22:42:26,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-03 22:42:26,448 INFO L175 Difference]: Start difference. First operand has 93 places, 51 transitions, 365 flow. Second operand 12 states and 130 transitions. [2024-06-03 22:42:26,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 74 transitions, 571 flow [2024-06-03 22:42:26,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 74 transitions, 537 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 22:42:26,452 INFO L231 Difference]: Finished difference. Result has 90 places, 47 transitions, 336 flow [2024-06-03 22:42:26,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=336, PETRI_PLACES=90, PETRI_TRANSITIONS=47} [2024-06-03 22:42:26,452 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-03 22:42:26,452 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 47 transitions, 336 flow [2024-06-03 22:42:26,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:26,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:26,453 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-03 22:42:26,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 22:42:26,453 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-03 22:42:26,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:26,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1936757887, now seen corresponding path program 3 times [2024-06-03 22:42:26,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:26,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762490908] [2024-06-03 22:42:26,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:26,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:42:32,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:32,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762490908] [2024-06-03 22:42:32,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762490908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:32,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:32,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:42:32,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293883009] [2024-06-03 22:42:32,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:32,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:42:32,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:32,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:42:32,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:42:32,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:42:32,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 47 transitions, 336 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:32,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:32,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:42:32,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:32,889 INFO L124 PetriNetUnfolderBase]: 119/262 cut-off events. [2024-06-03 22:42:32,889 INFO L125 PetriNetUnfolderBase]: For 2326/2326 co-relation queries the response was YES. [2024-06-03 22:42:32,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 262 events. 119/262 cut-off events. For 2326/2326 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 977 event pairs, 34 based on Foata normal form. 6/267 useless extension candidates. Maximal degree in co-relation 1005. Up to 190 conditions per place. [2024-06-03 22:42:32,890 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 42 selfloop transitions, 7 changer transitions 15/66 dead transitions. [2024-06-03 22:42:32,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 66 transitions, 516 flow [2024-06-03 22:42:32,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:42:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:42:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-03 22:42:32,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-03 22:42:32,893 INFO L175 Difference]: Start difference. First operand has 90 places, 47 transitions, 336 flow. Second operand 10 states and 110 transitions. [2024-06-03 22:42:32,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 66 transitions, 516 flow [2024-06-03 22:42:32,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 66 transitions, 488 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 22:42:32,896 INFO L231 Difference]: Finished difference. Result has 84 places, 42 transitions, 296 flow [2024-06-03 22:42:32,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=296, PETRI_PLACES=84, PETRI_TRANSITIONS=42} [2024-06-03 22:42:32,897 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 55 predicate places. [2024-06-03 22:42:32,897 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 42 transitions, 296 flow [2024-06-03 22:42:32,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:32,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:32,897 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-03 22:42:32,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 22:42:32,897 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-03 22:42:32,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:32,898 INFO L85 PathProgramCache]: Analyzing trace with hash -425695037, now seen corresponding path program 4 times [2024-06-03 22:42:32,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:32,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750901333] [2024-06-03 22:42:32,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:42:39,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:39,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750901333] [2024-06-03 22:42:39,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750901333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:39,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:39,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:42:39,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651136331] [2024-06-03 22:42:39,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:39,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:42:39,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:39,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:42:39,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:42:39,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:42:39,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 42 transitions, 296 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:39,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:39,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:42:39,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:39,641 INFO L124 PetriNetUnfolderBase]: 109/240 cut-off events. [2024-06-03 22:42:39,641 INFO L125 PetriNetUnfolderBase]: For 2076/2076 co-relation queries the response was YES. [2024-06-03 22:42:39,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 240 events. 109/240 cut-off events. For 2076/2076 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 861 event pairs, 32 based on Foata normal form. 6/245 useless extension candidates. Maximal degree in co-relation 917. Up to 163 conditions per place. [2024-06-03 22:42:39,642 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 38 selfloop transitions, 5 changer transitions 15/60 dead transitions. [2024-06-03 22:42:39,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 60 transitions, 460 flow [2024-06-03 22:42:39,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:42:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:42:39,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-03 22:42:39,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37407407407407406 [2024-06-03 22:42:39,643 INFO L175 Difference]: Start difference. First operand has 84 places, 42 transitions, 296 flow. Second operand 9 states and 101 transitions. [2024-06-03 22:42:39,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 60 transitions, 460 flow [2024-06-03 22:42:39,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 60 transitions, 440 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 22:42:39,645 INFO L231 Difference]: Finished difference. Result has 77 places, 37 transitions, 242 flow [2024-06-03 22:42:39,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=242, PETRI_PLACES=77, PETRI_TRANSITIONS=37} [2024-06-03 22:42:39,645 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 48 predicate places. [2024-06-03 22:42:39,646 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 37 transitions, 242 flow [2024-06-03 22:42:39,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:39,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:39,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-03 22:42:39,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 22:42:39,646 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-03 22:42:39,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:39,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1893715249, now seen corresponding path program 5 times [2024-06-03 22:42:39,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:39,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614236102] [2024-06-03 22:42:39,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:42:46,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:46,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614236102] [2024-06-03 22:42:46,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614236102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:46,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:46,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:42:46,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864374262] [2024-06-03 22:42:46,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:46,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:42:46,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:46,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:42:46,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:42:46,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:42:46,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 37 transitions, 242 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-03 22:42:46,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:46,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:42:46,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:47,005 INFO L124 PetriNetUnfolderBase]: 96/213 cut-off events. [2024-06-03 22:42:47,005 INFO L125 PetriNetUnfolderBase]: For 1567/1567 co-relation queries the response was YES. [2024-06-03 22:42:47,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 213 events. 96/213 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 713 event pairs, 32 based on Foata normal form. 6/218 useless extension candidates. Maximal degree in co-relation 789. Up to 128 conditions per place. [2024-06-03 22:42:47,006 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 32 selfloop transitions, 5 changer transitions 15/54 dead transitions. [2024-06-03 22:42:47,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 54 transitions, 392 flow [2024-06-03 22:42:47,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:42:47,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:42:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-03 22:42:47,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-03 22:42:47,006 INFO L175 Difference]: Start difference. First operand has 77 places, 37 transitions, 242 flow. Second operand 8 states and 87 transitions. [2024-06-03 22:42:47,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 54 transitions, 392 flow [2024-06-03 22:42:47,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 54 transitions, 360 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-03 22:42:47,008 INFO L231 Difference]: Finished difference. Result has 67 places, 31 transitions, 179 flow [2024-06-03 22:42:47,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=179, PETRI_PLACES=67, PETRI_TRANSITIONS=31} [2024-06-03 22:42:47,009 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 38 predicate places. [2024-06-03 22:42:47,009 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 31 transitions, 179 flow [2024-06-03 22:42:47,009 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-03 22:42:47,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:47,009 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-03 22:42:47,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 22:42:47,009 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-03 22:42:47,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:47,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2047933135, now seen corresponding path program 6 times [2024-06-03 22:42:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:47,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155825568] [2024-06-03 22:42:47,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:47,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:42:52,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:52,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155825568] [2024-06-03 22:42:52,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155825568] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:52,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:52,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:42:52,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084538655] [2024-06-03 22:42:52,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:52,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:42:52,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:52,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:42:52,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:42:52,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:42:52,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 31 transitions, 179 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:52,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:52,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:42:52,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:53,044 INFO L124 PetriNetUnfolderBase]: 66/151 cut-off events. [2024-06-03 22:42:53,044 INFO L125 PetriNetUnfolderBase]: For 1002/1002 co-relation queries the response was YES. [2024-06-03 22:42:53,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 151 events. 66/151 cut-off events. For 1002/1002 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 425 event pairs, 15 based on Foata normal form. 6/156 useless extension candidates. Maximal degree in co-relation 495. Up to 87 conditions per place. [2024-06-03 22:42:53,045 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 22 selfloop transitions, 3 changer transitions 17/44 dead transitions. [2024-06-03 22:42:53,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 44 transitions, 291 flow [2024-06-03 22:42:53,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:42:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:42:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-03 22:42:53,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2024-06-03 22:42:53,046 INFO L175 Difference]: Start difference. First operand has 67 places, 31 transitions, 179 flow. Second operand 8 states and 89 transitions. [2024-06-03 22:42:53,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 44 transitions, 291 flow [2024-06-03 22:42:53,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 44 transitions, 266 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-03 22:42:53,047 INFO L231 Difference]: Finished difference. Result has 59 places, 23 transitions, 125 flow [2024-06-03 22:42:53,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=125, PETRI_PLACES=59, PETRI_TRANSITIONS=23} [2024-06-03 22:42:53,048 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 30 predicate places. [2024-06-03 22:42:53,048 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 23 transitions, 125 flow [2024-06-03 22:42:53,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:53,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:53,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:42:53,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 22:42:53,048 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:42:53,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1526581563, now seen corresponding path program 1 times [2024-06-03 22:42:53,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:53,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063159071] [2024-06-03 22:42:53,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:42:59,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:59,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063159071] [2024-06-03 22:42:59,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063159071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:59,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:59,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:42:59,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099305959] [2024-06-03 22:42:59,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:59,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:42:59,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:59,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:42:59,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:42:59,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:42:59,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 23 transitions, 125 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:59,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:59,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:42:59,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:59,921 INFO L124 PetriNetUnfolderBase]: 37/88 cut-off events. [2024-06-03 22:42:59,921 INFO L125 PetriNetUnfolderBase]: For 367/367 co-relation queries the response was YES. [2024-06-03 22:42:59,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 88 events. 37/88 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 180 event pairs, 0 based on Foata normal form. 4/92 useless extension candidates. Maximal degree in co-relation 272. Up to 22 conditions per place. [2024-06-03 22:42:59,921 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 0 selfloop transitions, 0 changer transitions 41/41 dead transitions. [2024-06-03 22:42:59,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 41 transitions, 225 flow [2024-06-03 22:42:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:42:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:42:59,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2024-06-03 22:42:59,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3212121212121212 [2024-06-03 22:42:59,922 INFO L175 Difference]: Start difference. First operand has 59 places, 23 transitions, 125 flow. Second operand 11 states and 106 transitions. [2024-06-03 22:42:59,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 41 transitions, 225 flow [2024-06-03 22:42:59,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 183 flow, removed 2 selfloop flow, removed 17 redundant places. [2024-06-03 22:42:59,923 INFO L231 Difference]: Finished difference. Result has 44 places, 0 transitions, 0 flow [2024-06-03 22:42:59,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=44, PETRI_TRANSITIONS=0} [2024-06-03 22:42:59,923 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2024-06-03 22:42:59,923 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 0 transitions, 0 flow [2024-06-03 22:42:59,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:59,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-03 22:42:59,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-03 22:42:59,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-03 22:42:59,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-03 22:42:59,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 22:42:59,927 INFO L445 BasicCegarLoop]: Path program histogram: [12, 9, 8, 6, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:42:59,930 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 22:42:59,930 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 22:42:59,933 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-03 22:42:59,933 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-03 22:42:59,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 10:42:59 BasicIcfg [2024-06-03 22:42:59,934 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 22:42:59,935 INFO L158 Benchmark]: Toolchain (without parser) took 333900.38ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 85.7MB in the beginning and 638.1MB in the end (delta: -552.5MB). Peak memory consumption was 710.9MB. Max. memory is 16.1GB. [2024-06-03 22:42:59,935 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 146.8MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:42:59,935 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:42:59,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 744.53ms. Allocated memory is still 146.8MB. Free memory was 85.4MB in the beginning and 85.5MB in the end (delta: -61.0kB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-06-03 22:42:59,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.35ms. Allocated memory is still 146.8MB. Free memory was 85.5MB in the beginning and 69.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-06-03 22:42:59,935 INFO L158 Benchmark]: Boogie Preprocessor took 109.82ms. Allocated memory is still 146.8MB. Free memory was 69.5MB in the beginning and 63.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-03 22:42:59,936 INFO L158 Benchmark]: RCFGBuilder took 1012.48ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 62.5MB in the beginning and 83.8MB in the end (delta: -21.3MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2024-06-03 22:42:59,936 INFO L158 Benchmark]: TraceAbstraction took 331940.39ms. Allocated memory was 216.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 82.7MB in the beginning and 638.1MB in the end (delta: -555.4MB). Peak memory consumption was 636.8MB. Max. memory is 16.1GB. [2024-06-03 22:42:59,937 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.17ms. Allocated memory is still 146.8MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 744.53ms. Allocated memory is still 146.8MB. Free memory was 85.4MB in the beginning and 85.5MB in the end (delta: -61.0kB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.35ms. Allocated memory is still 146.8MB. Free memory was 85.5MB in the beginning and 69.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.82ms. Allocated memory is still 146.8MB. Free memory was 69.5MB in the beginning and 63.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1012.48ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 62.5MB in the beginning and 83.8MB in the end (delta: -21.3MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. * TraceAbstraction took 331940.39ms. Allocated memory was 216.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 82.7MB in the beginning and 638.1MB in the end (delta: -555.4MB). Peak memory consumption was 636.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 810]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 811]: 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: 331.8s, OverallIterations: 59, TraceHistogramMax: 1, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 27.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3640 SdHoareTripleChecker+Valid, 18.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3138 mSDsluCounter, 823 SdHoareTripleChecker+Invalid, 15.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 654 mSDsCounter, 802 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21437 IncrementalHoareTripleChecker+Invalid, 22239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 802 mSolverCounterUnsat, 169 mSDtfsCounter, 21437 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 599 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 597 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=942occurred in iteration=35, 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, 2.2s SatisfiabilityAnalysisTime, 301.7s InterpolantComputationTime, 929 NumberOfCodeBlocks, 929 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 870 ConstructedInterpolants, 0 QuantifiedInterpolants, 40461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 59 InterpolantComputations, 59 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-03 22:42:59,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE