./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.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/mix012_pso.opt_tso.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/mix012_pso.opt_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix012_pso.opt_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 16:44:22,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 16:44:22,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 16:44:22,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 16:44:22,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 16:44:22,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 16:44:22,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 16:44:22,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 16:44:22,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 16:44:22,537 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 16:44:22,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 16:44:22,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 16:44:22,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 16:44:22,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 16:44:22,539 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 16:44:22,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 16:44:22,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 16:44:22,540 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 16:44:22,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 16:44:22,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 16:44:22,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 16:44:22,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 16:44:22,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 16:44:22,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 16:44:22,542 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 16:44:22,542 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 16:44:22,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 16:44:22,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 16:44:22,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 16:44:22,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 16:44:22,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 16:44:22,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 16:44:22,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:44:22,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 16:44:22,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 16:44:22,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 16:44:22,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 16:44:22,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 16:44:22,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 16:44:22,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 16:44:22,546 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 16:44:22,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 16:44:22,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 16:44:22,546 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 16:44:22,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 16:44:22,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 16:44:22,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 16:44:22,800 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 16:44:22,801 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 16:44:22,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2024-06-04 16:44:23,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 16:44:24,084 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 16:44:24,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2024-06-04 16:44:24,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78d346fb/9be1aa18baf64c0db60cae6b732f1627/FLAG439af1271 [2024-06-04 16:44:24,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78d346fb/9be1aa18baf64c0db60cae6b732f1627 [2024-06-04 16:44:24,126 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 16:44:24,127 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 16:44:24,127 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/mix012_pso.opt_tso.opt.yml/witness.yml [2024-06-04 16:44:24,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 16:44:24,259 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 16:44:24,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 16:44:24,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 16:44:24,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 16:44:24,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:44:24" (1/2) ... [2024-06-04 16:44:24,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788b3333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:44:24, skipping insertion in model container [2024-06-04 16:44:24,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:44:24" (1/2) ... [2024-06-04 16:44:24,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@38b2dbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:44:24, skipping insertion in model container [2024-06-04 16:44:24,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:44:24" (2/2) ... [2024-06-04 16:44:24,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788b3333 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24, skipping insertion in model container [2024-06-04 16:44:24,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:44:24" (2/2) ... [2024-06-04 16:44:24,267 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 16:44:24,320 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 16:44:24,321 INFO L97 edCorrectnessWitness]: Location invariant before [L825-L825] ((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$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 )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )y >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! 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 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) [2024-06-04 16:44:24,322 INFO L97 edCorrectnessWitness]: Location invariant before [L824-L824] ((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$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 )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )y >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! 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 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) [2024-06-04 16:44:24,322 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 16:44:24,323 INFO L106 edCorrectnessWitness]: ghost_update [L822-L822] multithreaded = 1; [2024-06-04 16:44:24,365 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 16:44:24,706 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:44:24,713 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 16:44:24,904 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:44:24,929 INFO L206 MainTranslator]: Completed translation [2024-06-04 16:44:24,930 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24 WrapperNode [2024-06-04 16:44:24,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 16:44:24,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 16:44:24,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 16:44:24,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 16:44:24,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24" (1/1) ... [2024-06-04 16:44:24,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24" (1/1) ... [2024-06-04 16:44:24,994 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2024-06-04 16:44:24,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 16:44:24,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 16:44:24,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 16:44:24,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 16:44:25,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24" (1/1) ... [2024-06-04 16:44:25,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24" (1/1) ... [2024-06-04 16:44:25,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24" (1/1) ... [2024-06-04 16:44:25,065 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 16:44:25,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24" (1/1) ... [2024-06-04 16:44:25,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24" (1/1) ... [2024-06-04 16:44:25,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24" (1/1) ... [2024-06-04 16:44:25,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24" (1/1) ... [2024-06-04 16:44:25,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24" (1/1) ... [2024-06-04 16:44:25,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24" (1/1) ... [2024-06-04 16:44:25,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 16:44:25,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 16:44:25,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 16:44:25,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 16:44:25,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24" (1/1) ... [2024-06-04 16:44:25,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:44:25,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:44:25,148 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 16:44:25,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 16:44:25,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 16:44:25,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 16:44:25,178 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 16:44:25,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 16:44:25,179 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 16:44:25,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 16:44:25,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 16:44:25,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 16:44:25,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 16:44:25,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 16:44:25,181 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 16:44:25,315 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 16:44:25,317 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 16:44:26,002 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 16:44:26,003 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 16:44:26,172 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 16:44:26,172 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 16:44:26,173 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:44:26 BoogieIcfgContainer [2024-06-04 16:44:26,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 16:44:26,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 16:44:26,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 16:44:26,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 16:44:26,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:44:24" (1/4) ... [2024-06-04 16:44:26,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60218afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:44:26, skipping insertion in model container [2024-06-04 16:44:26,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:44:24" (2/4) ... [2024-06-04 16:44:26,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60218afa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:44:26, skipping insertion in model container [2024-06-04 16:44:26,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:44:24" (3/4) ... [2024-06-04 16:44:26,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60218afa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:44:26, skipping insertion in model container [2024-06-04 16:44:26,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:44:26" (4/4) ... [2024-06-04 16:44:26,185 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt_tso.opt.i [2024-06-04 16:44:26,198 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 16:44:26,198 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 16:44:26,198 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 16:44:26,270 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 16:44:26,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-04 16:44:26,328 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-04 16:44:26,328 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:44:26,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 16:44:26,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-04 16:44:26,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-04 16:44:26,388 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:44:26,394 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;@a8ef3b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:44:26,395 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:44:26,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:44:26,400 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 16:44:26,400 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:44:26,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:26,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 16:44:26,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:26,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:26,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1928007687, now seen corresponding path program 1 times [2024-06-04 16:44:26,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:26,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956092540] [2024-06-04 16:44:26,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:26,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:29,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:29,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956092540] [2024-06-04 16:44:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956092540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:29,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:29,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:44:29,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664800809] [2024-06-04 16:44:29,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:29,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:44:29,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:29,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:44:29,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:44:29,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-04 16:44:29,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:29,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:29,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-04 16:44:29,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:29,793 INFO L124 PetriNetUnfolderBase]: 131/259 cut-off events. [2024-06-04 16:44:29,794 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-04 16:44:29,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 259 events. 131/259 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 969 event pairs, 75 based on Foata normal form. 1/250 useless extension candidates. Maximal degree in co-relation 503. Up to 235 conditions per place. [2024-06-04 16:44:29,798 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 22 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-04 16:44:29,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 117 flow [2024-06-04 16:44:29,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:44:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:44:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-06-04 16:44:29,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-06-04 16:44:29,808 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 54 transitions. [2024-06-04 16:44:29,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 117 flow [2024-06-04 16:44:29,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:44:29,811 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-04 16:44:29,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-04 16:44:29,815 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-04 16:44:29,815 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-04 16:44:29,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:29,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:29,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:29,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 16:44:29,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:29,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:29,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1684465704, now seen corresponding path program 1 times [2024-06-04 16:44:29,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:29,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493742939] [2024-06-04 16:44:29,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:29,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:31,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:31,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493742939] [2024-06-04 16:44:31,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493742939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:31,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:31,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:44:31,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430936822] [2024-06-04 16:44:31,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:31,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:44:31,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:31,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:44:31,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:44:31,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 16:44:31,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:31,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:31,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 16:44:31,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:31,934 INFO L124 PetriNetUnfolderBase]: 150/281 cut-off events. [2024-06-04 16:44:31,935 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-04 16:44:31,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 281 events. 150/281 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1001 event pairs, 68 based on Foata normal form. 2/283 useless extension candidates. Maximal degree in co-relation 636. Up to 258 conditions per place. [2024-06-04 16:44:31,940 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 27 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-04 16:44:31,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 161 flow [2024-06-04 16:44:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:44:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:44:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2024-06-04 16:44:31,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-06-04 16:44:31,944 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 66 transitions. [2024-06-04 16:44:31,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 161 flow [2024-06-04 16:44:31,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:44:31,947 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-04 16:44:31,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-04 16:44:31,948 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-04 16:44:31,948 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-04 16:44:31,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:31,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:31,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:31,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 16:44:31,949 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:31,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:31,952 INFO L85 PathProgramCache]: Analyzing trace with hash -678828682, now seen corresponding path program 1 times [2024-06-04 16:44:31,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:31,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125760113] [2024-06-04 16:44:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:31,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:34,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:34,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125760113] [2024-06-04 16:44:34,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125760113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:34,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:34,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:44:34,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463522696] [2024-06-04 16:44:34,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:34,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:44:34,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:34,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:44:34,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:44:34,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 16:44:34,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:34,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:34,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 16:44:34,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:34,736 INFO L124 PetriNetUnfolderBase]: 147/276 cut-off events. [2024-06-04 16:44:34,736 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2024-06-04 16:44:34,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 276 events. 147/276 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 978 event pairs, 47 based on Foata normal form. 2/278 useless extension candidates. Maximal degree in co-relation 697. Up to 244 conditions per place. [2024-06-04 16:44:34,738 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 31 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2024-06-04 16:44:34,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 209 flow [2024-06-04 16:44:34,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:44:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:44:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-06-04 16:44:34,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-06-04 16:44:34,742 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 80 transitions. [2024-06-04 16:44:34,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 209 flow [2024-06-04 16:44:34,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 16:44:34,745 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 119 flow [2024-06-04 16:44:34,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-06-04 16:44:34,747 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-04 16:44:34,747 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 119 flow [2024-06-04 16:44:34,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:34,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:34,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:34,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 16:44:34,748 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:34,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:34,748 INFO L85 PathProgramCache]: Analyzing trace with hash 480685493, now seen corresponding path program 1 times [2024-06-04 16:44:34,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:34,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794205419] [2024-06-04 16:44:34,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:34,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:37,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:37,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794205419] [2024-06-04 16:44:37,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794205419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:37,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:37,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:44:37,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017919870] [2024-06-04 16:44:37,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:37,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:44:37,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:37,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:44:37,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:44:37,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 16:44:37,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:37,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:37,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 16:44:37,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:37,932 INFO L124 PetriNetUnfolderBase]: 143/268 cut-off events. [2024-06-04 16:44:37,932 INFO L125 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2024-06-04 16:44:37,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 268 events. 143/268 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 920 event pairs, 25 based on Foata normal form. 4/272 useless extension candidates. Maximal degree in co-relation 738. Up to 218 conditions per place. [2024-06-04 16:44:37,934 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 31 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2024-06-04 16:44:37,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 223 flow [2024-06-04 16:44:37,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:44:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:44:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2024-06-04 16:44:37,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478494623655914 [2024-06-04 16:44:37,938 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 119 flow. Second operand 6 states and 89 transitions. [2024-06-04 16:44:37,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 223 flow [2024-06-04 16:44:37,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 208 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 16:44:37,941 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 116 flow [2024-06-04 16:44:37,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2024-06-04 16:44:37,942 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-04 16:44:37,942 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 116 flow [2024-06-04 16:44:37,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:37,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:37,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:37,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 16:44:37,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:37,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:37,943 INFO L85 PathProgramCache]: Analyzing trace with hash 348982451, now seen corresponding path program 1 times [2024-06-04 16:44:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:37,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446284162] [2024-06-04 16:44:37,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:37,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:40,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446284162] [2024-06-04 16:44:40,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446284162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:40,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:40,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:44:40,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157655490] [2024-06-04 16:44:40,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:40,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:44:40,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:40,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:44:40,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:44:40,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 16:44:40,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:40,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:40,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 16:44:40,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:41,064 INFO L124 PetriNetUnfolderBase]: 119/238 cut-off events. [2024-06-04 16:44:41,065 INFO L125 PetriNetUnfolderBase]: For 402/402 co-relation queries the response was YES. [2024-06-04 16:44:41,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 238 events. 119/238 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 867 event pairs, 63 based on Foata normal form. 1/238 useless extension candidates. Maximal degree in co-relation 673. Up to 211 conditions per place. [2024-06-04 16:44:41,067 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 24 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2024-06-04 16:44:41,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 206 flow [2024-06-04 16:44:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:44:41,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:44:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-06-04 16:44:41,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41397849462365593 [2024-06-04 16:44:41,069 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 116 flow. Second operand 6 states and 77 transitions. [2024-06-04 16:44:41,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 206 flow [2024-06-04 16:44:41,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 184 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 16:44:41,074 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 140 flow [2024-06-04 16:44:41,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2024-06-04 16:44:41,078 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2024-06-04 16:44:41,078 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 140 flow [2024-06-04 16:44:41,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:41,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:41,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:41,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 16:44:41,080 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:41,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:41,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2066444921, now seen corresponding path program 1 times [2024-06-04 16:44:41,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:41,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492014161] [2024-06-04 16:44:41,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:41,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:44,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:44,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492014161] [2024-06-04 16:44:44,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492014161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:44,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:44,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:44:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739871106] [2024-06-04 16:44:44,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:44,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:44:44,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:44,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:44:44,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:44:45,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 16:44:45,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 140 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-04 16:44:45,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:45,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 16:44:45,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:45,307 INFO L124 PetriNetUnfolderBase]: 117/235 cut-off events. [2024-06-04 16:44:45,307 INFO L125 PetriNetUnfolderBase]: For 447/447 co-relation queries the response was YES. [2024-06-04 16:44:45,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 235 events. 117/235 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 856 event pairs, 62 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 699. Up to 205 conditions per place. [2024-06-04 16:44:45,308 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 26 selfloop transitions, 9 changer transitions 0/39 dead transitions. [2024-06-04 16:44:45,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 230 flow [2024-06-04 16:44:45,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:44:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:44:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-06-04 16:44:45,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42473118279569894 [2024-06-04 16:44:45,310 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 140 flow. Second operand 6 states and 79 transitions. [2024-06-04 16:44:45,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 230 flow [2024-06-04 16:44:45,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 217 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 16:44:45,312 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 162 flow [2024-06-04 16:44:45,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-04 16:44:45,312 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-04 16:44:45,312 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 162 flow [2024-06-04 16:44:45,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-04 16:44:45,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:45,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:45,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 16:44:45,313 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:45,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2135383716, now seen corresponding path program 1 times [2024-06-04 16:44:45,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:45,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808290107] [2024-06-04 16:44:45,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:45,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:48,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:48,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808290107] [2024-06-04 16:44:48,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808290107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:48,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:48,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:44:48,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193700107] [2024-06-04 16:44:48,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:48,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:44:48,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:48,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:44:48,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:44:48,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:44:48,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:48,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:48,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:44:48,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:48,633 INFO L124 PetriNetUnfolderBase]: 147/278 cut-off events. [2024-06-04 16:44:48,633 INFO L125 PetriNetUnfolderBase]: For 684/684 co-relation queries the response was YES. [2024-06-04 16:44:48,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 278 events. 147/278 cut-off events. For 684/684 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 998 event pairs, 63 based on Foata normal form. 2/280 useless extension candidates. Maximal degree in co-relation 901. Up to 245 conditions per place. [2024-06-04 16:44:48,635 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 34 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2024-06-04 16:44:48,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 304 flow [2024-06-04 16:44:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:44:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:44:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-04 16:44:48,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41013824884792627 [2024-06-04 16:44:48,637 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 162 flow. Second operand 7 states and 89 transitions. [2024-06-04 16:44:48,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 304 flow [2024-06-04 16:44:48,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 285 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 16:44:48,639 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 205 flow [2024-06-04 16:44:48,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-06-04 16:44:48,640 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2024-06-04 16:44:48,640 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 205 flow [2024-06-04 16:44:48,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:48,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:48,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:48,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 16:44:48,642 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:48,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:48,643 INFO L85 PathProgramCache]: Analyzing trace with hash 358996050, now seen corresponding path program 2 times [2024-06-04 16:44:48,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:48,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129991663] [2024-06-04 16:44:48,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:48,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:51,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:51,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129991663] [2024-06-04 16:44:51,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129991663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:51,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:51,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:44:51,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414022494] [2024-06-04 16:44:51,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:51,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:44:51,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:51,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:44:51,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:44:51,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:44:51,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 205 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:51,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:51,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:44:51,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:51,569 INFO L124 PetriNetUnfolderBase]: 150/283 cut-off events. [2024-06-04 16:44:51,570 INFO L125 PetriNetUnfolderBase]: For 901/901 co-relation queries the response was YES. [2024-06-04 16:44:51,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 283 events. 150/283 cut-off events. For 901/901 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1005 event pairs, 63 based on Foata normal form. 1/284 useless extension candidates. Maximal degree in co-relation 994. Up to 250 conditions per place. [2024-06-04 16:44:51,571 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 34 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2024-06-04 16:44:51,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 332 flow [2024-06-04 16:44:51,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:44:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:44:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-06-04 16:44:51,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41397849462365593 [2024-06-04 16:44:51,573 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 205 flow. Second operand 6 states and 77 transitions. [2024-06-04 16:44:51,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 332 flow [2024-06-04 16:44:51,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 304 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 16:44:51,575 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 231 flow [2024-06-04 16:44:51,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-04 16:44:51,576 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2024-06-04 16:44:51,577 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 231 flow [2024-06-04 16:44:51,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:51,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:51,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:51,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 16:44:51,577 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:51,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:51,578 INFO L85 PathProgramCache]: Analyzing trace with hash 359145780, now seen corresponding path program 3 times [2024-06-04 16:44:51,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:51,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027073757] [2024-06-04 16:44:51,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:51,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:54,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:54,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027073757] [2024-06-04 16:44:54,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027073757] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:54,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:54,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:44:54,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068823347] [2024-06-04 16:44:54,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:54,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:44:54,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:54,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:44:54,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:44:54,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:44:54,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 231 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:54,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:54,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:44:54,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:55,108 INFO L124 PetriNetUnfolderBase]: 156/297 cut-off events. [2024-06-04 16:44:55,109 INFO L125 PetriNetUnfolderBase]: For 1184/1184 co-relation queries the response was YES. [2024-06-04 16:44:55,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 297 events. 156/297 cut-off events. For 1184/1184 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1107 event pairs, 66 based on Foata normal form. 2/299 useless extension candidates. Maximal degree in co-relation 1102. Up to 244 conditions per place. [2024-06-04 16:44:55,111 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 33 selfloop transitions, 17 changer transitions 0/53 dead transitions. [2024-06-04 16:44:55,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 395 flow [2024-06-04 16:44:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:44:55,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:44:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-06-04 16:44:55,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42473118279569894 [2024-06-04 16:44:55,112 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 231 flow. Second operand 6 states and 79 transitions. [2024-06-04 16:44:55,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 395 flow [2024-06-04 16:44:55,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 372 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 16:44:55,114 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 279 flow [2024-06-04 16:44:55,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=279, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-04 16:44:55,115 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2024-06-04 16:44:55,115 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 279 flow [2024-06-04 16:44:55,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:55,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:55,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:55,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 16:44:55,116 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:55,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash -448604518, now seen corresponding path program 1 times [2024-06-04 16:44:55,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:55,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001718720] [2024-06-04 16:44:55,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:55,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:58,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:58,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001718720] [2024-06-04 16:44:58,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001718720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:58,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:58,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:44:58,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51984951] [2024-06-04 16:44:58,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:58,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:44:58,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:58,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:44:58,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:44:59,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:44:59,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 279 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:59,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:59,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:44:59,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:59,290 INFO L124 PetriNetUnfolderBase]: 163/311 cut-off events. [2024-06-04 16:44:59,291 INFO L125 PetriNetUnfolderBase]: For 1501/1501 co-relation queries the response was YES. [2024-06-04 16:44:59,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 311 events. 163/311 cut-off events. For 1501/1501 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1169 event pairs, 55 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 1221. Up to 261 conditions per place. [2024-06-04 16:44:59,293 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 44 selfloop transitions, 16 changer transitions 0/63 dead transitions. [2024-06-04 16:44:59,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 465 flow [2024-06-04 16:44:59,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:44:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:44:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-04 16:44:59,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906 [2024-06-04 16:44:59,294 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 279 flow. Second operand 8 states and 101 transitions. [2024-06-04 16:44:59,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 465 flow [2024-06-04 16:44:59,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 449 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-04 16:44:59,297 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 345 flow [2024-06-04 16:44:59,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=345, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2024-06-04 16:44:59,298 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-06-04 16:44:59,298 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 345 flow [2024-06-04 16:44:59,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:59,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:59,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:59,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 16:44:59,299 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:59,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:59,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1751018876, now seen corresponding path program 2 times [2024-06-04 16:44:59,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:59,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2451726] [2024-06-04 16:44:59,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:59,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:02,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:02,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2451726] [2024-06-04 16:45:02,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2451726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:02,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:02,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:45:02,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685379593] [2024-06-04 16:45:02,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:02,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:45:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:02,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:45:02,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:45:02,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:45:02,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 345 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:02,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:02,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:45:02,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:02,840 INFO L124 PetriNetUnfolderBase]: 170/326 cut-off events. [2024-06-04 16:45:02,840 INFO L125 PetriNetUnfolderBase]: For 1895/1895 co-relation queries the response was YES. [2024-06-04 16:45:02,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 326 events. 170/326 cut-off events. For 1895/1895 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1257 event pairs, 60 based on Foata normal form. 1/327 useless extension candidates. Maximal degree in co-relation 1378. Up to 282 conditions per place. [2024-06-04 16:45:02,843 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 49 selfloop transitions, 14 changer transitions 0/66 dead transitions. [2024-06-04 16:45:02,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 539 flow [2024-06-04 16:45:02,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:45:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:45:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-04 16:45:02,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2024-06-04 16:45:02,844 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 345 flow. Second operand 8 states and 99 transitions. [2024-06-04 16:45:02,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 539 flow [2024-06-04 16:45:02,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 66 transitions, 490 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 16:45:02,849 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 378 flow [2024-06-04 16:45:02,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=378, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-06-04 16:45:02,850 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2024-06-04 16:45:02,850 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 378 flow [2024-06-04 16:45:02,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:02,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:02,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:02,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 16:45:02,850 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:02,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:02,851 INFO L85 PathProgramCache]: Analyzing trace with hash -920208844, now seen corresponding path program 1 times [2024-06-04 16:45:02,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:02,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508449686] [2024-06-04 16:45:02,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:02,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:06,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-04 16:45:06,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:06,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508449686] [2024-06-04 16:45:06,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508449686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:06,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:06,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:45:06,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385293294] [2024-06-04 16:45:06,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:06,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:45:06,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:06,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:45:06,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:45:06,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:45:06,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 378 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:06,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:06,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:45:06,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:06,807 INFO L124 PetriNetUnfolderBase]: 176/336 cut-off events. [2024-06-04 16:45:06,807 INFO L125 PetriNetUnfolderBase]: For 2285/2285 co-relation queries the response was YES. [2024-06-04 16:45:06,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489 conditions, 336 events. 176/336 cut-off events. For 2285/2285 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1297 event pairs, 59 based on Foata normal form. 2/338 useless extension candidates. Maximal degree in co-relation 1457. Up to 288 conditions per place. [2024-06-04 16:45:06,810 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 50 selfloop transitions, 16 changer transitions 0/69 dead transitions. [2024-06-04 16:45:06,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 560 flow [2024-06-04 16:45:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:45:06,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:45:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-04 16:45:06,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-04 16:45:06,812 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 378 flow. Second operand 8 states and 100 transitions. [2024-06-04 16:45:06,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 560 flow [2024-06-04 16:45:06,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 69 transitions, 520 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 16:45:06,820 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 403 flow [2024-06-04 16:45:06,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=403, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2024-06-04 16:45:06,821 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-06-04 16:45:06,821 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 403 flow [2024-06-04 16:45:06,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:06,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:06,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:06,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 16:45:06,822 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:06,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:06,822 INFO L85 PathProgramCache]: Analyzing trace with hash 870430346, now seen corresponding path program 3 times [2024-06-04 16:45:06,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:06,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724690337] [2024-06-04 16:45:06,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:06,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:10,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:10,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724690337] [2024-06-04 16:45:10,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724690337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:10,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:10,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:45:10,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265479555] [2024-06-04 16:45:10,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:10,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:45:10,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:10,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:45:10,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:45:10,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:45:10,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 403 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:10,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:10,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:45:10,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:10,714 INFO L124 PetriNetUnfolderBase]: 174/333 cut-off events. [2024-06-04 16:45:10,714 INFO L125 PetriNetUnfolderBase]: For 2531/2531 co-relation queries the response was YES. [2024-06-04 16:45:10,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 333 events. 174/333 cut-off events. For 2531/2531 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1288 event pairs, 54 based on Foata normal form. 1/334 useless extension candidates. Maximal degree in co-relation 1503. Up to 272 conditions per place. [2024-06-04 16:45:10,717 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 46 selfloop transitions, 21 changer transitions 0/70 dead transitions. [2024-06-04 16:45:10,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 591 flow [2024-06-04 16:45:10,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:45:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:45:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-04 16:45:10,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147465437788018 [2024-06-04 16:45:10,718 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 403 flow. Second operand 7 states and 90 transitions. [2024-06-04 16:45:10,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 591 flow [2024-06-04 16:45:10,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 550 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 16:45:10,721 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 447 flow [2024-06-04 16:45:10,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=447, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2024-06-04 16:45:10,722 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2024-06-04 16:45:10,723 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 447 flow [2024-06-04 16:45:10,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:10,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:10,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:10,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 16:45:10,723 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:10,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:10,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1303968120, now seen corresponding path program 4 times [2024-06-04 16:45:10,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:10,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775745836] [2024-06-04 16:45:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:10,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:14,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:14,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775745836] [2024-06-04 16:45:14,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775745836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:14,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:14,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:45:14,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673742799] [2024-06-04 16:45:14,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:14,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:45:14,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:14,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:45:14,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:45:14,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:45:14,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 447 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:14,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:14,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:45:14,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:14,628 INFO L124 PetriNetUnfolderBase]: 172/330 cut-off events. [2024-06-04 16:45:14,628 INFO L125 PetriNetUnfolderBase]: For 2870/2870 co-relation queries the response was YES. [2024-06-04 16:45:14,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 330 events. 172/330 cut-off events. For 2870/2870 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1280 event pairs, 59 based on Foata normal form. 1/331 useless extension candidates. Maximal degree in co-relation 1540. Up to 282 conditions per place. [2024-06-04 16:45:14,630 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 49 selfloop transitions, 16 changer transitions 0/68 dead transitions. [2024-06-04 16:45:14,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 68 transitions, 597 flow [2024-06-04 16:45:14,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:45:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:45:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-04 16:45:14,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4009216589861751 [2024-06-04 16:45:14,631 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 447 flow. Second operand 7 states and 87 transitions. [2024-06-04 16:45:14,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 68 transitions, 597 flow [2024-06-04 16:45:14,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 534 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-04 16:45:14,635 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 423 flow [2024-06-04 16:45:14,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=423, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2024-06-04 16:45:14,635 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2024-06-04 16:45:14,635 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 423 flow [2024-06-04 16:45:14,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:14,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:14,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:14,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 16:45:14,636 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:14,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1303967934, now seen corresponding path program 2 times [2024-06-04 16:45:14,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:14,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962769968] [2024-06-04 16:45:14,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:14,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:18,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:18,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962769968] [2024-06-04 16:45:18,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962769968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:18,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:18,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:45:18,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172800657] [2024-06-04 16:45:18,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:18,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:45:18,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:45:18,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:45:18,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:45:18,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 423 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:18,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:18,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:45:18,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:18,651 INFO L124 PetriNetUnfolderBase]: 178/340 cut-off events. [2024-06-04 16:45:18,652 INFO L125 PetriNetUnfolderBase]: For 2387/2387 co-relation queries the response was YES. [2024-06-04 16:45:18,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 340 events. 178/340 cut-off events. For 2387/2387 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1326 event pairs, 59 based on Foata normal form. 2/342 useless extension candidates. Maximal degree in co-relation 1496. Up to 280 conditions per place. [2024-06-04 16:45:18,655 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 47 selfloop transitions, 21 changer transitions 0/71 dead transitions. [2024-06-04 16:45:18,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 603 flow [2024-06-04 16:45:18,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:45:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:45:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-04 16:45:18,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41013824884792627 [2024-06-04 16:45:18,656 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 423 flow. Second operand 7 states and 89 transitions. [2024-06-04 16:45:18,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 603 flow [2024-06-04 16:45:18,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 71 transitions, 559 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 16:45:18,660 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 463 flow [2024-06-04 16:45:18,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=463, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2024-06-04 16:45:18,661 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2024-06-04 16:45:18,661 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 463 flow [2024-06-04 16:45:18,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:18,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:18,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:18,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 16:45:18,662 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:18,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:18,662 INFO L85 PathProgramCache]: Analyzing trace with hash -662096814, now seen corresponding path program 3 times [2024-06-04 16:45:18,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:18,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230410794] [2024-06-04 16:45:18,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:22,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:22,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230410794] [2024-06-04 16:45:22,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230410794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:22,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:22,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:45:22,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094845744] [2024-06-04 16:45:22,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:22,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:45:22,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:22,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:45:22,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:45:22,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:45:22,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 463 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:22,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:22,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:45:22,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:23,021 INFO L124 PetriNetUnfolderBase]: 184/350 cut-off events. [2024-06-04 16:45:23,021 INFO L125 PetriNetUnfolderBase]: For 2884/2884 co-relation queries the response was YES. [2024-06-04 16:45:23,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1671 conditions, 350 events. 184/350 cut-off events. For 2884/2884 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1377 event pairs, 62 based on Foata normal form. 2/352 useless extension candidates. Maximal degree in co-relation 1635. Up to 287 conditions per place. [2024-06-04 16:45:23,024 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 50 selfloop transitions, 20 changer transitions 0/73 dead transitions. [2024-06-04 16:45:23,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 73 transitions, 657 flow [2024-06-04 16:45:23,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:45:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:45:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-04 16:45:23,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41013824884792627 [2024-06-04 16:45:23,025 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 463 flow. Second operand 7 states and 89 transitions. [2024-06-04 16:45:23,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 73 transitions, 657 flow [2024-06-04 16:45:23,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 73 transitions, 597 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-04 16:45:23,029 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 487 flow [2024-06-04 16:45:23,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=487, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2024-06-04 16:45:23,030 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 43 predicate places. [2024-06-04 16:45:23,030 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 487 flow [2024-06-04 16:45:23,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:23,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:23,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:23,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 16:45:23,031 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:23,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:23,031 INFO L85 PathProgramCache]: Analyzing trace with hash 995590324, now seen corresponding path program 4 times [2024-06-04 16:45:23,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:23,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431907979] [2024-06-04 16:45:23,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:23,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:27,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431907979] [2024-06-04 16:45:27,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431907979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:27,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:27,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:45:27,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185832019] [2024-06-04 16:45:27,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:27,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:45:27,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:27,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:45:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:45:27,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:45:27,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 487 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:27,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:27,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:45:27,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:27,390 INFO L124 PetriNetUnfolderBase]: 182/347 cut-off events. [2024-06-04 16:45:27,390 INFO L125 PetriNetUnfolderBase]: For 2737/2737 co-relation queries the response was YES. [2024-06-04 16:45:27,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1640 conditions, 347 events. 182/347 cut-off events. For 2737/2737 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1359 event pairs, 62 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 1603. Up to 266 conditions per place. [2024-06-04 16:45:27,392 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 45 selfloop transitions, 29 changer transitions 0/77 dead transitions. [2024-06-04 16:45:27,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 77 transitions, 685 flow [2024-06-04 16:45:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:45:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:45:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-04 16:45:27,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41013824884792627 [2024-06-04 16:45:27,394 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 487 flow. Second operand 7 states and 89 transitions. [2024-06-04 16:45:27,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 77 transitions, 685 flow [2024-06-04 16:45:27,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 77 transitions, 631 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 16:45:27,400 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 545 flow [2024-06-04 16:45:27,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=545, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2024-06-04 16:45:27,401 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2024-06-04 16:45:27,401 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 545 flow [2024-06-04 16:45:27,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:27,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:27,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:27,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 16:45:27,402 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:27,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:27,403 INFO L85 PathProgramCache]: Analyzing trace with hash 995599252, now seen corresponding path program 1 times [2024-06-04 16:45:27,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:27,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879001348] [2024-06-04 16:45:27,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:27,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:31,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:31,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879001348] [2024-06-04 16:45:31,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879001348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:31,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:31,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:45:31,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095981935] [2024-06-04 16:45:31,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:31,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:45:31,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:31,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:45:31,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:45:31,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:45:31,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 545 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:31,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:31,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:45:31,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:31,862 INFO L124 PetriNetUnfolderBase]: 180/343 cut-off events. [2024-06-04 16:45:31,863 INFO L125 PetriNetUnfolderBase]: For 3099/3099 co-relation queries the response was YES. [2024-06-04 16:45:31,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 343 events. 180/343 cut-off events. For 3099/3099 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1322 event pairs, 69 based on Foata normal form. 1/344 useless extension candidates. Maximal degree in co-relation 1666. Up to 307 conditions per place. [2024-06-04 16:45:31,866 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 63 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2024-06-04 16:45:31,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 78 transitions, 719 flow [2024-06-04 16:45:31,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:45:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:45:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-04 16:45:31,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391705069124424 [2024-06-04 16:45:31,868 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 545 flow. Second operand 7 states and 85 transitions. [2024-06-04 16:45:31,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 78 transitions, 719 flow [2024-06-04 16:45:31,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 78 transitions, 687 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-04 16:45:31,873 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 557 flow [2024-06-04 16:45:31,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=557, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2024-06-04 16:45:31,874 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2024-06-04 16:45:31,874 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 557 flow [2024-06-04 16:45:31,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:31,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:31,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:31,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 16:45:31,875 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:31,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:31,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1029714512, now seen corresponding path program 1 times [2024-06-04 16:45:31,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:31,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537062172] [2024-06-04 16:45:31,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:31,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:37,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537062172] [2024-06-04 16:45:37,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537062172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:37,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:37,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:45:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190155559] [2024-06-04 16:45:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:37,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:45:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:37,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:45:37,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:45:37,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:45:37,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 557 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:37,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:37,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:45:37,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:37,416 INFO L124 PetriNetUnfolderBase]: 183/349 cut-off events. [2024-06-04 16:45:37,416 INFO L125 PetriNetUnfolderBase]: For 3325/3325 co-relation queries the response was YES. [2024-06-04 16:45:37,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 349 events. 183/349 cut-off events. For 3325/3325 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1350 event pairs, 51 based on Foata normal form. 1/350 useless extension candidates. Maximal degree in co-relation 1745. Up to 291 conditions per place. [2024-06-04 16:45:37,419 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 64 selfloop transitions, 20 changer transitions 0/87 dead transitions. [2024-06-04 16:45:37,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 87 transitions, 781 flow [2024-06-04 16:45:37,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:45:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:45:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 16:45:37,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-04 16:45:37,420 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 557 flow. Second operand 9 states and 111 transitions. [2024-06-04 16:45:37,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 87 transitions, 781 flow [2024-06-04 16:45:37,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 87 transitions, 720 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 16:45:37,425 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 567 flow [2024-06-04 16:45:37,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=567, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2024-06-04 16:45:37,426 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2024-06-04 16:45:37,426 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 567 flow [2024-06-04 16:45:37,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:37,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:37,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:37,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 16:45:37,426 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:37,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1552988706, now seen corresponding path program 2 times [2024-06-04 16:45:37,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:37,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802657632] [2024-06-04 16:45:37,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:37,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:42,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:42,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802657632] [2024-06-04 16:45:42,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802657632] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:42,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:42,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:45:42,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024402874] [2024-06-04 16:45:42,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:42,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:45:42,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:42,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:45:42,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:45:42,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:45:42,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 567 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:42,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:42,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:45:42,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:42,501 INFO L124 PetriNetUnfolderBase]: 186/356 cut-off events. [2024-06-04 16:45:42,501 INFO L125 PetriNetUnfolderBase]: For 3795/3795 co-relation queries the response was YES. [2024-06-04 16:45:42,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 356 events. 186/356 cut-off events. For 3795/3795 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1402 event pairs, 57 based on Foata normal form. 1/357 useless extension candidates. Maximal degree in co-relation 1806. Up to 307 conditions per place. [2024-06-04 16:45:42,504 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 69 selfloop transitions, 16 changer transitions 0/88 dead transitions. [2024-06-04 16:45:42,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 88 transitions, 795 flow [2024-06-04 16:45:42,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:45:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:45:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 16:45:42,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-04 16:45:42,505 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 567 flow. Second operand 9 states and 109 transitions. [2024-06-04 16:45:42,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 88 transitions, 795 flow [2024-06-04 16:45:42,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 88 transitions, 740 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 16:45:42,510 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 579 flow [2024-06-04 16:45:42,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=579, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2024-06-04 16:45:42,511 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2024-06-04 16:45:42,511 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 579 flow [2024-06-04 16:45:42,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:42,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:42,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:42,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 16:45:42,512 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:42,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash -912034566, now seen corresponding path program 3 times [2024-06-04 16:45:42,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:42,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497776330] [2024-06-04 16:45:42,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:42,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:50,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:50,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497776330] [2024-06-04 16:45:50,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497776330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:50,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:50,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:45:50,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117352446] [2024-06-04 16:45:50,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:50,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:45:50,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:50,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:45:50,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:45:50,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:45:50,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 579 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-04 16:45:50,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:50,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:45:50,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:50,883 INFO L124 PetriNetUnfolderBase]: 189/361 cut-off events. [2024-06-04 16:45:50,884 INFO L125 PetriNetUnfolderBase]: For 4308/4308 co-relation queries the response was YES. [2024-06-04 16:45:50,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1907 conditions, 361 events. 189/361 cut-off events. For 4308/4308 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1426 event pairs, 57 based on Foata normal form. 1/362 useless extension candidates. Maximal degree in co-relation 1865. Up to 308 conditions per place. [2024-06-04 16:45:50,887 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 69 selfloop transitions, 18 changer transitions 0/90 dead transitions. [2024-06-04 16:45:50,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 90 transitions, 817 flow [2024-06-04 16:45:50,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:45:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:45:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-04 16:45:50,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36200716845878134 [2024-06-04 16:45:50,888 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 579 flow. Second operand 9 states and 101 transitions. [2024-06-04 16:45:50,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 90 transitions, 817 flow [2024-06-04 16:45:50,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 90 transitions, 766 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 16:45:50,894 INFO L231 Difference]: Finished difference. Result has 87 places, 78 transitions, 603 flow [2024-06-04 16:45:50,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=603, PETRI_PLACES=87, PETRI_TRANSITIONS=78} [2024-06-04 16:45:50,895 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-04 16:45:50,895 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 78 transitions, 603 flow [2024-06-04 16:45:50,895 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-04 16:45:50,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:50,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:50,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 16:45:50,896 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:50,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:50,897 INFO L85 PathProgramCache]: Analyzing trace with hash -912034349, now seen corresponding path program 1 times [2024-06-04 16:45:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:50,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798796678] [2024-06-04 16:45:50,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:50,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:54,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:54,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:54,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798796678] [2024-06-04 16:45:54,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798796678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:54,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:54,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:45:54,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67272012] [2024-06-04 16:45:54,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:54,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:45:54,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:54,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:45:54,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:45:54,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:45:54,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 78 transitions, 603 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:54,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:54,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:45:54,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:55,251 INFO L124 PetriNetUnfolderBase]: 195/371 cut-off events. [2024-06-04 16:45:55,252 INFO L125 PetriNetUnfolderBase]: For 4910/4910 co-relation queries the response was YES. [2024-06-04 16:45:55,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1996 conditions, 371 events. 195/371 cut-off events. For 4910/4910 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1473 event pairs, 56 based on Foata normal form. 2/373 useless extension candidates. Maximal degree in co-relation 1953. Up to 315 conditions per place. [2024-06-04 16:45:55,255 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 71 selfloop transitions, 19 changer transitions 0/93 dead transitions. [2024-06-04 16:45:55,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 853 flow [2024-06-04 16:45:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:45:55,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:45:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 16:45:55,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-04 16:45:55,257 INFO L175 Difference]: Start difference. First operand has 87 places, 78 transitions, 603 flow. Second operand 9 states and 111 transitions. [2024-06-04 16:45:55,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 853 flow [2024-06-04 16:45:55,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 93 transitions, 794 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-04 16:45:55,264 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 630 flow [2024-06-04 16:45:55,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=630, PETRI_PLACES=89, PETRI_TRANSITIONS=81} [2024-06-04 16:45:55,264 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2024-06-04 16:45:55,264 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 630 flow [2024-06-04 16:45:55,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:55,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:55,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:55,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 16:45:55,265 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:55,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:55,265 INFO L85 PathProgramCache]: Analyzing trace with hash 591726602, now seen corresponding path program 4 times [2024-06-04 16:45:55,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:55,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160389642] [2024-06-04 16:45:55,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:55,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:59,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:59,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160389642] [2024-06-04 16:45:59,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160389642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:59,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:59,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:45:59,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267650512] [2024-06-04 16:45:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:59,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:45:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:59,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:45:59,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:45:59,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:45:59,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 630 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:59,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:59,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:45:59,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:00,335 INFO L124 PetriNetUnfolderBase]: 198/378 cut-off events. [2024-06-04 16:46:00,335 INFO L125 PetriNetUnfolderBase]: For 5269/5269 co-relation queries the response was YES. [2024-06-04 16:46:00,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2093 conditions, 378 events. 198/378 cut-off events. For 5269/5269 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1511 event pairs, 50 based on Foata normal form. 1/379 useless extension candidates. Maximal degree in co-relation 2049. Up to 304 conditions per place. [2024-06-04 16:46:00,339 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 64 selfloop transitions, 27 changer transitions 0/94 dead transitions. [2024-06-04 16:46:00,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 94 transitions, 876 flow [2024-06-04 16:46:00,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:46:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:46:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-04 16:46:00,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-04 16:46:00,341 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 630 flow. Second operand 8 states and 100 transitions. [2024-06-04 16:46:00,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 94 transitions, 876 flow [2024-06-04 16:46:00,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 94 transitions, 812 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 16:46:00,348 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 671 flow [2024-06-04 16:46:00,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=671, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2024-06-04 16:46:00,349 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2024-06-04 16:46:00,349 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 671 flow [2024-06-04 16:46:00,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:00,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:00,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:00,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 16:46:00,350 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:00,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:00,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1900307309, now seen corresponding path program 2 times [2024-06-04 16:46:00,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:00,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957923980] [2024-06-04 16:46:00,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:00,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:04,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:04,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957923980] [2024-06-04 16:46:04,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957923980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:04,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:04,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:46:04,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562319758] [2024-06-04 16:46:04,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:04,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:46:04,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:04,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:46:04,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:46:04,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:46:04,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 671 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:04,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:04,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:46:04,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:05,115 INFO L124 PetriNetUnfolderBase]: 210/398 cut-off events. [2024-06-04 16:46:05,115 INFO L125 PetriNetUnfolderBase]: For 6729/6729 co-relation queries the response was YES. [2024-06-04 16:46:05,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 398 events. 210/398 cut-off events. For 6729/6729 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1619 event pairs, 56 based on Foata normal form. 4/402 useless extension candidates. Maximal degree in co-relation 2218. Up to 312 conditions per place. [2024-06-04 16:46:05,120 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 67 selfloop transitions, 26 changer transitions 0/96 dead transitions. [2024-06-04 16:46:05,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 927 flow [2024-06-04 16:46:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:46:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:46:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-04 16:46:05,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906 [2024-06-04 16:46:05,122 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 671 flow. Second operand 8 states and 101 transitions. [2024-06-04 16:46:05,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 927 flow [2024-06-04 16:46:05,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 842 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-04 16:46:05,132 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 695 flow [2024-06-04 16:46:05,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=695, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2024-06-04 16:46:05,132 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 62 predicate places. [2024-06-04 16:46:05,133 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 695 flow [2024-06-04 16:46:05,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:05,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:05,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:05,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 16:46:05,133 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:05,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:05,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1397851736, now seen corresponding path program 5 times [2024-06-04 16:46:05,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:05,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147010573] [2024-06-04 16:46:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:05,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:10,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:10,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147010573] [2024-06-04 16:46:10,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147010573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:10,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:10,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:46:10,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937297653] [2024-06-04 16:46:10,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:10,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:46:10,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:10,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:46:10,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:46:10,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:46:10,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 695 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:10,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:10,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:46:10,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:11,207 INFO L124 PetriNetUnfolderBase]: 213/405 cut-off events. [2024-06-04 16:46:11,207 INFO L125 PetriNetUnfolderBase]: For 5527/5527 co-relation queries the response was YES. [2024-06-04 16:46:11,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 405 events. 213/405 cut-off events. For 5527/5527 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1663 event pairs, 56 based on Foata normal form. 1/406 useless extension candidates. Maximal degree in co-relation 2223. Up to 333 conditions per place. [2024-06-04 16:46:11,211 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 69 selfloop transitions, 26 changer transitions 0/98 dead transitions. [2024-06-04 16:46:11,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 98 transitions, 943 flow [2024-06-04 16:46:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:46:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:46:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-04 16:46:11,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 16:46:11,212 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 695 flow. Second operand 9 states and 108 transitions. [2024-06-04 16:46:11,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 98 transitions, 943 flow [2024-06-04 16:46:11,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 870 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-04 16:46:11,219 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 720 flow [2024-06-04 16:46:11,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=720, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-06-04 16:46:11,220 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2024-06-04 16:46:11,220 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 720 flow [2024-06-04 16:46:11,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:11,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:11,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:11,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 16:46:11,221 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:11,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash 791178339, now seen corresponding path program 3 times [2024-06-04 16:46:11,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:11,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344913014] [2024-06-04 16:46:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:11,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:15,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:15,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344913014] [2024-06-04 16:46:15,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344913014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:15,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:15,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:46:15,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838496140] [2024-06-04 16:46:15,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:15,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:46:15,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:15,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:46:15,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:46:15,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:46:15,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 720 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:15,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:15,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:46:15,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:15,518 INFO L124 PetriNetUnfolderBase]: 225/425 cut-off events. [2024-06-04 16:46:15,519 INFO L125 PetriNetUnfolderBase]: For 6746/6746 co-relation queries the response was YES. [2024-06-04 16:46:15,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 425 events. 225/425 cut-off events. For 6746/6746 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1753 event pairs, 58 based on Foata normal form. 4/429 useless extension candidates. Maximal degree in co-relation 2354. Up to 344 conditions per place. [2024-06-04 16:46:15,522 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 74 selfloop transitions, 23 changer transitions 0/100 dead transitions. [2024-06-04 16:46:15,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 100 transitions, 998 flow [2024-06-04 16:46:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:46:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:46:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-04 16:46:15,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906 [2024-06-04 16:46:15,523 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 720 flow. Second operand 8 states and 101 transitions. [2024-06-04 16:46:15,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 100 transitions, 998 flow [2024-06-04 16:46:15,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 100 transitions, 918 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-04 16:46:15,531 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 744 flow [2024-06-04 16:46:15,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=744, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2024-06-04 16:46:15,532 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2024-06-04 16:46:15,532 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 744 flow [2024-06-04 16:46:15,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:15,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:15,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:15,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 16:46:15,532 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:15,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash 791178122, now seen corresponding path program 6 times [2024-06-04 16:46:15,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:15,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460708378] [2024-06-04 16:46:15,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:15,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:20,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:20,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460708378] [2024-06-04 16:46:20,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460708378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:20,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:20,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:46:20,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598301083] [2024-06-04 16:46:20,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:20,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:46:20,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:20,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:46:20,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:46:20,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:46:20,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 744 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:20,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:20,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:46:20,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:20,852 INFO L124 PetriNetUnfolderBase]: 228/432 cut-off events. [2024-06-04 16:46:20,852 INFO L125 PetriNetUnfolderBase]: For 6251/6251 co-relation queries the response was YES. [2024-06-04 16:46:20,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 432 events. 228/432 cut-off events. For 6251/6251 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1801 event pairs, 58 based on Foata normal form. 1/433 useless extension candidates. Maximal degree in co-relation 2398. Up to 358 conditions per place. [2024-06-04 16:46:20,855 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 76 selfloop transitions, 22 changer transitions 0/101 dead transitions. [2024-06-04 16:46:20,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 101 transitions, 1010 flow [2024-06-04 16:46:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:46:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:46:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-04 16:46:20,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2024-06-04 16:46:20,857 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 744 flow. Second operand 8 states and 99 transitions. [2024-06-04 16:46:20,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 101 transitions, 1010 flow [2024-06-04 16:46:20,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 934 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-04 16:46:20,864 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 757 flow [2024-06-04 16:46:20,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=757, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2024-06-04 16:46:20,865 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 68 predicate places. [2024-06-04 16:46:20,865 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 757 flow [2024-06-04 16:46:20,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:20,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:20,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:20,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 16:46:20,866 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:20,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1541951733, now seen corresponding path program 4 times [2024-06-04 16:46:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:20,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647163950] [2024-06-04 16:46:20,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:20,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:25,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:25,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647163950] [2024-06-04 16:46:25,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647163950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:25,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:25,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:46:25,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644155652] [2024-06-04 16:46:25,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:25,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:46:25,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:25,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:46:25,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:46:25,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:46:25,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 757 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:25,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:25,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:46:25,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:26,286 INFO L124 PetriNetUnfolderBase]: 231/436 cut-off events. [2024-06-04 16:46:26,286 INFO L125 PetriNetUnfolderBase]: For 6631/6631 co-relation queries the response was YES. [2024-06-04 16:46:26,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 436 events. 231/436 cut-off events. For 6631/6631 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1820 event pairs, 70 based on Foata normal form. 1/437 useless extension candidates. Maximal degree in co-relation 2406. Up to 392 conditions per place. [2024-06-04 16:46:26,290 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 86 selfloop transitions, 13 changer transitions 0/102 dead transitions. [2024-06-04 16:46:26,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 102 transitions, 995 flow [2024-06-04 16:46:26,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:46:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:46:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-04 16:46:26,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-04 16:46:26,291 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 757 flow. Second operand 8 states and 94 transitions. [2024-06-04 16:46:26,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 102 transitions, 995 flow [2024-06-04 16:46:26,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 102 transitions, 922 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-04 16:46:26,299 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 743 flow [2024-06-04 16:46:26,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=743, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2024-06-04 16:46:26,304 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 70 predicate places. [2024-06-04 16:46:26,305 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 743 flow [2024-06-04 16:46:26,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:26,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:26,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:26,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 16:46:26,305 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:26,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:26,306 INFO L85 PathProgramCache]: Analyzing trace with hash 950037856, now seen corresponding path program 7 times [2024-06-04 16:46:26,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:26,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339613169] [2024-06-04 16:46:26,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:26,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:32,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:32,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339613169] [2024-06-04 16:46:32,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339613169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:32,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:32,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:46:32,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655081388] [2024-06-04 16:46:32,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:32,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:46:32,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:32,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:46:32,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:46:32,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:46:32,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 743 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:32,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:32,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:46:32,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:32,445 INFO L124 PetriNetUnfolderBase]: 229/434 cut-off events. [2024-06-04 16:46:32,446 INFO L125 PetriNetUnfolderBase]: For 6709/6709 co-relation queries the response was YES. [2024-06-04 16:46:32,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2417 conditions, 434 events. 229/434 cut-off events. For 6709/6709 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1810 event pairs, 59 based on Foata normal form. 1/435 useless extension candidates. Maximal degree in co-relation 2367. Up to 333 conditions per place. [2024-06-04 16:46:32,449 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 67 selfloop transitions, 38 changer transitions 0/108 dead transitions. [2024-06-04 16:46:32,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 108 transitions, 1042 flow [2024-06-04 16:46:32,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:46:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:46:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 16:46:32,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 16:46:32,451 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 743 flow. Second operand 10 states and 120 transitions. [2024-06-04 16:46:32,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 108 transitions, 1042 flow [2024-06-04 16:46:32,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 108 transitions, 998 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 16:46:32,460 INFO L231 Difference]: Finished difference. Result has 105 places, 99 transitions, 861 flow [2024-06-04 16:46:32,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=861, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2024-06-04 16:46:32,462 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 75 predicate places. [2024-06-04 16:46:32,462 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 861 flow [2024-06-04 16:46:32,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:32,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:32,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:32,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 16:46:32,463 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:32,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash 798529989, now seen corresponding path program 5 times [2024-06-04 16:46:32,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:32,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34511748] [2024-06-04 16:46:32,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:32,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:36,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:36,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34511748] [2024-06-04 16:46:36,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34511748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:36,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:36,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:46:36,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522894845] [2024-06-04 16:46:36,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:36,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:46:36,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:36,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:46:36,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:46:36,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:46:36,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 861 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:36,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:36,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:46:36,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:36,829 INFO L124 PetriNetUnfolderBase]: 230/436 cut-off events. [2024-06-04 16:46:36,831 INFO L125 PetriNetUnfolderBase]: For 7495/7495 co-relation queries the response was YES. [2024-06-04 16:46:36,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 436 events. 230/436 cut-off events. For 7495/7495 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1824 event pairs, 58 based on Foata normal form. 2/438 useless extension candidates. Maximal degree in co-relation 2466. Up to 292 conditions per place. [2024-06-04 16:46:36,843 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 68 selfloop transitions, 42 changer transitions 0/113 dead transitions. [2024-06-04 16:46:36,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 113 transitions, 1221 flow [2024-06-04 16:46:36,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:46:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:46:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-04 16:46:36,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42338709677419356 [2024-06-04 16:46:36,846 INFO L175 Difference]: Start difference. First operand has 105 places, 99 transitions, 861 flow. Second operand 8 states and 105 transitions. [2024-06-04 16:46:36,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 113 transitions, 1221 flow [2024-06-04 16:46:36,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 113 transitions, 1091 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-04 16:46:36,872 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 886 flow [2024-06-04 16:46:36,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=886, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2024-06-04 16:46:36,873 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2024-06-04 16:46:36,873 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 886 flow [2024-06-04 16:46:36,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:36,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:36,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:36,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 16:46:36,874 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:36,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:36,875 INFO L85 PathProgramCache]: Analyzing trace with hash 798806819, now seen corresponding path program 1 times [2024-06-04 16:46:36,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:36,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414200396] [2024-06-04 16:46:36,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:36,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:41,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:41,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414200396] [2024-06-04 16:46:41,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414200396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:41,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:41,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:46:41,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178425201] [2024-06-04 16:46:41,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:41,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:46:41,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:41,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:46:41,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:46:41,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:46:41,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 886 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:41,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:41,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:46:41,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:41,402 INFO L124 PetriNetUnfolderBase]: 227/430 cut-off events. [2024-06-04 16:46:41,402 INFO L125 PetriNetUnfolderBase]: For 6885/6885 co-relation queries the response was YES. [2024-06-04 16:46:41,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2427 conditions, 430 events. 227/430 cut-off events. For 6885/6885 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1779 event pairs, 69 based on Foata normal form. 2/432 useless extension candidates. Maximal degree in co-relation 2374. Up to 380 conditions per place. [2024-06-04 16:46:41,405 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 95 selfloop transitions, 13 changer transitions 0/111 dead transitions. [2024-06-04 16:46:41,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 111 transitions, 1120 flow [2024-06-04 16:46:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:46:41,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:46:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-04 16:46:41,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-04 16:46:41,411 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 886 flow. Second operand 8 states and 94 transitions. [2024-06-04 16:46:41,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 111 transitions, 1120 flow [2024-06-04 16:46:41,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 111 transitions, 1045 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-04 16:46:41,421 INFO L231 Difference]: Finished difference. Result has 109 places, 103 transitions, 841 flow [2024-06-04 16:46:41,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=841, PETRI_PLACES=109, PETRI_TRANSITIONS=103} [2024-06-04 16:46:41,421 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 79 predicate places. [2024-06-04 16:46:41,421 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 103 transitions, 841 flow [2024-06-04 16:46:41,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:41,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:41,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:41,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 16:46:41,422 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:41,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:41,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1945037783, now seen corresponding path program 1 times [2024-06-04 16:46:41,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:41,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813683765] [2024-06-04 16:46:41,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:41,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:45,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:45,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813683765] [2024-06-04 16:46:45,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813683765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:45,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:45,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:46:45,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016816723] [2024-06-04 16:46:45,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:45,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:46:45,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:45,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:46:45,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:46:45,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:46:45,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 103 transitions, 841 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:45,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:45,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:46:45,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:45,654 INFO L124 PetriNetUnfolderBase]: 236/452 cut-off events. [2024-06-04 16:46:45,654 INFO L125 PetriNetUnfolderBase]: For 7105/7105 co-relation queries the response was YES. [2024-06-04 16:46:45,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2474 conditions, 452 events. 236/452 cut-off events. For 7105/7105 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1953 event pairs, 45 based on Foata normal form. 2/454 useless extension candidates. Maximal degree in co-relation 2420. Up to 372 conditions per place. [2024-06-04 16:46:45,657 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 100 selfloop transitions, 18 changer transitions 0/121 dead transitions. [2024-06-04 16:46:45,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 121 transitions, 1135 flow [2024-06-04 16:46:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:46:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:46:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-04 16:46:45,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4014336917562724 [2024-06-04 16:46:45,659 INFO L175 Difference]: Start difference. First operand has 109 places, 103 transitions, 841 flow. Second operand 9 states and 112 transitions. [2024-06-04 16:46:45,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 121 transitions, 1135 flow [2024-06-04 16:46:45,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 121 transitions, 1103 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 16:46:45,668 INFO L231 Difference]: Finished difference. Result has 113 places, 105 transitions, 871 flow [2024-06-04 16:46:45,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=871, PETRI_PLACES=113, PETRI_TRANSITIONS=105} [2024-06-04 16:46:45,669 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places. [2024-06-04 16:46:45,670 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 105 transitions, 871 flow [2024-06-04 16:46:45,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:45,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:45,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:45,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 16:46:45,670 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:45,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:45,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1856382743, now seen corresponding path program 2 times [2024-06-04 16:46:45,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:45,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180275497] [2024-06-04 16:46:45,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:45,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:49,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-04 16:46:49,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180275497] [2024-06-04 16:46:49,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180275497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:49,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:49,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:46:49,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085954810] [2024-06-04 16:46:49,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:49,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:46:49,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:49,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:46:49,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:46:49,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:46:49,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 105 transitions, 871 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:49,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:49,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:46:49,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:50,169 INFO L124 PetriNetUnfolderBase]: 240/460 cut-off events. [2024-06-04 16:46:50,170 INFO L125 PetriNetUnfolderBase]: For 7491/7491 co-relation queries the response was YES. [2024-06-04 16:46:50,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 460 events. 240/460 cut-off events. For 7491/7491 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2007 event pairs, 54 based on Foata normal form. 2/462 useless extension candidates. Maximal degree in co-relation 2503. Up to 389 conditions per place. [2024-06-04 16:46:50,173 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 98 selfloop transitions, 19 changer transitions 0/120 dead transitions. [2024-06-04 16:46:50,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 1155 flow [2024-06-04 16:46:50,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:46:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:46:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 16:46:50,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-04 16:46:50,175 INFO L175 Difference]: Start difference. First operand has 113 places, 105 transitions, 871 flow. Second operand 9 states and 111 transitions. [2024-06-04 16:46:50,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 120 transitions, 1155 flow [2024-06-04 16:46:50,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 120 transitions, 1113 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 16:46:50,186 INFO L231 Difference]: Finished difference. Result has 116 places, 106 transitions, 887 flow [2024-06-04 16:46:50,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=887, PETRI_PLACES=116, PETRI_TRANSITIONS=106} [2024-06-04 16:46:50,186 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 86 predicate places. [2024-06-04 16:46:50,186 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 106 transitions, 887 flow [2024-06-04 16:46:50,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:50,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:50,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:50,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 16:46:50,187 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:50,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:50,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1391671797, now seen corresponding path program 3 times [2024-06-04 16:46:50,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:50,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186444600] [2024-06-04 16:46:50,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:50,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:54,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:54,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186444600] [2024-06-04 16:46:54,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186444600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:54,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:54,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:46:54,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514251431] [2024-06-04 16:46:54,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:54,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:46:54,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:54,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:46:54,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:46:54,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:46:54,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 106 transitions, 887 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:54,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:54,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:46:54,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:54,484 INFO L124 PetriNetUnfolderBase]: 249/479 cut-off events. [2024-06-04 16:46:54,485 INFO L125 PetriNetUnfolderBase]: For 8248/8248 co-relation queries the response was YES. [2024-06-04 16:46:54,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2654 conditions, 479 events. 249/479 cut-off events. For 8248/8248 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2149 event pairs, 29 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 2597. Up to 371 conditions per place. [2024-06-04 16:46:54,487 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 101 selfloop transitions, 20 changer transitions 0/124 dead transitions. [2024-06-04 16:46:54,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 124 transitions, 1191 flow [2024-06-04 16:46:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:46:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:46:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-04 16:46:54,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-04 16:46:54,489 INFO L175 Difference]: Start difference. First operand has 116 places, 106 transitions, 887 flow. Second operand 9 states and 110 transitions. [2024-06-04 16:46:54,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 124 transitions, 1191 flow [2024-06-04 16:46:54,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 124 transitions, 1143 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 16:46:54,500 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 907 flow [2024-06-04 16:46:54,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=907, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2024-06-04 16:46:54,500 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2024-06-04 16:46:54,500 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 907 flow [2024-06-04 16:46:54,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:54,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:54,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:54,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 16:46:54,501 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:54,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:54,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1856377783, now seen corresponding path program 1 times [2024-06-04 16:46:54,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:54,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634401088] [2024-06-04 16:46:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:54,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:00,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:00,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634401088] [2024-06-04 16:47:00,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634401088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:00,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:00,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:47:00,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019475452] [2024-06-04 16:47:00,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:00,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:47:00,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:00,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:47:00,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:47:00,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:47:00,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 907 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:00,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:00,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:47:00,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:00,670 INFO L124 PetriNetUnfolderBase]: 255/489 cut-off events. [2024-06-04 16:47:00,670 INFO L125 PetriNetUnfolderBase]: For 8959/8959 co-relation queries the response was YES. [2024-06-04 16:47:00,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2753 conditions, 489 events. 255/489 cut-off events. For 8959/8959 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2189 event pairs, 53 based on Foata normal form. 2/491 useless extension candidates. Maximal degree in co-relation 2695. Up to 415 conditions per place. [2024-06-04 16:47:00,674 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 100 selfloop transitions, 22 changer transitions 0/125 dead transitions. [2024-06-04 16:47:00,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 125 transitions, 1231 flow [2024-06-04 16:47:00,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:47:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:47:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 16:47:00,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-04 16:47:00,675 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 907 flow. Second operand 10 states and 122 transitions. [2024-06-04 16:47:00,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 125 transitions, 1231 flow [2024-06-04 16:47:00,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 125 transitions, 1158 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-04 16:47:00,688 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 923 flow [2024-06-04 16:47:00,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=923, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2024-06-04 16:47:00,689 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2024-06-04 16:47:00,689 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 923 flow [2024-06-04 16:47:00,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:00,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:00,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:00,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 16:47:00,690 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:00,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:00,690 INFO L85 PathProgramCache]: Analyzing trace with hash -900870533, now seen corresponding path program 4 times [2024-06-04 16:47:00,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:00,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374540748] [2024-06-04 16:47:00,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:00,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:04,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:04,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374540748] [2024-06-04 16:47:04,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374540748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:04,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:04,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:47:04,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985291096] [2024-06-04 16:47:04,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:04,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:47:04,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:04,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:47:04,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:47:04,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:47:04,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 923 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:04,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:04,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:47:04,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:04,797 INFO L124 PetriNetUnfolderBase]: 264/508 cut-off events. [2024-06-04 16:47:04,797 INFO L125 PetriNetUnfolderBase]: For 9516/9516 co-relation queries the response was YES. [2024-06-04 16:47:04,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 508 events. 264/508 cut-off events. For 9516/9516 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2325 event pairs, 60 based on Foata normal form. 2/510 useless extension candidates. Maximal degree in co-relation 2764. Up to 439 conditions per place. [2024-06-04 16:47:04,800 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 110 selfloop transitions, 14 changer transitions 0/127 dead transitions. [2024-06-04 16:47:04,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 127 transitions, 1235 flow [2024-06-04 16:47:04,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:47:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:47:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-04 16:47:04,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-04 16:47:04,814 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 923 flow. Second operand 9 states and 110 transitions. [2024-06-04 16:47:04,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 127 transitions, 1235 flow [2024-06-04 16:47:04,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 127 transitions, 1164 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 16:47:04,830 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 914 flow [2024-06-04 16:47:04,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=914, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2024-06-04 16:47:04,830 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 91 predicate places. [2024-06-04 16:47:04,830 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 914 flow [2024-06-04 16:47:04,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:04,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:04,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:04,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 16:47:04,831 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:04,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash -898013573, now seen corresponding path program 5 times [2024-06-04 16:47:04,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:04,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264698490] [2024-06-04 16:47:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:08,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:08,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264698490] [2024-06-04 16:47:08,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264698490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:08,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:08,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:47:08,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113583291] [2024-06-04 16:47:08,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:08,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:47:08,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:08,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:47:08,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:47:08,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:47:08,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 914 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:08,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:08,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:47:08,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:09,058 INFO L124 PetriNetUnfolderBase]: 268/516 cut-off events. [2024-06-04 16:47:09,059 INFO L125 PetriNetUnfolderBase]: For 10084/10084 co-relation queries the response was YES. [2024-06-04 16:47:09,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 516 events. 268/516 cut-off events. For 10084/10084 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2404 event pairs, 62 based on Foata normal form. 2/518 useless extension candidates. Maximal degree in co-relation 2785. Up to 456 conditions per place. [2024-06-04 16:47:09,063 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 108 selfloop transitions, 15 changer transitions 0/126 dead transitions. [2024-06-04 16:47:09,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 126 transitions, 1214 flow [2024-06-04 16:47:09,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:47:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:47:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 16:47:09,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-04 16:47:09,065 INFO L175 Difference]: Start difference. First operand has 121 places, 112 transitions, 914 flow. Second operand 9 states and 109 transitions. [2024-06-04 16:47:09,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 126 transitions, 1214 flow [2024-06-04 16:47:09,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 126 transitions, 1172 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 16:47:09,082 INFO L231 Difference]: Finished difference. Result has 124 places, 113 transitions, 928 flow [2024-06-04 16:47:09,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=928, PETRI_PLACES=124, PETRI_TRANSITIONS=113} [2024-06-04 16:47:09,083 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 94 predicate places. [2024-06-04 16:47:09,083 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 113 transitions, 928 flow [2024-06-04 16:47:09,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:09,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:09,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:09,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 16:47:09,083 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:09,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1791522603, now seen corresponding path program 6 times [2024-06-04 16:47:09,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:09,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887982343] [2024-06-04 16:47:09,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:09,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:13,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:13,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887982343] [2024-06-04 16:47:13,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887982343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:13,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:13,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:47:13,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253967772] [2024-06-04 16:47:13,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:13,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:47:13,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:47:13,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:47:13,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:47:13,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 113 transitions, 928 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:13,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:13,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:47:13,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:13,472 INFO L124 PetriNetUnfolderBase]: 272/524 cut-off events. [2024-06-04 16:47:13,473 INFO L125 PetriNetUnfolderBase]: For 10761/10761 co-relation queries the response was YES. [2024-06-04 16:47:13,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2900 conditions, 524 events. 272/524 cut-off events. For 10761/10761 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2439 event pairs, 64 based on Foata normal form. 2/526 useless extension candidates. Maximal degree in co-relation 2841. Up to 466 conditions per place. [2024-06-04 16:47:13,477 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 109 selfloop transitions, 15 changer transitions 0/127 dead transitions. [2024-06-04 16:47:13,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 127 transitions, 1234 flow [2024-06-04 16:47:13,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:47:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:47:13,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-04 16:47:13,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 16:47:13,479 INFO L175 Difference]: Start difference. First operand has 124 places, 113 transitions, 928 flow. Second operand 9 states and 108 transitions. [2024-06-04 16:47:13,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 127 transitions, 1234 flow [2024-06-04 16:47:13,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 127 transitions, 1188 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 16:47:13,494 INFO L231 Difference]: Finished difference. Result has 127 places, 115 transitions, 951 flow [2024-06-04 16:47:13,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=951, PETRI_PLACES=127, PETRI_TRANSITIONS=115} [2024-06-04 16:47:13,495 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2024-06-04 16:47:13,495 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 115 transitions, 951 flow [2024-06-04 16:47:13,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:13,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:13,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:13,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 16:47:13,496 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:13,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:13,496 INFO L85 PathProgramCache]: Analyzing trace with hash -898008613, now seen corresponding path program 2 times [2024-06-04 16:47:13,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:13,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313117142] [2024-06-04 16:47:13,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:13,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:17,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:17,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313117142] [2024-06-04 16:47:17,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313117142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:17,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:17,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:47:17,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979715322] [2024-06-04 16:47:17,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:17,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:47:17,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:17,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:47:17,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:47:18,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:47:18,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 115 transitions, 951 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:18,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:18,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:47:18,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:18,316 INFO L124 PetriNetUnfolderBase]: 278/534 cut-off events. [2024-06-04 16:47:18,316 INFO L125 PetriNetUnfolderBase]: For 11547/11547 co-relation queries the response was YES. [2024-06-04 16:47:18,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 534 events. 278/534 cut-off events. For 11547/11547 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2490 event pairs, 64 based on Foata normal form. 2/536 useless extension candidates. Maximal degree in co-relation 2929. Up to 471 conditions per place. [2024-06-04 16:47:18,320 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 110 selfloop transitions, 18 changer transitions 0/131 dead transitions. [2024-06-04 16:47:18,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 131 transitions, 1289 flow [2024-06-04 16:47:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:47:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:47:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 16:47:18,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 16:47:18,321 INFO L175 Difference]: Start difference. First operand has 127 places, 115 transitions, 951 flow. Second operand 10 states and 120 transitions. [2024-06-04 16:47:18,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 131 transitions, 1289 flow [2024-06-04 16:47:18,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 131 transitions, 1243 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 16:47:18,337 INFO L231 Difference]: Finished difference. Result has 131 places, 117 transitions, 990 flow [2024-06-04 16:47:18,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=990, PETRI_PLACES=131, PETRI_TRANSITIONS=117} [2024-06-04 16:47:18,339 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 101 predicate places. [2024-06-04 16:47:18,340 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 117 transitions, 990 flow [2024-06-04 16:47:18,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:18,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:18,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:18,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 16:47:18,340 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:18,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:18,341 INFO L85 PathProgramCache]: Analyzing trace with hash -782544463, now seen corresponding path program 3 times [2024-06-04 16:47:18,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:18,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924552316] [2024-06-04 16:47:18,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:25,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:25,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924552316] [2024-06-04 16:47:25,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924552316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:25,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:25,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:47:25,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749835977] [2024-06-04 16:47:25,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:25,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:47:25,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:25,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:47:25,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:47:25,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:47:25,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 117 transitions, 990 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:25,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:25,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:47:25,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:26,138 INFO L124 PetriNetUnfolderBase]: 286/549 cut-off events. [2024-06-04 16:47:26,138 INFO L125 PetriNetUnfolderBase]: For 12529/12529 co-relation queries the response was YES. [2024-06-04 16:47:26,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3153 conditions, 549 events. 286/549 cut-off events. For 12529/12529 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2592 event pairs, 63 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 3091. Up to 473 conditions per place. [2024-06-04 16:47:26,142 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 107 selfloop transitions, 25 changer transitions 0/135 dead transitions. [2024-06-04 16:47:26,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 135 transitions, 1428 flow [2024-06-04 16:47:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:47:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:47:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-04 16:47:26,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 16:47:26,143 INFO L175 Difference]: Start difference. First operand has 131 places, 117 transitions, 990 flow. Second operand 11 states and 132 transitions. [2024-06-04 16:47:26,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 135 transitions, 1428 flow [2024-06-04 16:47:26,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 135 transitions, 1361 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 16:47:26,162 INFO L231 Difference]: Finished difference. Result has 134 places, 121 transitions, 1058 flow [2024-06-04 16:47:26,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1058, PETRI_PLACES=134, PETRI_TRANSITIONS=121} [2024-06-04 16:47:26,163 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 104 predicate places. [2024-06-04 16:47:26,163 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 121 transitions, 1058 flow [2024-06-04 16:47:26,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:26,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:26,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:26,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 16:47:26,164 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:26,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:26,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2131648787, now seen corresponding path program 4 times [2024-06-04 16:47:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:26,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248859205] [2024-06-04 16:47:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:26,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:31,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:31,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:31,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248859205] [2024-06-04 16:47:31,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248859205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:31,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:31,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:47:31,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090251957] [2024-06-04 16:47:31,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:31,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:47:31,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:31,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:47:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:47:31,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:47:31,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 121 transitions, 1058 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:31,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:31,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:47:31,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:31,711 INFO L124 PetriNetUnfolderBase]: 284/546 cut-off events. [2024-06-04 16:47:31,712 INFO L125 PetriNetUnfolderBase]: For 12450/12450 co-relation queries the response was YES. [2024-06-04 16:47:31,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3114 conditions, 546 events. 284/546 cut-off events. For 12450/12450 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2554 event pairs, 63 based on Foata normal form. 1/547 useless extension candidates. Maximal degree in co-relation 3051. Up to 471 conditions per place. [2024-06-04 16:47:31,715 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 106 selfloop transitions, 24 changer transitions 0/133 dead transitions. [2024-06-04 16:47:31,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 133 transitions, 1348 flow [2024-06-04 16:47:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:47:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:47:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-04 16:47:31,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2024-06-04 16:47:31,717 INFO L175 Difference]: Start difference. First operand has 134 places, 121 transitions, 1058 flow. Second operand 10 states and 121 transitions. [2024-06-04 16:47:31,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 133 transitions, 1348 flow [2024-06-04 16:47:31,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 133 transitions, 1255 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-04 16:47:31,737 INFO L231 Difference]: Finished difference. Result has 137 places, 121 transitions, 1018 flow [2024-06-04 16:47:31,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1018, PETRI_PLACES=137, PETRI_TRANSITIONS=121} [2024-06-04 16:47:31,738 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places. [2024-06-04 16:47:31,738 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 121 transitions, 1018 flow [2024-06-04 16:47:31,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:31,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:31,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:31,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 16:47:31,738 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:31,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:31,739 INFO L85 PathProgramCache]: Analyzing trace with hash 265405803, now seen corresponding path program 7 times [2024-06-04 16:47:31,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:31,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072279854] [2024-06-04 16:47:31,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:31,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:35,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:35,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072279854] [2024-06-04 16:47:35,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072279854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:35,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:35,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:47:35,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716276781] [2024-06-04 16:47:35,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:35,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:47:35,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:35,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:47:35,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:47:35,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:47:35,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 121 transitions, 1018 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:35,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:35,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:47:35,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:35,688 INFO L124 PetriNetUnfolderBase]: 288/554 cut-off events. [2024-06-04 16:47:35,688 INFO L125 PetriNetUnfolderBase]: For 13682/13682 co-relation queries the response was YES. [2024-06-04 16:47:35,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3171 conditions, 554 events. 288/554 cut-off events. For 13682/13682 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2611 event pairs, 29 based on Foata normal form. 2/556 useless extension candidates. Maximal degree in co-relation 3106. Up to 413 conditions per place. [2024-06-04 16:47:35,692 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 109 selfloop transitions, 23 changer transitions 0/135 dead transitions. [2024-06-04 16:47:35,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 135 transitions, 1338 flow [2024-06-04 16:47:35,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:47:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:47:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-04 16:47:35,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2024-06-04 16:47:35,705 INFO L175 Difference]: Start difference. First operand has 137 places, 121 transitions, 1018 flow. Second operand 8 states and 99 transitions. [2024-06-04 16:47:35,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 135 transitions, 1338 flow [2024-06-04 16:47:35,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 1285 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-04 16:47:35,727 INFO L231 Difference]: Finished difference. Result has 136 places, 122 transitions, 1047 flow [2024-06-04 16:47:35,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1047, PETRI_PLACES=136, PETRI_TRANSITIONS=122} [2024-06-04 16:47:35,729 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 106 predicate places. [2024-06-04 16:47:35,729 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 122 transitions, 1047 flow [2024-06-04 16:47:35,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:35,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:35,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:35,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 16:47:35,731 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:35,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:35,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1476004531, now seen corresponding path program 8 times [2024-06-04 16:47:35,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:35,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423181775] [2024-06-04 16:47:35,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:35,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:40,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-04 16:47:40,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:40,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423181775] [2024-06-04 16:47:40,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423181775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:40,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:40,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:47:40,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577712565] [2024-06-04 16:47:40,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:40,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:47:40,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:40,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:47:40,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:47:40,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:47:40,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 122 transitions, 1047 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:40,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:40,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:47:40,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:40,758 INFO L124 PetriNetUnfolderBase]: 292/562 cut-off events. [2024-06-04 16:47:40,758 INFO L125 PetriNetUnfolderBase]: For 14737/14737 co-relation queries the response was YES. [2024-06-04 16:47:40,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3289 conditions, 562 events. 292/562 cut-off events. For 14737/14737 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2653 event pairs, 56 based on Foata normal form. 2/564 useless extension candidates. Maximal degree in co-relation 3223. Up to 471 conditions per place. [2024-06-04 16:47:40,762 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 108 selfloop transitions, 24 changer transitions 0/135 dead transitions. [2024-06-04 16:47:40,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 135 transitions, 1367 flow [2024-06-04 16:47:40,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:47:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:47:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-04 16:47:40,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-04 16:47:40,764 INFO L175 Difference]: Start difference. First operand has 136 places, 122 transitions, 1047 flow. Second operand 8 states and 100 transitions. [2024-06-04 16:47:40,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 135 transitions, 1367 flow [2024-06-04 16:47:40,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 135 transitions, 1295 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-04 16:47:40,787 INFO L231 Difference]: Finished difference. Result has 138 places, 123 transitions, 1059 flow [2024-06-04 16:47:40,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1059, PETRI_PLACES=138, PETRI_TRANSITIONS=123} [2024-06-04 16:47:40,788 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 108 predicate places. [2024-06-04 16:47:40,788 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 123 transitions, 1059 flow [2024-06-04 16:47:40,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:40,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:40,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:40,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 16:47:40,788 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:40,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:40,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1035028631, now seen corresponding path program 5 times [2024-06-04 16:47:40,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:40,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722820422] [2024-06-04 16:47:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:40,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:46,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:46,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722820422] [2024-06-04 16:47:46,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722820422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:46,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:46,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:47:46,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010870126] [2024-06-04 16:47:46,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:46,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:47:46,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:46,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:47:46,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:47:46,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:47:46,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 123 transitions, 1059 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:46,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:46,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:47:46,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:46,487 INFO L124 PetriNetUnfolderBase]: 298/574 cut-off events. [2024-06-04 16:47:46,487 INFO L125 PetriNetUnfolderBase]: For 13348/13348 co-relation queries the response was YES. [2024-06-04 16:47:46,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3318 conditions, 574 events. 298/574 cut-off events. For 13348/13348 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2749 event pairs, 54 based on Foata normal form. 2/576 useless extension candidates. Maximal degree in co-relation 3251. Up to 472 conditions per place. [2024-06-04 16:47:46,505 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 102 selfloop transitions, 33 changer transitions 0/138 dead transitions. [2024-06-04 16:47:46,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 138 transitions, 1415 flow [2024-06-04 16:47:46,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:47:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:47:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 16:47:46,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-04 16:47:46,513 INFO L175 Difference]: Start difference. First operand has 138 places, 123 transitions, 1059 flow. Second operand 9 states and 111 transitions. [2024-06-04 16:47:46,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 138 transitions, 1415 flow [2024-06-04 16:47:46,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 138 transitions, 1351 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-04 16:47:46,565 INFO L231 Difference]: Finished difference. Result has 141 places, 125 transitions, 1122 flow [2024-06-04 16:47:46,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1122, PETRI_PLACES=141, PETRI_TRANSITIONS=125} [2024-06-04 16:47:46,566 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 111 predicate places. [2024-06-04 16:47:46,566 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 125 transitions, 1122 flow [2024-06-04 16:47:46,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:46,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:46,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:46,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 16:47:46,568 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:46,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:46,568 INFO L85 PathProgramCache]: Analyzing trace with hash -919742421, now seen corresponding path program 9 times [2024-06-04 16:47:46,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:46,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830246220] [2024-06-04 16:47:46,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:46,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:50,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:50,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830246220] [2024-06-04 16:47:50,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830246220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:50,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:50,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:47:50,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511323634] [2024-06-04 16:47:50,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:50,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:47:50,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:50,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:47:50,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:47:50,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:47:50,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 125 transitions, 1122 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:50,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:50,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:47:50,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:50,674 INFO L124 PetriNetUnfolderBase]: 302/582 cut-off events. [2024-06-04 16:47:50,674 INFO L125 PetriNetUnfolderBase]: For 12798/12798 co-relation queries the response was YES. [2024-06-04 16:47:50,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 582 events. 302/582 cut-off events. For 12798/12798 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2813 event pairs, 63 based on Foata normal form. 2/584 useless extension candidates. Maximal degree in co-relation 3303. Up to 508 conditions per place. [2024-06-04 16:47:50,693 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 114 selfloop transitions, 19 changer transitions 0/136 dead transitions. [2024-06-04 16:47:50,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 136 transitions, 1430 flow [2024-06-04 16:47:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:47:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:47:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-04 16:47:50,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-04 16:47:50,699 INFO L175 Difference]: Start difference. First operand has 141 places, 125 transitions, 1122 flow. Second operand 8 states and 97 transitions. [2024-06-04 16:47:50,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 136 transitions, 1430 flow [2024-06-04 16:47:50,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 136 transitions, 1331 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-04 16:47:50,743 INFO L231 Difference]: Finished difference. Result has 142 places, 126 transitions, 1087 flow [2024-06-04 16:47:50,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1087, PETRI_PLACES=142, PETRI_TRANSITIONS=126} [2024-06-04 16:47:50,763 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 112 predicate places. [2024-06-04 16:47:50,763 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 126 transitions, 1087 flow [2024-06-04 16:47:50,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:50,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:50,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:50,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 16:47:50,764 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:50,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:50,764 INFO L85 PathProgramCache]: Analyzing trace with hash -919557971, now seen corresponding path program 6 times [2024-06-04 16:47:50,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:50,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939724029] [2024-06-04 16:47:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:50,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:56,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:56,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939724029] [2024-06-04 16:47:56,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939724029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:56,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:56,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:47:56,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806843819] [2024-06-04 16:47:56,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:56,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:47:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:56,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:47:56,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:47:56,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:47:56,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 126 transitions, 1087 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:56,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:56,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:47:56,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:57,089 INFO L124 PetriNetUnfolderBase]: 318/614 cut-off events. [2024-06-04 16:47:57,090 INFO L125 PetriNetUnfolderBase]: For 13334/13334 co-relation queries the response was YES. [2024-06-04 16:47:57,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3549 conditions, 614 events. 318/614 cut-off events. For 13334/13334 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3006 event pairs, 66 based on Foata normal form. 2/616 useless extension candidates. Maximal degree in co-relation 3480. Up to 479 conditions per place. [2024-06-04 16:47:57,095 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 104 selfloop transitions, 36 changer transitions 0/143 dead transitions. [2024-06-04 16:47:57,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 143 transitions, 1559 flow [2024-06-04 16:47:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:47:57,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:47:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-04 16:47:57,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050179211469534 [2024-06-04 16:47:57,097 INFO L175 Difference]: Start difference. First operand has 142 places, 126 transitions, 1087 flow. Second operand 9 states and 113 transitions. [2024-06-04 16:47:57,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 143 transitions, 1559 flow [2024-06-04 16:47:57,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 143 transitions, 1505 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 16:47:57,118 INFO L231 Difference]: Finished difference. Result has 145 places, 131 transitions, 1216 flow [2024-06-04 16:47:57,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1216, PETRI_PLACES=145, PETRI_TRANSITIONS=131} [2024-06-04 16:47:57,119 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2024-06-04 16:47:57,119 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 131 transitions, 1216 flow [2024-06-04 16:47:57,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:57,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:57,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:57,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 16:47:57,119 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:57,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1471357941, now seen corresponding path program 7 times [2024-06-04 16:47:57,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:57,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665035381] [2024-06-04 16:47:57,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:57,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:02,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:02,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665035381] [2024-06-04 16:48:02,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665035381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:02,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:02,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:48:02,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349336597] [2024-06-04 16:48:02,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:02,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:48:02,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:02,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:48:02,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:48:02,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:48:02,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 131 transitions, 1216 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:02,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:02,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:48:02,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:02,664 INFO L124 PetriNetUnfolderBase]: 316/609 cut-off events. [2024-06-04 16:48:02,665 INFO L125 PetriNetUnfolderBase]: For 12566/12566 co-relation queries the response was YES. [2024-06-04 16:48:02,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3569 conditions, 609 events. 316/609 cut-off events. For 12566/12566 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2977 event pairs, 66 based on Foata normal form. 1/610 useless extension candidates. Maximal degree in co-relation 3499. Up to 478 conditions per place. [2024-06-04 16:48:02,682 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 103 selfloop transitions, 39 changer transitions 0/145 dead transitions. [2024-06-04 16:48:02,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 145 transitions, 1644 flow [2024-06-04 16:48:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:48:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:48:02,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 16:48:02,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40860215053763443 [2024-06-04 16:48:02,691 INFO L175 Difference]: Start difference. First operand has 145 places, 131 transitions, 1216 flow. Second operand 9 states and 114 transitions. [2024-06-04 16:48:02,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 145 transitions, 1644 flow [2024-06-04 16:48:02,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 145 transitions, 1559 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-04 16:48:02,714 INFO L231 Difference]: Finished difference. Result has 148 places, 133 transitions, 1265 flow [2024-06-04 16:48:02,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1265, PETRI_PLACES=148, PETRI_TRANSITIONS=133} [2024-06-04 16:48:02,714 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2024-06-04 16:48:02,714 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 133 transitions, 1265 flow [2024-06-04 16:48:02,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:02,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:02,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:02,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 16:48:02,715 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:02,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:02,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1243458917, now seen corresponding path program 10 times [2024-06-04 16:48:02,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:02,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256933032] [2024-06-04 16:48:02,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:02,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:07,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:07,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256933032] [2024-06-04 16:48:07,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256933032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:07,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:07,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:48:07,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826949629] [2024-06-04 16:48:07,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:07,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:48:07,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:07,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:48:07,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:48:07,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:48:07,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 133 transitions, 1265 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:07,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:07,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:48:07,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:07,739 INFO L124 PetriNetUnfolderBase]: 313/606 cut-off events. [2024-06-04 16:48:07,740 INFO L125 PetriNetUnfolderBase]: For 11758/11758 co-relation queries the response was YES. [2024-06-04 16:48:07,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 606 events. 313/606 cut-off events. For 11758/11758 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2962 event pairs, 68 based on Foata normal form. 2/608 useless extension candidates. Maximal degree in co-relation 3441. Up to 523 conditions per place. [2024-06-04 16:48:07,744 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 118 selfloop transitions, 20 changer transitions 0/141 dead transitions. [2024-06-04 16:48:07,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 141 transitions, 1559 flow [2024-06-04 16:48:07,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:48:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:48:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-04 16:48:07,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-04 16:48:07,746 INFO L175 Difference]: Start difference. First operand has 148 places, 133 transitions, 1265 flow. Second operand 8 states and 97 transitions. [2024-06-04 16:48:07,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 141 transitions, 1559 flow [2024-06-04 16:48:07,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 141 transitions, 1469 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-04 16:48:07,769 INFO L231 Difference]: Finished difference. Result has 149 places, 133 transitions, 1219 flow [2024-06-04 16:48:07,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1219, PETRI_PLACES=149, PETRI_TRANSITIONS=133} [2024-06-04 16:48:07,770 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 119 predicate places. [2024-06-04 16:48:07,770 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 133 transitions, 1219 flow [2024-06-04 16:48:07,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:07,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:07,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:07,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 16:48:07,770 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:07,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:07,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1243274467, now seen corresponding path program 8 times [2024-06-04 16:48:07,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:07,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800098834] [2024-06-04 16:48:07,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:07,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:13,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:13,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800098834] [2024-06-04 16:48:13,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800098834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:13,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:13,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:48:13,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044571357] [2024-06-04 16:48:13,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:13,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:48:13,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:13,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:48:13,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:48:13,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:48:13,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 133 transitions, 1219 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:13,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:13,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:48:13,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:14,123 INFO L124 PetriNetUnfolderBase]: 329/636 cut-off events. [2024-06-04 16:48:14,124 INFO L125 PetriNetUnfolderBase]: For 13162/13162 co-relation queries the response was YES. [2024-06-04 16:48:14,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3781 conditions, 636 events. 329/636 cut-off events. For 13162/13162 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3163 event pairs, 66 based on Foata normal form. 2/638 useless extension candidates. Maximal degree in co-relation 3710. Up to 517 conditions per place. [2024-06-04 16:48:14,128 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 115 selfloop transitions, 30 changer transitions 0/148 dead transitions. [2024-06-04 16:48:14,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 148 transitions, 1711 flow [2024-06-04 16:48:14,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:48:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:48:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-04 16:48:14,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050179211469534 [2024-06-04 16:48:14,130 INFO L175 Difference]: Start difference. First operand has 149 places, 133 transitions, 1219 flow. Second operand 9 states and 113 transitions. [2024-06-04 16:48:14,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 148 transitions, 1711 flow [2024-06-04 16:48:14,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 148 transitions, 1627 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 16:48:14,156 INFO L231 Difference]: Finished difference. Result has 151 places, 138 transitions, 1313 flow [2024-06-04 16:48:14,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1313, PETRI_PLACES=151, PETRI_TRANSITIONS=138} [2024-06-04 16:48:14,157 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-04 16:48:14,157 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 138 transitions, 1313 flow [2024-06-04 16:48:14,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:14,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:14,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:14,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 16:48:14,157 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:14,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:14,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1243280977, now seen corresponding path program 9 times [2024-06-04 16:48:14,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:14,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385371764] [2024-06-04 16:48:14,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:14,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:21,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:21,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385371764] [2024-06-04 16:48:21,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385371764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:21,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:21,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:48:21,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850154665] [2024-06-04 16:48:21,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:21,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:48:21,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:21,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:48:21,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:48:21,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:48:21,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 138 transitions, 1313 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:21,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:21,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:48:21,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:22,177 INFO L124 PetriNetUnfolderBase]: 327/633 cut-off events. [2024-06-04 16:48:22,177 INFO L125 PetriNetUnfolderBase]: For 13059/13059 co-relation queries the response was YES. [2024-06-04 16:48:22,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3773 conditions, 633 events. 327/633 cut-off events. For 13059/13059 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3123 event pairs, 66 based on Foata normal form. 1/634 useless extension candidates. Maximal degree in co-relation 3701. Up to 531 conditions per place. [2024-06-04 16:48:22,182 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 120 selfloop transitions, 29 changer transitions 0/152 dead transitions. [2024-06-04 16:48:22,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 152 transitions, 1749 flow [2024-06-04 16:48:22,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:48:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:48:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 16:48:22,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-04 16:48:22,183 INFO L175 Difference]: Start difference. First operand has 151 places, 138 transitions, 1313 flow. Second operand 9 states and 111 transitions. [2024-06-04 16:48:22,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 152 transitions, 1749 flow [2024-06-04 16:48:22,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 152 transitions, 1611 flow, removed 48 selfloop flow, removed 6 redundant places. [2024-06-04 16:48:22,208 INFO L231 Difference]: Finished difference. Result has 156 places, 144 transitions, 1381 flow [2024-06-04 16:48:22,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1381, PETRI_PLACES=156, PETRI_TRANSITIONS=144} [2024-06-04 16:48:22,209 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-04 16:48:22,209 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 144 transitions, 1381 flow [2024-06-04 16:48:22,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:22,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:22,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:22,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 16:48:22,209 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:22,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:22,210 INFO L85 PathProgramCache]: Analyzing trace with hash -963422329, now seen corresponding path program 1 times [2024-06-04 16:48:22,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:22,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348354295] [2024-06-04 16:48:22,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:26,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:26,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348354295] [2024-06-04 16:48:26,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348354295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:26,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:26,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:48:26,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571771400] [2024-06-04 16:48:26,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:26,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:48:26,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:26,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:48:26,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:48:26,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:48:26,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 144 transitions, 1381 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:26,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:26,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:48:26,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:27,054 INFO L124 PetriNetUnfolderBase]: 330/637 cut-off events. [2024-06-04 16:48:27,055 INFO L125 PetriNetUnfolderBase]: For 13312/13312 co-relation queries the response was YES. [2024-06-04 16:48:27,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3797 conditions, 637 events. 330/637 cut-off events. For 13312/13312 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3164 event pairs, 93 based on Foata normal form. 1/638 useless extension candidates. Maximal degree in co-relation 3722. Up to 567 conditions per place. [2024-06-04 16:48:27,059 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 134 selfloop transitions, 19 changer transitions 0/156 dead transitions. [2024-06-04 16:48:27,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 156 transitions, 1807 flow [2024-06-04 16:48:27,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:48:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:48:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 16:48:27,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-04 16:48:27,061 INFO L175 Difference]: Start difference. First operand has 156 places, 144 transitions, 1381 flow. Second operand 10 states and 116 transitions. [2024-06-04 16:48:27,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 156 transitions, 1807 flow [2024-06-04 16:48:27,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 156 transitions, 1726 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-04 16:48:27,090 INFO L231 Difference]: Finished difference. Result has 162 places, 146 transitions, 1375 flow [2024-06-04 16:48:27,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1375, PETRI_PLACES=162, PETRI_TRANSITIONS=146} [2024-06-04 16:48:27,090 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2024-06-04 16:48:27,090 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 146 transitions, 1375 flow [2024-06-04 16:48:27,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:27,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:27,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:27,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 16:48:27,092 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:27,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:27,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1007099107, now seen corresponding path program 10 times [2024-06-04 16:48:27,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:27,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387436856] [2024-06-04 16:48:27,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:27,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:32,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:32,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387436856] [2024-06-04 16:48:32,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387436856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:32,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:32,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:48:32,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119428679] [2024-06-04 16:48:32,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:32,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:48:32,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:32,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:48:32,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:48:33,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:48:33,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 146 transitions, 1375 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:33,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:33,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:48:33,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:33,394 INFO L124 PetriNetUnfolderBase]: 342/662 cut-off events. [2024-06-04 16:48:33,394 INFO L125 PetriNetUnfolderBase]: For 15368/15368 co-relation queries the response was YES. [2024-06-04 16:48:33,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4036 conditions, 662 events. 342/662 cut-off events. For 15368/15368 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3300 event pairs, 96 based on Foata normal form. 2/664 useless extension candidates. Maximal degree in co-relation 3959. Up to 574 conditions per place. [2024-06-04 16:48:33,399 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 135 selfloop transitions, 22 changer transitions 0/160 dead transitions. [2024-06-04 16:48:33,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 160 transitions, 1891 flow [2024-06-04 16:48:33,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:48:33,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:48:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 16:48:33,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-04 16:48:33,400 INFO L175 Difference]: Start difference. First operand has 162 places, 146 transitions, 1375 flow. Second operand 9 states and 109 transitions. [2024-06-04 16:48:33,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 160 transitions, 1891 flow [2024-06-04 16:48:33,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 160 transitions, 1832 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 16:48:33,428 INFO L231 Difference]: Finished difference. Result has 164 places, 151 transitions, 1488 flow [2024-06-04 16:48:33,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1488, PETRI_PLACES=164, PETRI_TRANSITIONS=151} [2024-06-04 16:48:33,429 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 134 predicate places. [2024-06-04 16:48:33,429 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 151 transitions, 1488 flow [2024-06-04 16:48:33,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:33,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:33,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:33,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 16:48:33,430 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:33,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:33,430 INFO L85 PathProgramCache]: Analyzing trace with hash -963661587, now seen corresponding path program 11 times [2024-06-04 16:48:33,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:33,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884577056] [2024-06-04 16:48:33,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:33,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:39,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:39,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884577056] [2024-06-04 16:48:39,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884577056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:39,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:39,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:48:39,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380519774] [2024-06-04 16:48:39,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:39,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:48:39,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:39,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:48:39,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:48:39,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 16:48:39,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 151 transitions, 1488 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:39,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:39,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 16:48:39,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:39,883 INFO L124 PetriNetUnfolderBase]: 345/666 cut-off events. [2024-06-04 16:48:39,883 INFO L125 PetriNetUnfolderBase]: For 16148/16148 co-relation queries the response was YES. [2024-06-04 16:48:39,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4155 conditions, 666 events. 345/666 cut-off events. For 16148/16148 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3341 event pairs, 65 based on Foata normal form. 1/667 useless extension candidates. Maximal degree in co-relation 4077. Up to 491 conditions per place. [2024-06-04 16:48:39,888 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 109 selfloop transitions, 59 changer transitions 0/171 dead transitions. [2024-06-04 16:48:39,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 171 transitions, 2116 flow [2024-06-04 16:48:39,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:48:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:48:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-04 16:48:39,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2024-06-04 16:48:39,905 INFO L175 Difference]: Start difference. First operand has 164 places, 151 transitions, 1488 flow. Second operand 10 states and 135 transitions. [2024-06-04 16:48:39,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 171 transitions, 2116 flow [2024-06-04 16:48:39,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 171 transitions, 2000 flow, removed 50 selfloop flow, removed 5 redundant places. [2024-06-04 16:48:39,936 INFO L231 Difference]: Finished difference. Result has 172 places, 160 transitions, 1749 flow [2024-06-04 16:48:39,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1749, PETRI_PLACES=172, PETRI_TRANSITIONS=160} [2024-06-04 16:48:39,937 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2024-06-04 16:48:39,937 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 160 transitions, 1749 flow [2024-06-04 16:48:39,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:39,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:39,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:39,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 16:48:39,938 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:39,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1015379827, now seen corresponding path program 12 times [2024-06-04 16:48:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:39,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870544660] [2024-06-04 16:48:39,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:39,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:45,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:45,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870544660] [2024-06-04 16:48:45,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870544660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:45,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:45,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:48:45,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850644619] [2024-06-04 16:48:45,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:45,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:48:45,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:45,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:48:45,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:48:45,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:48:45,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 160 transitions, 1749 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:45,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:45,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:48:45,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:46,034 INFO L124 PetriNetUnfolderBase]: 343/663 cut-off events. [2024-06-04 16:48:46,035 INFO L125 PetriNetUnfolderBase]: For 16076/16076 co-relation queries the response was YES. [2024-06-04 16:48:46,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4230 conditions, 663 events. 343/663 cut-off events. For 16076/16076 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3320 event pairs, 65 based on Foata normal form. 1/664 useless extension candidates. Maximal degree in co-relation 4147. Up to 489 conditions per place. [2024-06-04 16:48:46,040 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 107 selfloop transitions, 62 changer transitions 0/172 dead transitions. [2024-06-04 16:48:46,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 172 transitions, 2143 flow [2024-06-04 16:48:46,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:48:46,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:48:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-04 16:48:46,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-04 16:48:46,042 INFO L175 Difference]: Start difference. First operand has 172 places, 160 transitions, 1749 flow. Second operand 11 states and 133 transitions. [2024-06-04 16:48:46,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 172 transitions, 2143 flow [2024-06-04 16:48:46,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 172 transitions, 2002 flow, removed 59 selfloop flow, removed 4 redundant places. [2024-06-04 16:48:46,076 INFO L231 Difference]: Finished difference. Result has 179 places, 161 transitions, 1763 flow [2024-06-04 16:48:46,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1763, PETRI_PLACES=179, PETRI_TRANSITIONS=161} [2024-06-04 16:48:46,077 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2024-06-04 16:48:46,077 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 161 transitions, 1763 flow [2024-06-04 16:48:46,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:46,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:46,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:46,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 16:48:46,077 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:46,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:46,078 INFO L85 PathProgramCache]: Analyzing trace with hash -955387129, now seen corresponding path program 2 times [2024-06-04 16:48:46,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:46,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503019240] [2024-06-04 16:48:46,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:46,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:51,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:51,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503019240] [2024-06-04 16:48:51,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503019240] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:51,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:51,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:48:51,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908034659] [2024-06-04 16:48:51,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:51,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:48:51,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:51,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:48:51,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:48:51,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:48:51,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 161 transitions, 1763 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:51,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:51,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:48:51,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:51,627 INFO L124 PetriNetUnfolderBase]: 340/656 cut-off events. [2024-06-04 16:48:51,627 INFO L125 PetriNetUnfolderBase]: For 15569/15569 co-relation queries the response was YES. [2024-06-04 16:48:51,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4175 conditions, 656 events. 340/656 cut-off events. For 15569/15569 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3285 event pairs, 93 based on Foata normal form. 1/657 useless extension candidates. Maximal degree in co-relation 4090. Up to 591 conditions per place. [2024-06-04 16:48:51,632 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 151 selfloop transitions, 15 changer transitions 0/169 dead transitions. [2024-06-04 16:48:51,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 169 transitions, 2113 flow [2024-06-04 16:48:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:48:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:48:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-04 16:48:51,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-04 16:48:51,634 INFO L175 Difference]: Start difference. First operand has 179 places, 161 transitions, 1763 flow. Second operand 9 states and 104 transitions. [2024-06-04 16:48:51,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 169 transitions, 2113 flow [2024-06-04 16:48:51,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 169 transitions, 1992 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 16:48:51,671 INFO L231 Difference]: Finished difference. Result has 181 places, 161 transitions, 1677 flow [2024-06-04 16:48:51,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1677, PETRI_PLACES=181, PETRI_TRANSITIONS=161} [2024-06-04 16:48:51,671 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 151 predicate places. [2024-06-04 16:48:51,672 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 161 transitions, 1677 flow [2024-06-04 16:48:51,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:51,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:51,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:51,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 16:48:51,672 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:51,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:51,673 INFO L85 PathProgramCache]: Analyzing trace with hash -681767693, now seen corresponding path program 1 times [2024-06-04 16:48:51,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:51,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235652816] [2024-06-04 16:48:51,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:51,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:57,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:57,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235652816] [2024-06-04 16:48:57,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235652816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:57,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:57,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:48:57,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188577577] [2024-06-04 16:48:57,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:57,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:48:57,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:57,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:48:57,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:48:58,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 16:48:58,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 161 transitions, 1677 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:58,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:58,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 16:48:58,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:58,335 INFO L124 PetriNetUnfolderBase]: 344/665 cut-off events. [2024-06-04 16:48:58,336 INFO L125 PetriNetUnfolderBase]: For 16961/16961 co-relation queries the response was YES. [2024-06-04 16:48:58,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4126 conditions, 665 events. 344/665 cut-off events. For 16961/16961 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3324 event pairs, 29 based on Foata normal form. 2/667 useless extension candidates. Maximal degree in co-relation 4040. Up to 490 conditions per place. [2024-06-04 16:48:58,341 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 150 selfloop transitions, 24 changer transitions 0/177 dead transitions. [2024-06-04 16:48:58,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 177 transitions, 2075 flow [2024-06-04 16:48:58,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:48:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:48:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 16:48:58,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229390681003584 [2024-06-04 16:48:58,342 INFO L175 Difference]: Start difference. First operand has 181 places, 161 transitions, 1677 flow. Second operand 9 states and 118 transitions. [2024-06-04 16:48:58,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 177 transitions, 2075 flow [2024-06-04 16:48:58,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 177 transitions, 2038 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-04 16:48:58,381 INFO L231 Difference]: Finished difference. Result has 182 places, 162 transitions, 1711 flow [2024-06-04 16:48:58,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1711, PETRI_PLACES=182, PETRI_TRANSITIONS=162} [2024-06-04 16:48:58,382 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2024-06-04 16:48:58,382 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 162 transitions, 1711 flow [2024-06-04 16:48:58,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:58,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:58,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:58,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 16:48:58,382 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:58,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:58,383 INFO L85 PathProgramCache]: Analyzing trace with hash -568177493, now seen corresponding path program 2 times [2024-06-04 16:48:58,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:58,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414109889] [2024-06-04 16:48:58,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:58,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:03,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:03,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414109889] [2024-06-04 16:49:03,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414109889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:03,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:03,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:49:03,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088669337] [2024-06-04 16:49:03,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:03,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:49:03,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:03,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:49:03,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:49:03,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:49:03,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 162 transitions, 1711 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:03,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:03,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:49:03,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:03,567 INFO L124 PetriNetUnfolderBase]: 348/673 cut-off events. [2024-06-04 16:49:03,567 INFO L125 PetriNetUnfolderBase]: For 17675/17675 co-relation queries the response was YES. [2024-06-04 16:49:03,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4240 conditions, 673 events. 348/673 cut-off events. For 17675/17675 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3388 event pairs, 55 based on Foata normal form. 2/675 useless extension candidates. Maximal degree in co-relation 4153. Up to 578 conditions per place. [2024-06-04 16:49:03,573 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 156 selfloop transitions, 20 changer transitions 0/179 dead transitions. [2024-06-04 16:49:03,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 179 transitions, 2119 flow [2024-06-04 16:49:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:49:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:49:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-04 16:49:03,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2024-06-04 16:49:03,574 INFO L175 Difference]: Start difference. First operand has 182 places, 162 transitions, 1711 flow. Second operand 10 states and 121 transitions. [2024-06-04 16:49:03,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 179 transitions, 2119 flow [2024-06-04 16:49:03,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 179 transitions, 2064 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 16:49:03,614 INFO L231 Difference]: Finished difference. Result has 185 places, 163 transitions, 1718 flow [2024-06-04 16:49:03,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1718, PETRI_PLACES=185, PETRI_TRANSITIONS=163} [2024-06-04 16:49:03,615 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 155 predicate places. [2024-06-04 16:49:03,615 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 163 transitions, 1718 flow [2024-06-04 16:49:03,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:03,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:03,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:03,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 16:49:03,616 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:03,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:03,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1690798079, now seen corresponding path program 3 times [2024-06-04 16:49:03,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:03,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523641169] [2024-06-04 16:49:03,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:03,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:08,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:08,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523641169] [2024-06-04 16:49:08,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523641169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:08,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:08,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:49:08,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603738828] [2024-06-04 16:49:08,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:08,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:49:08,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:08,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:49:08,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:49:08,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 16:49:08,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 163 transitions, 1718 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:08,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:08,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 16:49:08,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:09,028 INFO L124 PetriNetUnfolderBase]: 352/681 cut-off events. [2024-06-04 16:49:09,029 INFO L125 PetriNetUnfolderBase]: For 18841/18841 co-relation queries the response was YES. [2024-06-04 16:49:09,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4286 conditions, 681 events. 352/681 cut-off events. For 18841/18841 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3461 event pairs, 59 based on Foata normal form. 2/683 useless extension candidates. Maximal degree in co-relation 4198. Up to 575 conditions per place. [2024-06-04 16:49:09,035 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 146 selfloop transitions, 28 changer transitions 0/177 dead transitions. [2024-06-04 16:49:09,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 177 transitions, 2116 flow [2024-06-04 16:49:09,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:49:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:49:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-04 16:49:09,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265232974910394 [2024-06-04 16:49:09,036 INFO L175 Difference]: Start difference. First operand has 185 places, 163 transitions, 1718 flow. Second operand 9 states and 119 transitions. [2024-06-04 16:49:09,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 177 transitions, 2116 flow [2024-06-04 16:49:09,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 177 transitions, 2064 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 16:49:09,079 INFO L231 Difference]: Finished difference. Result has 186 places, 164 transitions, 1748 flow [2024-06-04 16:49:09,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1666, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1748, PETRI_PLACES=186, PETRI_TRANSITIONS=164} [2024-06-04 16:49:09,080 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2024-06-04 16:49:09,080 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 164 transitions, 1748 flow [2024-06-04 16:49:09,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:09,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:09,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:09,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 16:49:09,081 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-04 16:49:09,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:09,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2068616001, now seen corresponding path program 4 times [2024-06-04 16:49:09,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:09,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335599926] [2024-06-04 16:49:09,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:09,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:14,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:14,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:14,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335599926] [2024-06-04 16:49:14,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335599926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:14,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:14,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:49:14,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248724688] [2024-06-04 16:49:14,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:14,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:49:14,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:14,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:49:14,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:49:14,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:49:14,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 164 transitions, 1748 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:14,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:14,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:49:14,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:14,660 INFO L124 PetriNetUnfolderBase]: 356/689 cut-off events. [2024-06-04 16:49:14,661 INFO L125 PetriNetUnfolderBase]: For 19763/19763 co-relation queries the response was YES. [2024-06-04 16:49:14,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4358 conditions, 689 events. 356/689 cut-off events. For 19763/19763 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3530 event pairs, 66 based on Foata normal form. 2/691 useless extension candidates. Maximal degree in co-relation 4269. Up to 605 conditions per place. [2024-06-04 16:49:14,666 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 161 selfloop transitions, 16 changer transitions 0/180 dead transitions. [2024-06-04 16:49:14,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 180 transitions, 2160 flow [2024-06-04 16:49:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:49:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:49:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-04 16:49:14,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-04 16:49:14,669 INFO L175 Difference]: Start difference. First operand has 186 places, 164 transitions, 1748 flow. Second operand 10 states and 119 transitions. [2024-06-04 16:49:14,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 180 transitions, 2160 flow [2024-06-04 16:49:14,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 180 transitions, 2092 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 16:49:14,728 INFO L231 Difference]: Finished difference. Result has 189 places, 165 transitions, 1738 flow [2024-06-04 16:49:14,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1680, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1738, PETRI_PLACES=189, PETRI_TRANSITIONS=165} [2024-06-04 16:49:14,729 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 159 predicate places. [2024-06-04 16:49:14,729 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 165 transitions, 1738 flow [2024-06-04 16:49:14,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:14,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:14,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:14,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 16:49:14,730 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:14,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -291862919, now seen corresponding path program 5 times [2024-06-04 16:49:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:14,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413992495] [2024-06-04 16:49:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:14,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:21,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:21,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413992495] [2024-06-04 16:49:21,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413992495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:21,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:21,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:49:21,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261979601] [2024-06-04 16:49:21,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:21,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:49:21,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:21,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:49:21,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:49:22,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:49:22,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 165 transitions, 1738 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:22,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:22,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:49:22,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:22,411 INFO L124 PetriNetUnfolderBase]: 360/697 cut-off events. [2024-06-04 16:49:22,411 INFO L125 PetriNetUnfolderBase]: For 20646/20646 co-relation queries the response was YES. [2024-06-04 16:49:22,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4390 conditions, 697 events. 360/697 cut-off events. For 20646/20646 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3587 event pairs, 68 based on Foata normal form. 2/699 useless extension candidates. Maximal degree in co-relation 4300. Up to 608 conditions per place. [2024-06-04 16:49:22,417 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 156 selfloop transitions, 21 changer transitions 0/180 dead transitions. [2024-06-04 16:49:22,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 180 transitions, 2148 flow [2024-06-04 16:49:22,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:49:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:49:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-04 16:49:22,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-04 16:49:22,418 INFO L175 Difference]: Start difference. First operand has 189 places, 165 transitions, 1738 flow. Second operand 11 states and 130 transitions. [2024-06-04 16:49:22,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 180 transitions, 2148 flow [2024-06-04 16:49:22,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 180 transitions, 2100 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 16:49:22,462 INFO L231 Difference]: Finished difference. Result has 192 places, 166 transitions, 1762 flow [2024-06-04 16:49:22,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1762, PETRI_PLACES=192, PETRI_TRANSITIONS=166} [2024-06-04 16:49:22,463 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 162 predicate places. [2024-06-04 16:49:22,463 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 166 transitions, 1762 flow [2024-06-04 16:49:22,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:22,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:22,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:22,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 16:49:22,463 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:22,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:22,464 INFO L85 PathProgramCache]: Analyzing trace with hash -297225299, now seen corresponding path program 6 times [2024-06-04 16:49:22,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:22,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675698028] [2024-06-04 16:49:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:22,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:27,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:27,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675698028] [2024-06-04 16:49:27,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675698028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:27,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:27,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:49:27,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713482361] [2024-06-04 16:49:27,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:27,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:49:27,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:27,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:49:27,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:49:27,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:49:27,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 166 transitions, 1762 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:27,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:27,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:49:27,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:28,180 INFO L124 PetriNetUnfolderBase]: 364/705 cut-off events. [2024-06-04 16:49:28,181 INFO L125 PetriNetUnfolderBase]: For 21431/21431 co-relation queries the response was YES. [2024-06-04 16:49:28,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4462 conditions, 705 events. 364/705 cut-off events. For 21431/21431 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3644 event pairs, 70 based on Foata normal form. 2/707 useless extension candidates. Maximal degree in co-relation 4371. Up to 628 conditions per place. [2024-06-04 16:49:28,186 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 161 selfloop transitions, 17 changer transitions 0/181 dead transitions. [2024-06-04 16:49:28,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 181 transitions, 2188 flow [2024-06-04 16:49:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:49:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:49:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 16:49:28,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-04 16:49:28,188 INFO L175 Difference]: Start difference. First operand has 192 places, 166 transitions, 1762 flow. Second operand 10 states and 118 transitions. [2024-06-04 16:49:28,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 181 transitions, 2188 flow [2024-06-04 16:49:28,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 181 transitions, 2128 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 16:49:28,235 INFO L231 Difference]: Finished difference. Result has 194 places, 168 transitions, 1785 flow [2024-06-04 16:49:28,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1704, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1785, PETRI_PLACES=194, PETRI_TRANSITIONS=168} [2024-06-04 16:49:28,236 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 164 predicate places. [2024-06-04 16:49:28,236 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 168 transitions, 1785 flow [2024-06-04 16:49:28,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:28,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:28,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:28,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 16:49:28,236 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:28,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash -297373169, now seen corresponding path program 7 times [2024-06-04 16:49:28,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:28,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773766630] [2024-06-04 16:49:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:28,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:33,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:33,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773766630] [2024-06-04 16:49:33,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773766630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:33,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:33,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:49:33,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108923046] [2024-06-04 16:49:33,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:33,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:49:33,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:33,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:49:33,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:49:33,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:49:33,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 168 transitions, 1785 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:33,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:33,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:49:33,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:34,019 INFO L124 PetriNetUnfolderBase]: 368/713 cut-off events. [2024-06-04 16:49:34,020 INFO L125 PetriNetUnfolderBase]: For 22341/22341 co-relation queries the response was YES. [2024-06-04 16:49:34,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4514 conditions, 713 events. 368/713 cut-off events. For 22341/22341 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3691 event pairs, 70 based on Foata normal form. 2/715 useless extension candidates. Maximal degree in co-relation 4421. Up to 631 conditions per place. [2024-06-04 16:49:34,032 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 164 selfloop transitions, 16 changer transitions 0/183 dead transitions. [2024-06-04 16:49:34,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 183 transitions, 2205 flow [2024-06-04 16:49:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:49:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:49:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 16:49:34,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-04 16:49:34,035 INFO L175 Difference]: Start difference. First operand has 194 places, 168 transitions, 1785 flow. Second operand 10 states and 118 transitions. [2024-06-04 16:49:34,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 183 transitions, 2205 flow [2024-06-04 16:49:34,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 183 transitions, 2154 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 16:49:34,099 INFO L231 Difference]: Finished difference. Result has 197 places, 169 transitions, 1798 flow [2024-06-04 16:49:34,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1798, PETRI_PLACES=197, PETRI_TRANSITIONS=169} [2024-06-04 16:49:34,101 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places. [2024-06-04 16:49:34,101 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 169 transitions, 1798 flow [2024-06-04 16:49:34,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:34,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:34,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:34,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 16:49:34,101 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:34,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:34,102 INFO L85 PathProgramCache]: Analyzing trace with hash -291647438, now seen corresponding path program 1 times [2024-06-04 16:49:34,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:34,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44021047] [2024-06-04 16:49:34,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:34,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:39,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:39,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44021047] [2024-06-04 16:49:39,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44021047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:39,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:39,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:49:39,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608993895] [2024-06-04 16:49:39,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:39,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:49:39,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:39,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:49:39,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:49:39,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:49:39,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 169 transitions, 1798 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:39,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:39,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:49:39,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:40,375 INFO L124 PetriNetUnfolderBase]: 394/767 cut-off events. [2024-06-04 16:49:40,376 INFO L125 PetriNetUnfolderBase]: For 33332/33332 co-relation queries the response was YES. [2024-06-04 16:49:40,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4817 conditions, 767 events. 394/767 cut-off events. For 33332/33332 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4050 event pairs, 76 based on Foata normal form. 12/779 useless extension candidates. Maximal degree in co-relation 4723. Up to 633 conditions per place. [2024-06-04 16:49:40,382 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 160 selfloop transitions, 21 changer transitions 7/191 dead transitions. [2024-06-04 16:49:40,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 191 transitions, 2337 flow [2024-06-04 16:49:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:49:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:49:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 16:49:40,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-04 16:49:40,391 INFO L175 Difference]: Start difference. First operand has 197 places, 169 transitions, 1798 flow. Second operand 11 states and 136 transitions. [2024-06-04 16:49:40,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 191 transitions, 2337 flow [2024-06-04 16:49:40,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 191 transitions, 2283 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-04 16:49:40,453 INFO L231 Difference]: Finished difference. Result has 201 places, 170 transitions, 1814 flow [2024-06-04 16:49:40,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1744, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1814, PETRI_PLACES=201, PETRI_TRANSITIONS=170} [2024-06-04 16:49:40,454 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 171 predicate places. [2024-06-04 16:49:40,454 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 170 transitions, 1814 flow [2024-06-04 16:49:40,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:40,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:40,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:40,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 16:49:40,455 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:40,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:40,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1656601909, now seen corresponding path program 1 times [2024-06-04 16:49:40,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:40,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232254558] [2024-06-04 16:49:40,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:40,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:45,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:45,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232254558] [2024-06-04 16:49:45,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232254558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:45,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:45,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:49:45,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537950091] [2024-06-04 16:49:45,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:45,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:49:45,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:45,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:49:45,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:49:46,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:49:46,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 170 transitions, 1814 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:46,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:46,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:49:46,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:46,482 INFO L124 PetriNetUnfolderBase]: 373/723 cut-off events. [2024-06-04 16:49:46,482 INFO L125 PetriNetUnfolderBase]: For 23238/23238 co-relation queries the response was YES. [2024-06-04 16:49:46,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4590 conditions, 723 events. 373/723 cut-off events. For 23238/23238 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3758 event pairs, 46 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 4494. Up to 601 conditions per place. [2024-06-04 16:49:46,488 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 144 selfloop transitions, 41 changer transitions 0/188 dead transitions. [2024-06-04 16:49:46,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 188 transitions, 2298 flow [2024-06-04 16:49:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:49:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:49:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-04 16:49:46,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-04 16:49:46,489 INFO L175 Difference]: Start difference. First operand has 201 places, 170 transitions, 1814 flow. Second operand 11 states and 133 transitions. [2024-06-04 16:49:46,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 188 transitions, 2298 flow [2024-06-04 16:49:46,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 188 transitions, 2239 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-04 16:49:46,545 INFO L231 Difference]: Finished difference. Result has 205 places, 175 transitions, 1945 flow [2024-06-04 16:49:46,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1945, PETRI_PLACES=205, PETRI_TRANSITIONS=175} [2024-06-04 16:49:46,546 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2024-06-04 16:49:46,546 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 175 transitions, 1945 flow [2024-06-04 16:49:46,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:46,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:46,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:46,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 16:49:46,547 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:46,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:46,547 INFO L85 PathProgramCache]: Analyzing trace with hash 835380139, now seen corresponding path program 2 times [2024-06-04 16:49:46,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:46,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565854191] [2024-06-04 16:49:46,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:46,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:52,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:52,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565854191] [2024-06-04 16:49:52,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565854191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:52,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:52,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:49:52,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538113535] [2024-06-04 16:49:52,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:52,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:49:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:52,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:49:52,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:49:52,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:49:52,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 175 transitions, 1945 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:52,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:52,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:49:52,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:52,775 INFO L124 PetriNetUnfolderBase]: 379/736 cut-off events. [2024-06-04 16:49:52,775 INFO L125 PetriNetUnfolderBase]: For 24342/24342 co-relation queries the response was YES. [2024-06-04 16:49:52,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4729 conditions, 736 events. 379/736 cut-off events. For 24342/24342 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3857 event pairs, 72 based on Foata normal form. 1/737 useless extension candidates. Maximal degree in co-relation 4631. Up to 636 conditions per place. [2024-06-04 16:49:52,781 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 160 selfloop transitions, 28 changer transitions 0/191 dead transitions. [2024-06-04 16:49:52,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 191 transitions, 2415 flow [2024-06-04 16:49:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:49:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:49:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 16:49:52,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-04 16:49:52,783 INFO L175 Difference]: Start difference. First operand has 205 places, 175 transitions, 1945 flow. Second operand 10 states and 125 transitions. [2024-06-04 16:49:52,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 191 transitions, 2415 flow [2024-06-04 16:49:52,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 191 transitions, 2301 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-04 16:49:52,842 INFO L231 Difference]: Finished difference. Result has 208 places, 179 transitions, 1975 flow [2024-06-04 16:49:52,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1831, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1975, PETRI_PLACES=208, PETRI_TRANSITIONS=179} [2024-06-04 16:49:52,842 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-04 16:49:52,842 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 179 transitions, 1975 flow [2024-06-04 16:49:52,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:52,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:52,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:52,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 16:49:52,843 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:52,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash -273787953, now seen corresponding path program 8 times [2024-06-04 16:49:52,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:52,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354501969] [2024-06-04 16:49:52,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:52,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:58,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:58,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354501969] [2024-06-04 16:49:58,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354501969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:58,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:58,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:49:58,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381001766] [2024-06-04 16:49:58,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:58,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:49:58,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:58,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:49:58,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:49:58,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:49:58,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 179 transitions, 1975 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:58,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:58,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:49:58,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:59,073 INFO L124 PetriNetUnfolderBase]: 383/744 cut-off events. [2024-06-04 16:49:59,073 INFO L125 PetriNetUnfolderBase]: For 26499/26499 co-relation queries the response was YES. [2024-06-04 16:49:59,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4765 conditions, 744 events. 383/744 cut-off events. For 26499/26499 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3921 event pairs, 57 based on Foata normal form. 2/746 useless extension candidates. Maximal degree in co-relation 4666. Up to 613 conditions per place. [2024-06-04 16:49:59,080 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 164 selfloop transitions, 27 changer transitions 0/194 dead transitions. [2024-06-04 16:49:59,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 194 transitions, 2419 flow [2024-06-04 16:49:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:49:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:49:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-04 16:49:59,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-04 16:49:59,081 INFO L175 Difference]: Start difference. First operand has 208 places, 179 transitions, 1975 flow. Second operand 9 states and 110 transitions. [2024-06-04 16:49:59,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 194 transitions, 2419 flow [2024-06-04 16:49:59,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 194 transitions, 2339 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-04 16:49:59,148 INFO L231 Difference]: Finished difference. Result has 210 places, 180 transitions, 1987 flow [2024-06-04 16:49:59,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1987, PETRI_PLACES=210, PETRI_TRANSITIONS=180} [2024-06-04 16:49:59,149 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2024-06-04 16:49:59,149 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 180 transitions, 1987 flow [2024-06-04 16:49:59,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:59,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:59,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:59,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 16:49:59,150 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:59,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash -994581109, now seen corresponding path program 9 times [2024-06-04 16:49:59,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:59,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718943064] [2024-06-04 16:49:59,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:59,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:05,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:05,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718943064] [2024-06-04 16:50:05,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718943064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:05,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:05,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:50:05,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942742961] [2024-06-04 16:50:05,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:05,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:50:05,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:05,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:50:05,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:50:05,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:50:05,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 180 transitions, 1987 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:05,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:05,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:50:05,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:05,629 INFO L124 PetriNetUnfolderBase]: 387/752 cut-off events. [2024-06-04 16:50:05,629 INFO L125 PetriNetUnfolderBase]: For 27635/27635 co-relation queries the response was YES. [2024-06-04 16:50:05,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4860 conditions, 752 events. 387/752 cut-off events. For 27635/27635 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3979 event pairs, 74 based on Foata normal form. 2/754 useless extension candidates. Maximal degree in co-relation 4760. Up to 658 conditions per place. [2024-06-04 16:50:05,636 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 168 selfloop transitions, 22 changer transitions 0/193 dead transitions. [2024-06-04 16:50:05,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 193 transitions, 2433 flow [2024-06-04 16:50:05,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:50:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:50:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 16:50:05,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-04 16:50:05,637 INFO L175 Difference]: Start difference. First operand has 210 places, 180 transitions, 1987 flow. Second operand 9 states and 107 transitions. [2024-06-04 16:50:05,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 193 transitions, 2433 flow [2024-06-04 16:50:05,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 193 transitions, 2351 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-04 16:50:05,701 INFO L231 Difference]: Finished difference. Result has 213 places, 182 transitions, 2004 flow [2024-06-04 16:50:05,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1909, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2004, PETRI_PLACES=213, PETRI_TRANSITIONS=182} [2024-06-04 16:50:05,702 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 183 predicate places. [2024-06-04 16:50:05,702 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 182 transitions, 2004 flow [2024-06-04 16:50:05,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:05,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:05,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:05,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 16:50:05,703 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:05,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:05,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1627028931, now seen corresponding path program 10 times [2024-06-04 16:50:05,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:05,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973969844] [2024-06-04 16:50:05,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:05,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:10,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:10,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973969844] [2024-06-04 16:50:10,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973969844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:10,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:10,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:50:10,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115693457] [2024-06-04 16:50:10,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:10,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:50:10,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:10,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:50:10,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:50:10,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:50:10,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 182 transitions, 2004 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:10,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:10,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:50:10,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:10,648 INFO L124 PetriNetUnfolderBase]: 391/760 cut-off events. [2024-06-04 16:50:10,648 INFO L125 PetriNetUnfolderBase]: For 26600/26600 co-relation queries the response was YES. [2024-06-04 16:50:10,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4859 conditions, 760 events. 391/760 cut-off events. For 26600/26600 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4031 event pairs, 70 based on Foata normal form. 2/762 useless extension candidates. Maximal degree in co-relation 4757. Up to 656 conditions per place. [2024-06-04 16:50:10,655 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 171 selfloop transitions, 21 changer transitions 0/195 dead transitions. [2024-06-04 16:50:10,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 195 transitions, 2444 flow [2024-06-04 16:50:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:50:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:50:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 16:50:10,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-04 16:50:10,657 INFO L175 Difference]: Start difference. First operand has 213 places, 182 transitions, 2004 flow. Second operand 9 states and 107 transitions. [2024-06-04 16:50:10,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 195 transitions, 2444 flow [2024-06-04 16:50:10,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 195 transitions, 2381 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-04 16:50:10,724 INFO L231 Difference]: Finished difference. Result has 216 places, 183 transitions, 2019 flow [2024-06-04 16:50:10,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2019, PETRI_PLACES=216, PETRI_TRANSITIONS=183} [2024-06-04 16:50:10,725 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 186 predicate places. [2024-06-04 16:50:10,725 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 183 transitions, 2019 flow [2024-06-04 16:50:10,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:10,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:10,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:10,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 16:50:10,726 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:10,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash -989218729, now seen corresponding path program 11 times [2024-06-04 16:50:10,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:10,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907107563] [2024-06-04 16:50:10,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:10,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:17,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:17,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907107563] [2024-06-04 16:50:17,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907107563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:17,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:17,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:50:17,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477547177] [2024-06-04 16:50:17,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:17,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:50:17,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:17,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:50:17,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:50:17,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 16:50:17,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 183 transitions, 2019 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:17,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:17,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 16:50:17,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:17,784 INFO L124 PetriNetUnfolderBase]: 395/768 cut-off events. [2024-06-04 16:50:17,784 INFO L125 PetriNetUnfolderBase]: For 26662/26662 co-relation queries the response was YES. [2024-06-04 16:50:17,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4898 conditions, 768 events. 395/768 cut-off events. For 26662/26662 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4082 event pairs, 74 based on Foata normal form. 2/770 useless extension candidates. Maximal degree in co-relation 4795. Up to 662 conditions per place. [2024-06-04 16:50:17,791 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 164 selfloop transitions, 28 changer transitions 0/195 dead transitions. [2024-06-04 16:50:17,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 195 transitions, 2457 flow [2024-06-04 16:50:17,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:50:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:50:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 16:50:17,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229390681003584 [2024-06-04 16:50:17,793 INFO L175 Difference]: Start difference. First operand has 216 places, 183 transitions, 2019 flow. Second operand 9 states and 118 transitions. [2024-06-04 16:50:17,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 195 transitions, 2457 flow [2024-06-04 16:50:17,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 195 transitions, 2391 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 16:50:17,858 INFO L231 Difference]: Finished difference. Result has 218 places, 184 transitions, 2045 flow [2024-06-04 16:50:17,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1955, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2045, PETRI_PLACES=218, PETRI_TRANSITIONS=184} [2024-06-04 16:50:17,858 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 188 predicate places. [2024-06-04 16:50:17,858 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 184 transitions, 2045 flow [2024-06-04 16:50:17,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:17,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:17,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:17,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 16:50:17,859 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:17,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1471271901, now seen corresponding path program 3 times [2024-06-04 16:50:17,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:17,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695341151] [2024-06-04 16:50:17,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:17,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:24,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:24,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:24,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695341151] [2024-06-04 16:50:24,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695341151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:24,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:24,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:50:24,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269973023] [2024-06-04 16:50:24,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:24,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:50:24,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:24,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:50:24,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:50:24,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:50:24,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 184 transitions, 2045 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:24,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:24,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:50:24,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:25,011 INFO L124 PetriNetUnfolderBase]: 398/773 cut-off events. [2024-06-04 16:50:25,012 INFO L125 PetriNetUnfolderBase]: For 25500/25500 co-relation queries the response was YES. [2024-06-04 16:50:25,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4935 conditions, 773 events. 398/773 cut-off events. For 25500/25500 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4095 event pairs, 74 based on Foata normal form. 1/774 useless extension candidates. Maximal degree in co-relation 4831. Up to 630 conditions per place. [2024-06-04 16:50:25,018 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 145 selfloop transitions, 50 changer transitions 0/198 dead transitions. [2024-06-04 16:50:25,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 198 transitions, 2613 flow [2024-06-04 16:50:25,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:50:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:50:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 16:50:25,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 16:50:25,021 INFO L175 Difference]: Start difference. First operand has 218 places, 184 transitions, 2045 flow. Second operand 10 states and 124 transitions. [2024-06-04 16:50:25,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 198 transitions, 2613 flow [2024-06-04 16:50:25,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 198 transitions, 2539 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 16:50:25,100 INFO L231 Difference]: Finished difference. Result has 221 places, 186 transitions, 2133 flow [2024-06-04 16:50:25,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1971, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2133, PETRI_PLACES=221, PETRI_TRANSITIONS=186} [2024-06-04 16:50:25,100 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 191 predicate places. [2024-06-04 16:50:25,101 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 186 transitions, 2133 flow [2024-06-04 16:50:25,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:25,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:25,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:25,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 16:50:25,101 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:25,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1632746943, now seen corresponding path program 4 times [2024-06-04 16:50:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:25,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630230672] [2024-06-04 16:50:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:30,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:30,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630230672] [2024-06-04 16:50:30,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630230672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:30,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:30,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:50:30,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956562105] [2024-06-04 16:50:30,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:30,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:50:30,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:30,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:50:30,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:50:30,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:50:30,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 186 transitions, 2133 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:30,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:30,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:50:30,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:30,988 INFO L124 PetriNetUnfolderBase]: 396/770 cut-off events. [2024-06-04 16:50:30,988 INFO L125 PetriNetUnfolderBase]: For 25030/25030 co-relation queries the response was YES. [2024-06-04 16:50:30,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4887 conditions, 770 events. 396/770 cut-off events. For 25030/25030 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4101 event pairs, 74 based on Foata normal form. 1/771 useless extension candidates. Maximal degree in co-relation 4782. Up to 649 conditions per place. [2024-06-04 16:50:30,996 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 154 selfloop transitions, 41 changer transitions 0/198 dead transitions. [2024-06-04 16:50:30,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 198 transitions, 2564 flow [2024-06-04 16:50:30,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:50:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:50:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 16:50:30,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 16:50:30,997 INFO L175 Difference]: Start difference. First operand has 221 places, 186 transitions, 2133 flow. Second operand 10 states and 120 transitions. [2024-06-04 16:50:30,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 198 transitions, 2564 flow [2024-06-04 16:50:31,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 198 transitions, 2390 flow, removed 36 selfloop flow, removed 8 redundant places. [2024-06-04 16:50:31,064 INFO L231 Difference]: Finished difference. Result has 224 places, 187 transitions, 2080 flow [2024-06-04 16:50:31,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1961, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2080, PETRI_PLACES=224, PETRI_TRANSITIONS=187} [2024-06-04 16:50:31,065 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 194 predicate places. [2024-06-04 16:50:31,065 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 187 transitions, 2080 flow [2024-06-04 16:50:31,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:31,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:31,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:31,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 16:50:31,066 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:31,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:31,066 INFO L85 PathProgramCache]: Analyzing trace with hash -989003248, now seen corresponding path program 2 times [2024-06-04 16:50:31,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:31,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409383457] [2024-06-04 16:50:31,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:31,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:36,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:36,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409383457] [2024-06-04 16:50:36,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409383457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:36,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:36,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:50:36,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391675570] [2024-06-04 16:50:36,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:36,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:50:36,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:36,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:50:36,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:50:36,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:50:36,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 187 transitions, 2080 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:36,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:36,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:50:36,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:36,710 INFO L124 PetriNetUnfolderBase]: 412/806 cut-off events. [2024-06-04 16:50:36,711 INFO L125 PetriNetUnfolderBase]: For 36464/36464 co-relation queries the response was YES. [2024-06-04 16:50:36,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 806 events. 412/806 cut-off events. For 36464/36464 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4334 event pairs, 78 based on Foata normal form. 10/816 useless extension candidates. Maximal degree in co-relation 4953. Up to 656 conditions per place. [2024-06-04 16:50:36,718 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 163 selfloop transitions, 33 changer transitions 4/203 dead transitions. [2024-06-04 16:50:36,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 203 transitions, 2588 flow [2024-06-04 16:50:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:50:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:50:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 16:50:36,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 16:50:36,719 INFO L175 Difference]: Start difference. First operand has 224 places, 187 transitions, 2080 flow. Second operand 10 states and 124 transitions. [2024-06-04 16:50:36,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 203 transitions, 2588 flow [2024-06-04 16:50:36,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 203 transitions, 2444 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-04 16:50:36,791 INFO L231 Difference]: Finished difference. Result has 225 places, 187 transitions, 2022 flow [2024-06-04 16:50:36,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1936, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2022, PETRI_PLACES=225, PETRI_TRANSITIONS=187} [2024-06-04 16:50:36,792 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 195 predicate places. [2024-06-04 16:50:36,792 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 187 transitions, 2022 flow [2024-06-04 16:50:36,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:36,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:36,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:36,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 16:50:36,793 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:36,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:36,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2040929599, now seen corresponding path program 12 times [2024-06-04 16:50:36,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:36,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120872649] [2024-06-04 16:50:36,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:36,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:42,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:42,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120872649] [2024-06-04 16:50:42,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120872649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:42,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:42,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:50:42,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695066615] [2024-06-04 16:50:42,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:42,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:50:42,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:42,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:50:42,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:50:42,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:50:42,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 187 transitions, 2022 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:42,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:42,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:50:42,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:42,717 INFO L124 PetriNetUnfolderBase]: 410/804 cut-off events. [2024-06-04 16:50:42,717 INFO L125 PetriNetUnfolderBase]: For 27453/27453 co-relation queries the response was YES. [2024-06-04 16:50:42,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5031 conditions, 804 events. 410/804 cut-off events. For 27453/27453 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4340 event pairs, 83 based on Foata normal form. 2/806 useless extension candidates. Maximal degree in co-relation 4923. Up to 710 conditions per place. [2024-06-04 16:50:42,724 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 173 selfloop transitions, 22 changer transitions 0/198 dead transitions. [2024-06-04 16:50:42,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 198 transitions, 2472 flow [2024-06-04 16:50:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:50:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:50:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 16:50:42,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-04 16:50:42,725 INFO L175 Difference]: Start difference. First operand has 225 places, 187 transitions, 2022 flow. Second operand 9 states and 107 transitions. [2024-06-04 16:50:42,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 198 transitions, 2472 flow [2024-06-04 16:50:42,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 198 transitions, 2366 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 16:50:42,793 INFO L231 Difference]: Finished difference. Result has 226 places, 189 transitions, 2011 flow [2024-06-04 16:50:42,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2011, PETRI_PLACES=226, PETRI_TRANSITIONS=189} [2024-06-04 16:50:42,793 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 196 predicate places. [2024-06-04 16:50:42,793 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 189 transitions, 2011 flow [2024-06-04 16:50:42,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:42,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:42,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:42,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 16:50:42,794 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:42,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:42,794 INFO L85 PathProgramCache]: Analyzing trace with hash 107480223, now seen corresponding path program 13 times [2024-06-04 16:50:42,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:42,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044488510] [2024-06-04 16:50:42,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:42,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:48,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:48,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044488510] [2024-06-04 16:50:48,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044488510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:48,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:48,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:50:48,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667130395] [2024-06-04 16:50:48,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:48,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:50:48,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:48,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:50:48,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:50:48,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:50:48,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 189 transitions, 2011 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-04 16:50:48,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:48,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:50:48,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:49,022 INFO L124 PetriNetUnfolderBase]: 414/812 cut-off events. [2024-06-04 16:50:49,023 INFO L125 PetriNetUnfolderBase]: For 27686/27686 co-relation queries the response was YES. [2024-06-04 16:50:49,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5039 conditions, 812 events. 414/812 cut-off events. For 27686/27686 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4411 event pairs, 81 based on Foata normal form. 2/814 useless extension candidates. Maximal degree in co-relation 4930. Up to 713 conditions per place. [2024-06-04 16:50:49,030 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 176 selfloop transitions, 21 changer transitions 0/200 dead transitions. [2024-06-04 16:50:49,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 200 transitions, 2457 flow [2024-06-04 16:50:49,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:50:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:50:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 16:50:49,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-04 16:50:49,039 INFO L175 Difference]: Start difference. First operand has 226 places, 189 transitions, 2011 flow. Second operand 9 states and 98 transitions. [2024-06-04 16:50:49,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 200 transitions, 2457 flow [2024-06-04 16:50:49,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 200 transitions, 2392 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 16:50:49,115 INFO L231 Difference]: Finished difference. Result has 229 places, 190 transitions, 2024 flow [2024-06-04 16:50:49,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2024, PETRI_PLACES=229, PETRI_TRANSITIONS=190} [2024-06-04 16:50:49,115 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-04 16:50:49,116 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 190 transitions, 2024 flow [2024-06-04 16:50:49,116 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-04 16:50:49,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:49,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:49,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 16:50:49,116 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:49,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:49,117 INFO L85 PathProgramCache]: Analyzing trace with hash 191055161, now seen corresponding path program 14 times [2024-06-04 16:50:49,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:49,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588938509] [2024-06-04 16:50:49,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:49,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:55,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:55,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588938509] [2024-06-04 16:50:55,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588938509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:55,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:55,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:50:55,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652525409] [2024-06-04 16:50:55,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:55,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:50:55,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:55,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:50:55,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:50:55,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:50:55,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 190 transitions, 2024 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:55,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:55,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:50:55,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:55,820 INFO L124 PetriNetUnfolderBase]: 418/820 cut-off events. [2024-06-04 16:50:55,820 INFO L125 PetriNetUnfolderBase]: For 28827/28827 co-relation queries the response was YES. [2024-06-04 16:50:55,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5095 conditions, 820 events. 418/820 cut-off events. For 28827/28827 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4455 event pairs, 83 based on Foata normal form. 2/822 useless extension candidates. Maximal degree in co-relation 4985. Up to 693 conditions per place. [2024-06-04 16:50:55,827 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 159 selfloop transitions, 38 changer transitions 0/200 dead transitions. [2024-06-04 16:50:55,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 200 transitions, 2470 flow [2024-06-04 16:50:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:50:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:50:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 16:50:55,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-04 16:50:55,828 INFO L175 Difference]: Start difference. First operand has 229 places, 190 transitions, 2024 flow. Second operand 9 states and 109 transitions. [2024-06-04 16:50:55,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 200 transitions, 2470 flow [2024-06-04 16:50:55,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 200 transitions, 2402 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 16:50:55,908 INFO L231 Difference]: Finished difference. Result has 231 places, 191 transitions, 2070 flow [2024-06-04 16:50:55,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1956, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2070, PETRI_PLACES=231, PETRI_TRANSITIONS=191} [2024-06-04 16:50:55,908 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places. [2024-06-04 16:50:55,908 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 191 transitions, 2070 flow [2024-06-04 16:50:55,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:55,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:55,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:55,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 16:50:55,909 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:55,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:55,910 INFO L85 PathProgramCache]: Analyzing trace with hash 112990473, now seen corresponding path program 15 times [2024-06-04 16:50:55,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:55,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871132969] [2024-06-04 16:50:55,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:55,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:51:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:51:03,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:51:03,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871132969] [2024-06-04 16:51:03,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871132969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:51:03,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:51:03,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:51:03,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27599534] [2024-06-04 16:51:03,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:51:03,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:51:03,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:51:03,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:51:03,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:51:03,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:51:03,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 191 transitions, 2070 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:03,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:51:03,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:51:03,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:51:03,901 INFO L124 PetriNetUnfolderBase]: 415/815 cut-off events. [2024-06-04 16:51:03,901 INFO L125 PetriNetUnfolderBase]: For 26844/26844 co-relation queries the response was YES. [2024-06-04 16:51:03,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4957 conditions, 815 events. 415/815 cut-off events. For 26844/26844 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4413 event pairs, 82 based on Foata normal form. 2/817 useless extension candidates. Maximal degree in co-relation 4846. Up to 715 conditions per place. [2024-06-04 16:51:03,908 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 172 selfloop transitions, 25 changer transitions 0/200 dead transitions. [2024-06-04 16:51:03,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 200 transitions, 2484 flow [2024-06-04 16:51:03,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:51:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:51:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 16:51:03,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-04 16:51:03,910 INFO L175 Difference]: Start difference. First operand has 231 places, 191 transitions, 2070 flow. Second operand 9 states and 109 transitions. [2024-06-04 16:51:03,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 200 transitions, 2484 flow [2024-06-04 16:51:03,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 200 transitions, 2370 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 16:51:03,993 INFO L231 Difference]: Finished difference. Result has 232 places, 191 transitions, 2010 flow [2024-06-04 16:51:03,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1956, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2010, PETRI_PLACES=232, PETRI_TRANSITIONS=191} [2024-06-04 16:51:03,994 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 202 predicate places. [2024-06-04 16:51:03,994 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 191 transitions, 2010 flow [2024-06-04 16:51:03,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:03,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:51:03,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:51:03,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 16:51:03,994 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:51:03,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:51:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash 113198235, now seen corresponding path program 5 times [2024-06-04 16:51:03,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:51:03,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81895183] [2024-06-04 16:51:03,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:51:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:51:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:51:09,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-04 16:51:09,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:51:09,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81895183] [2024-06-04 16:51:09,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81895183] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:51:09,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:51:09,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:51:09,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872952992] [2024-06-04 16:51:09,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:51:09,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:51:09,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:51:09,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:51:09,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:51:09,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:51:09,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 191 transitions, 2010 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:09,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:51:09,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:51:09,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:51:09,988 INFO L124 PetriNetUnfolderBase]: 418/820 cut-off events. [2024-06-04 16:51:09,988 INFO L125 PetriNetUnfolderBase]: For 25982/25982 co-relation queries the response was YES. [2024-06-04 16:51:09,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4932 conditions, 820 events. 418/820 cut-off events. For 25982/25982 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4458 event pairs, 82 based on Foata normal form. 1/821 useless extension candidates. Maximal degree in co-relation 4821. Up to 698 conditions per place. [2024-06-04 16:51:09,995 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 163 selfloop transitions, 37 changer transitions 0/203 dead transitions. [2024-06-04 16:51:09,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 203 transitions, 2582 flow [2024-06-04 16:51:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:51:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:51:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 16:51:09,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967741935483871 [2024-06-04 16:51:09,997 INFO L175 Difference]: Start difference. First operand has 232 places, 191 transitions, 2010 flow. Second operand 10 states and 123 transitions. [2024-06-04 16:51:09,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 203 transitions, 2582 flow [2024-06-04 16:51:10,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 203 transitions, 2433 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-04 16:51:10,086 INFO L231 Difference]: Finished difference. Result has 233 places, 193 transitions, 1984 flow [2024-06-04 16:51:10,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1984, PETRI_PLACES=233, PETRI_TRANSITIONS=193} [2024-06-04 16:51:10,086 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2024-06-04 16:51:10,086 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 193 transitions, 1984 flow [2024-06-04 16:51:10,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:10,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:51:10,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:51:10,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 16:51:10,087 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:51:10,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:51:10,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1155300197, now seen corresponding path program 6 times [2024-06-04 16:51:10,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:51:10,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636258501] [2024-06-04 16:51:10,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:51:10,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:51:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:51:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:51:15,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:51:15,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636258501] [2024-06-04 16:51:15,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636258501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:51:15,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:51:15,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:51:15,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465982880] [2024-06-04 16:51:15,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:51:15,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:51:15,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:51:15,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:51:15,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:51:15,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:51:15,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 193 transitions, 1984 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:15,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:51:15,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:51:15,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:51:16,412 INFO L124 PetriNetUnfolderBase]: 416/816 cut-off events. [2024-06-04 16:51:16,412 INFO L125 PetriNetUnfolderBase]: For 24865/24865 co-relation queries the response was YES. [2024-06-04 16:51:16,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4733 conditions, 816 events. 416/816 cut-off events. For 24865/24865 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4418 event pairs, 117 based on Foata normal form. 1/817 useless extension candidates. Maximal degree in co-relation 4622. Up to 746 conditions per place. [2024-06-04 16:51:16,419 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 182 selfloop transitions, 17 changer transitions 0/202 dead transitions. [2024-06-04 16:51:16,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 202 transitions, 2402 flow [2024-06-04 16:51:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:51:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:51:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-04 16:51:16,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2024-06-04 16:51:16,421 INFO L175 Difference]: Start difference. First operand has 233 places, 193 transitions, 1984 flow. Second operand 10 states and 114 transitions. [2024-06-04 16:51:16,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 202 transitions, 2402 flow [2024-06-04 16:51:16,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 202 transitions, 2260 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-04 16:51:16,490 INFO L231 Difference]: Finished difference. Result has 235 places, 193 transitions, 1881 flow [2024-06-04 16:51:16,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1881, PETRI_PLACES=235, PETRI_TRANSITIONS=193} [2024-06-04 16:51:16,491 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 205 predicate places. [2024-06-04 16:51:16,491 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 193 transitions, 1881 flow [2024-06-04 16:51:16,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:16,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:51:16,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:51:16,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 16:51:16,491 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:51:16,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:51:16,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1716269584, now seen corresponding path program 3 times [2024-06-04 16:51:16,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:51:16,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035323620] [2024-06-04 16:51:16,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:51:16,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:51:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:51:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:51:21,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:51:21,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035323620] [2024-06-04 16:51:21,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035323620] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:51:21,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:51:21,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:51:21,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436211799] [2024-06-04 16:51:21,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:51:21,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:51:21,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:51:21,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:51:21,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:51:21,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:51:21,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 193 transitions, 1881 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:21,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:51:21,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:51:21,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:51:21,822 INFO L124 PetriNetUnfolderBase]: 432/852 cut-off events. [2024-06-04 16:51:21,823 INFO L125 PetriNetUnfolderBase]: For 38542/38542 co-relation queries the response was YES. [2024-06-04 16:51:21,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4853 conditions, 852 events. 432/852 cut-off events. For 38542/38542 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4675 event pairs, 63 based on Foata normal form. 10/862 useless extension candidates. Maximal degree in co-relation 4741. Up to 687 conditions per place. [2024-06-04 16:51:21,829 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 162 selfloop transitions, 38 changer transitions 4/207 dead transitions. [2024-06-04 16:51:21,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 207 transitions, 2391 flow [2024-06-04 16:51:21,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:51:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:51:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 16:51:21,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-04 16:51:21,831 INFO L175 Difference]: Start difference. First operand has 235 places, 193 transitions, 1881 flow. Second operand 10 states and 125 transitions. [2024-06-04 16:51:21,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 207 transitions, 2391 flow [2024-06-04 16:51:21,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 207 transitions, 2321 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-04 16:51:21,920 INFO L231 Difference]: Finished difference. Result has 235 places, 193 transitions, 1908 flow [2024-06-04 16:51:21,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1908, PETRI_PLACES=235, PETRI_TRANSITIONS=193} [2024-06-04 16:51:21,920 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 205 predicate places. [2024-06-04 16:51:21,920 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 193 transitions, 1908 flow [2024-06-04 16:51:21,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:21,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:51:21,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:51:21,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 16:51:21,921 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:51:21,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:51:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash 112996425, now seen corresponding path program 7 times [2024-06-04 16:51:21,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:51:21,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814128715] [2024-06-04 16:51:21,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:51:21,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:51:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:51:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:51:28,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:51:28,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814128715] [2024-06-04 16:51:28,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814128715] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:51:28,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:51:28,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:51:28,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001243626] [2024-06-04 16:51:28,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:51:28,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:51:28,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:51:28,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:51:28,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:51:28,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:51:28,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 193 transitions, 1908 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:28,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:51:28,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:51:28,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:51:28,788 INFO L124 PetriNetUnfolderBase]: 424/840 cut-off events. [2024-06-04 16:51:28,788 INFO L125 PetriNetUnfolderBase]: For 25337/25337 co-relation queries the response was YES. [2024-06-04 16:51:28,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4767 conditions, 840 events. 424/840 cut-off events. For 25337/25337 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4630 event pairs, 86 based on Foata normal form. 1/841 useless extension candidates. Maximal degree in co-relation 4654. Up to 731 conditions per place. [2024-06-04 16:51:28,796 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 168 selfloop transitions, 31 changer transitions 0/202 dead transitions. [2024-06-04 16:51:28,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 202 transitions, 2326 flow [2024-06-04 16:51:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:51:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:51:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-04 16:51:28,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2024-06-04 16:51:28,797 INFO L175 Difference]: Start difference. First operand has 235 places, 193 transitions, 1908 flow. Second operand 10 states and 121 transitions. [2024-06-04 16:51:28,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 202 transitions, 2326 flow [2024-06-04 16:51:28,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 202 transitions, 2198 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-04 16:51:28,878 INFO L231 Difference]: Finished difference. Result has 236 places, 193 transitions, 1847 flow [2024-06-04 16:51:28,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1847, PETRI_PLACES=236, PETRI_TRANSITIONS=193} [2024-06-04 16:51:28,878 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 206 predicate places. [2024-06-04 16:51:28,878 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 193 transitions, 1847 flow [2024-06-04 16:51:28,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:28,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:51:28,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:51:28,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 16:51:28,879 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:51:28,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:51:28,879 INFO L85 PathProgramCache]: Analyzing trace with hash 191061113, now seen corresponding path program 8 times [2024-06-04 16:51:28,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:51:28,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013509575] [2024-06-04 16:51:28,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:51:28,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:51:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:51:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:51:34,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:51:34,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013509575] [2024-06-04 16:51:34,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013509575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:51:34,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:51:34,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:51:34,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663110076] [2024-06-04 16:51:34,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:51:34,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:51:34,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:51:34,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:51:34,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:51:34,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:51:34,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 193 transitions, 1847 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:34,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:51:34,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:51:34,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:51:34,882 INFO L124 PetriNetUnfolderBase]: 427/845 cut-off events. [2024-06-04 16:51:34,883 INFO L125 PetriNetUnfolderBase]: For 25982/25982 co-relation queries the response was YES. [2024-06-04 16:51:34,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4763 conditions, 845 events. 427/845 cut-off events. For 25982/25982 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4669 event pairs, 86 based on Foata normal form. 1/846 useless extension candidates. Maximal degree in co-relation 4650. Up to 667 conditions per place. [2024-06-04 16:51:34,890 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 138 selfloop transitions, 65 changer transitions 0/206 dead transitions. [2024-06-04 16:51:34,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 206 transitions, 2331 flow [2024-06-04 16:51:34,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:51:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:51:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-04 16:51:34,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3844086021505376 [2024-06-04 16:51:34,892 INFO L175 Difference]: Start difference. First operand has 236 places, 193 transitions, 1847 flow. Second operand 12 states and 143 transitions. [2024-06-04 16:51:34,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 206 transitions, 2331 flow [2024-06-04 16:51:34,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 206 transitions, 2254 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 16:51:34,979 INFO L231 Difference]: Finished difference. Result has 239 places, 195 transitions, 1966 flow [2024-06-04 16:51:34,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1966, PETRI_PLACES=239, PETRI_TRANSITIONS=195} [2024-06-04 16:51:34,980 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 209 predicate places. [2024-06-04 16:51:34,980 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 195 transitions, 1966 flow [2024-06-04 16:51:34,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:34,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:51:34,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:51:34,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 16:51:34,981 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:51:34,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:51:34,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1841420047, now seen corresponding path program 9 times [2024-06-04 16:51:34,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:51:34,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188629467] [2024-06-04 16:51:34,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:51:34,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:51:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:51:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:51:40,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:51:40,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188629467] [2024-06-04 16:51:40,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188629467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:51:40,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:51:40,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:51:40,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401827586] [2024-06-04 16:51:40,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:51:40,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:51:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:51:40,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:51:40,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:51:40,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:51:40,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 195 transitions, 1966 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:40,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:51:40,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:51:40,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:51:40,786 INFO L124 PetriNetUnfolderBase]: 430/852 cut-off events. [2024-06-04 16:51:40,786 INFO L125 PetriNetUnfolderBase]: For 27447/27447 co-relation queries the response was YES. [2024-06-04 16:51:40,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4935 conditions, 852 events. 430/852 cut-off events. For 27447/27447 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4719 event pairs, 86 based on Foata normal form. 1/853 useless extension candidates. Maximal degree in co-relation 4821. Up to 672 conditions per place. [2024-06-04 16:51:40,794 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 140 selfloop transitions, 64 changer transitions 0/207 dead transitions. [2024-06-04 16:51:40,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 207 transitions, 2454 flow [2024-06-04 16:51:40,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:51:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:51:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 16:51:40,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-04 16:51:40,795 INFO L175 Difference]: Start difference. First operand has 239 places, 195 transitions, 1966 flow. Second operand 11 states and 134 transitions. [2024-06-04 16:51:40,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 207 transitions, 2454 flow [2024-06-04 16:51:40,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 207 transitions, 2274 flow, removed 25 selfloop flow, removed 12 redundant places. [2024-06-04 16:51:40,885 INFO L231 Difference]: Finished difference. Result has 238 places, 197 transitions, 1984 flow [2024-06-04 16:51:40,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1786, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1984, PETRI_PLACES=238, PETRI_TRANSITIONS=197} [2024-06-04 16:51:40,886 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2024-06-04 16:51:40,913 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 197 transitions, 1984 flow [2024-06-04 16:51:40,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:40,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:51:40,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:51:40,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 16:51:40,914 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:51:40,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:51:40,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1155292478, now seen corresponding path program 4 times [2024-06-04 16:51:40,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:51:40,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866064977] [2024-06-04 16:51:40,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:51:40,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:51:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:51:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:51:46,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:51:46,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866064977] [2024-06-04 16:51:46,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866064977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:51:46,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:51:46,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:51:46,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146127560] [2024-06-04 16:51:46,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:51:46,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:51:46,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:51:46,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:51:46,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:51:46,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 16:51:46,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 197 transitions, 1984 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:46,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:51:46,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 16:51:46,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:51:46,493 INFO L124 PetriNetUnfolderBase]: 434/859 cut-off events. [2024-06-04 16:51:46,493 INFO L125 PetriNetUnfolderBase]: For 28550/28550 co-relation queries the response was YES. [2024-06-04 16:51:46,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4966 conditions, 859 events. 434/859 cut-off events. For 28550/28550 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4759 event pairs, 123 based on Foata normal form. 2/861 useless extension candidates. Maximal degree in co-relation 4853. Up to 776 conditions per place. [2024-06-04 16:51:46,501 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 186 selfloop transitions, 18 changer transitions 0/207 dead transitions. [2024-06-04 16:51:46,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 207 transitions, 2438 flow [2024-06-04 16:51:46,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:51:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:51:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-04 16:51:46,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154 [2024-06-04 16:51:46,502 INFO L175 Difference]: Start difference. First operand has 238 places, 197 transitions, 1984 flow. Second operand 9 states and 115 transitions. [2024-06-04 16:51:46,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 207 transitions, 2438 flow [2024-06-04 16:51:46,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 207 transitions, 2261 flow, removed 26 selfloop flow, removed 10 redundant places. [2024-06-04 16:51:46,586 INFO L231 Difference]: Finished difference. Result has 237 places, 198 transitions, 1876 flow [2024-06-04 16:51:46,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1807, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1876, PETRI_PLACES=237, PETRI_TRANSITIONS=198} [2024-06-04 16:51:46,587 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 207 predicate places. [2024-06-04 16:51:46,587 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 198 transitions, 1876 flow [2024-06-04 16:51:46,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:46,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:51:46,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:51:46,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 16:51:46,588 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:51:46,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:51:46,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1145769278, now seen corresponding path program 5 times [2024-06-04 16:51:46,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:51:46,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122660489] [2024-06-04 16:51:46,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:51:46,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:51:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:51:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:51:53,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:51:53,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122660489] [2024-06-04 16:51:53,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122660489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:51:53,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:51:53,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:51:53,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853546069] [2024-06-04 16:51:53,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:51:53,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:51:53,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:51:53,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:51:53,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:51:53,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:51:53,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 198 transitions, 1876 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:53,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:51:53,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:51:53,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:51:54,245 INFO L124 PetriNetUnfolderBase]: 438/867 cut-off events. [2024-06-04 16:51:54,245 INFO L125 PetriNetUnfolderBase]: For 28323/28323 co-relation queries the response was YES. [2024-06-04 16:51:54,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4897 conditions, 867 events. 438/867 cut-off events. For 28323/28323 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4795 event pairs, 121 based on Foata normal form. 2/869 useless extension candidates. Maximal degree in co-relation 4784. Up to 770 conditions per place. [2024-06-04 16:51:54,253 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 187 selfloop transitions, 21 changer transitions 0/211 dead transitions. [2024-06-04 16:51:54,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 211 transitions, 2346 flow [2024-06-04 16:51:54,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:51:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:51:54,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-04 16:51:54,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36656891495601174 [2024-06-04 16:51:54,254 INFO L175 Difference]: Start difference. First operand has 237 places, 198 transitions, 1876 flow. Second operand 11 states and 125 transitions. [2024-06-04 16:51:54,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 211 transitions, 2346 flow [2024-06-04 16:51:54,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 211 transitions, 2289 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-04 16:51:54,347 INFO L231 Difference]: Finished difference. Result has 241 places, 199 transitions, 1895 flow [2024-06-04 16:51:54,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1895, PETRI_PLACES=241, PETRI_TRANSITIONS=199} [2024-06-04 16:51:54,347 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2024-06-04 16:51:54,347 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 199 transitions, 1895 flow [2024-06-04 16:51:54,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:54,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:51:54,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:51:54,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 16:51:54,348 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:51:54,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:51:54,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1411792988, now seen corresponding path program 6 times [2024-06-04 16:51:54,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:51:54,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247014567] [2024-06-04 16:51:54,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:51:54,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:51:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:51:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:51:59,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:51:59,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247014567] [2024-06-04 16:51:59,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247014567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:51:59,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:51:59,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:51:59,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918658650] [2024-06-04 16:51:59,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:51:59,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:51:59,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:51:59,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:51:59,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:51:59,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 16:51:59,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 199 transitions, 1895 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:59,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:51:59,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 16:51:59,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:52:00,071 INFO L124 PetriNetUnfolderBase]: 435/863 cut-off events. [2024-06-04 16:52:00,071 INFO L125 PetriNetUnfolderBase]: For 25586/25586 co-relation queries the response was YES. [2024-06-04 16:52:00,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4734 conditions, 863 events. 435/863 cut-off events. For 25586/25586 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4790 event pairs, 87 based on Foata normal form. 2/865 useless extension candidates. Maximal degree in co-relation 4620. Up to 719 conditions per place. [2024-06-04 16:52:00,079 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 163 selfloop transitions, 43 changer transitions 0/209 dead transitions. [2024-06-04 16:52:00,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 209 transitions, 2329 flow [2024-06-04 16:52:00,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:52:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:52:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-04 16:52:00,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42258064516129035 [2024-06-04 16:52:00,081 INFO L175 Difference]: Start difference. First operand has 241 places, 199 transitions, 1895 flow. Second operand 10 states and 131 transitions. [2024-06-04 16:52:00,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 209 transitions, 2329 flow [2024-06-04 16:52:00,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 209 transitions, 2263 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-04 16:52:00,178 INFO L231 Difference]: Finished difference. Result has 242 places, 199 transitions, 1919 flow [2024-06-04 16:52:00,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1829, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1919, PETRI_PLACES=242, PETRI_TRANSITIONS=199} [2024-06-04 16:52:00,179 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places. [2024-06-04 16:52:00,179 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 199 transitions, 1919 flow [2024-06-04 16:52:00,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:00,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:52:00,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:52:00,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 16:52:00,179 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:52:00,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:52:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1411793267, now seen corresponding path program 10 times [2024-06-04 16:52:00,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:52:00,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921317438] [2024-06-04 16:52:00,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:52:00,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:52:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:52:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:52:05,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:52:05,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921317438] [2024-06-04 16:52:05,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921317438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:52:05,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:52:05,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:52:05,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974613911] [2024-06-04 16:52:05,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:52:05,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:52:05,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:52:05,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:52:05,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:52:05,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:52:05,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 199 transitions, 1919 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:05,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:52:05,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:52:05,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:52:05,588 INFO L124 PetriNetUnfolderBase]: 433/860 cut-off events. [2024-06-04 16:52:05,588 INFO L125 PetriNetUnfolderBase]: For 22643/22643 co-relation queries the response was YES. [2024-06-04 16:52:05,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4655 conditions, 860 events. 433/860 cut-off events. For 22643/22643 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4778 event pairs, 87 based on Foata normal form. 1/861 useless extension candidates. Maximal degree in co-relation 4540. Up to 674 conditions per place. [2024-06-04 16:52:05,596 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 145 selfloop transitions, 62 changer transitions 0/210 dead transitions. [2024-06-04 16:52:05,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 210 transitions, 2415 flow [2024-06-04 16:52:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:52:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:52:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 16:52:05,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 16:52:05,597 INFO L175 Difference]: Start difference. First operand has 242 places, 199 transitions, 1919 flow. Second operand 10 states and 124 transitions. [2024-06-04 16:52:05,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 210 transitions, 2415 flow [2024-06-04 16:52:05,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 210 transitions, 2259 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-04 16:52:05,681 INFO L231 Difference]: Finished difference. Result has 242 places, 201 transitions, 1958 flow [2024-06-04 16:52:05,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1763, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1958, PETRI_PLACES=242, PETRI_TRANSITIONS=201} [2024-06-04 16:52:05,681 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places. [2024-06-04 16:52:05,681 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 201 transitions, 1958 flow [2024-06-04 16:52:05,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:05,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:52:05,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:52:05,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 16:52:05,682 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:52:05,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:52:05,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1874740344, now seen corresponding path program 1 times [2024-06-04 16:52:05,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:52:05,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635780282] [2024-06-04 16:52:05,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:52:05,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:52:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:52:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:52:10,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:52:10,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635780282] [2024-06-04 16:52:10,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635780282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:52:10,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:52:10,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:52:10,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186607309] [2024-06-04 16:52:10,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:52:10,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:52:10,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:52:10,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:52:10,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:52:11,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:52:11,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 201 transitions, 1958 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:11,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:52:11,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:52:11,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:52:11,410 INFO L124 PetriNetUnfolderBase]: 449/896 cut-off events. [2024-06-04 16:52:11,410 INFO L125 PetriNetUnfolderBase]: For 34647/34647 co-relation queries the response was YES. [2024-06-04 16:52:11,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4791 conditions, 896 events. 449/896 cut-off events. For 34647/34647 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5024 event pairs, 73 based on Foata normal form. 8/904 useless extension candidates. Maximal degree in co-relation 4676. Up to 756 conditions per place. [2024-06-04 16:52:11,417 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 191 selfloop transitions, 15 changer transitions 16/225 dead transitions. [2024-06-04 16:52:11,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 225 transitions, 2503 flow [2024-06-04 16:52:11,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:52:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:52:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 16:52:11,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-04 16:52:11,419 INFO L175 Difference]: Start difference. First operand has 242 places, 201 transitions, 1958 flow. Second operand 11 states and 134 transitions. [2024-06-04 16:52:11,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 225 transitions, 2503 flow [2024-06-04 16:52:11,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 225 transitions, 2303 flow, removed 38 selfloop flow, removed 7 redundant places. [2024-06-04 16:52:11,505 INFO L231 Difference]: Finished difference. Result has 247 places, 198 transitions, 1769 flow [2024-06-04 16:52:11,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1758, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1769, PETRI_PLACES=247, PETRI_TRANSITIONS=198} [2024-06-04 16:52:11,506 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 217 predicate places. [2024-06-04 16:52:11,506 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 198 transitions, 1769 flow [2024-06-04 16:52:11,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:11,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:52:11,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:52:11,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 16:52:11,506 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:52:11,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:52:11,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1018124030, now seen corresponding path program 2 times [2024-06-04 16:52:11,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:52:11,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581227050] [2024-06-04 16:52:11,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:52:11,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:52:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:52:15,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-04 16:52:15,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:52:15,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581227050] [2024-06-04 16:52:15,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581227050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:52:15,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:52:15,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:52:15,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428482125] [2024-06-04 16:52:15,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:52:15,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:52:15,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:52:15,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:52:15,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:52:16,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:52:16,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 198 transitions, 1769 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:16,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:52:16,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:52:16,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:52:16,391 INFO L124 PetriNetUnfolderBase]: 437/874 cut-off events. [2024-06-04 16:52:16,391 INFO L125 PetriNetUnfolderBase]: For 39917/39917 co-relation queries the response was YES. [2024-06-04 16:52:16,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4605 conditions, 874 events. 437/874 cut-off events. For 39917/39917 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4906 event pairs, 74 based on Foata normal form. 10/884 useless extension candidates. Maximal degree in co-relation 4489. Up to 738 conditions per place. [2024-06-04 16:52:16,398 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 186 selfloop transitions, 18 changer transitions 12/219 dead transitions. [2024-06-04 16:52:16,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 219 transitions, 2343 flow [2024-06-04 16:52:16,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:52:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:52:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 16:52:16,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-04 16:52:16,399 INFO L175 Difference]: Start difference. First operand has 247 places, 198 transitions, 1769 flow. Second operand 11 states and 134 transitions. [2024-06-04 16:52:16,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 219 transitions, 2343 flow [2024-06-04 16:52:16,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 219 transitions, 2305 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 16:52:16,479 INFO L231 Difference]: Finished difference. Result has 242 places, 194 transitions, 1732 flow [2024-06-04 16:52:16,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1732, PETRI_PLACES=242, PETRI_TRANSITIONS=194} [2024-06-04 16:52:16,479 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places. [2024-06-04 16:52:16,480 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 194 transitions, 1732 flow [2024-06-04 16:52:16,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:16,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:52:16,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:52:16,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 16:52:16,480 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:52:16,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:52:16,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1994169400, now seen corresponding path program 3 times [2024-06-04 16:52:16,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:52:16,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419884972] [2024-06-04 16:52:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:52:16,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:52:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:52:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:52:23,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:52:23,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419884972] [2024-06-04 16:52:23,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419884972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:52:23,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:52:23,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:52:23,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12278419] [2024-06-04 16:52:23,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:52:23,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:52:23,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:52:23,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:52:23,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:52:23,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:52:23,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 194 transitions, 1732 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:23,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:52:23,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:52:23,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:52:24,180 INFO L124 PetriNetUnfolderBase]: 421/842 cut-off events. [2024-06-04 16:52:24,180 INFO L125 PetriNetUnfolderBase]: For 25692/25692 co-relation queries the response was YES. [2024-06-04 16:52:24,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4372 conditions, 842 events. 421/842 cut-off events. For 25692/25692 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4683 event pairs, 62 based on Foata normal form. 2/844 useless extension candidates. Maximal degree in co-relation 4259. Up to 740 conditions per place. [2024-06-04 16:52:24,187 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 190 selfloop transitions, 20 changer transitions 0/213 dead transitions. [2024-06-04 16:52:24,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 213 transitions, 2219 flow [2024-06-04 16:52:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:52:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:52:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-04 16:52:24,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-04 16:52:24,189 INFO L175 Difference]: Start difference. First operand has 242 places, 194 transitions, 1732 flow. Second operand 11 states and 129 transitions. [2024-06-04 16:52:24,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 213 transitions, 2219 flow [2024-06-04 16:52:24,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 213 transitions, 2177 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 16:52:24,261 INFO L231 Difference]: Finished difference. Result has 241 places, 196 transitions, 1765 flow [2024-06-04 16:52:24,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1765, PETRI_PLACES=241, PETRI_TRANSITIONS=196} [2024-06-04 16:52:24,261 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2024-06-04 16:52:24,261 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 196 transitions, 1765 flow [2024-06-04 16:52:24,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:24,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:52:24,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:52:24,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 16:52:24,262 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:52:24,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:52:24,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1989873730, now seen corresponding path program 4 times [2024-06-04 16:52:24,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:52:24,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239594350] [2024-06-04 16:52:24,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:52:24,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:52:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:52:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:52:29,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:52:29,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239594350] [2024-06-04 16:52:29,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239594350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:52:29,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:52:29,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:52:29,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751178945] [2024-06-04 16:52:29,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:52:29,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:52:29,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:52:29,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:52:29,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:52:30,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:52:30,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 196 transitions, 1765 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:30,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:52:30,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:52:30,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:52:30,466 INFO L124 PetriNetUnfolderBase]: 433/870 cut-off events. [2024-06-04 16:52:30,467 INFO L125 PetriNetUnfolderBase]: For 34976/34976 co-relation queries the response was YES. [2024-06-04 16:52:30,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4538 conditions, 870 events. 433/870 cut-off events. For 34976/34976 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4864 event pairs, 66 based on Foata normal form. 8/878 useless extension candidates. Maximal degree in co-relation 4425. Up to 739 conditions per place. [2024-06-04 16:52:30,475 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 186 selfloop transitions, 16 changer transitions 12/217 dead transitions. [2024-06-04 16:52:30,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 217 transitions, 2287 flow [2024-06-04 16:52:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:52:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:52:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-04 16:52:30,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 16:52:30,476 INFO L175 Difference]: Start difference. First operand has 241 places, 196 transitions, 1765 flow. Second operand 11 states and 132 transitions. [2024-06-04 16:52:30,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 217 transitions, 2287 flow [2024-06-04 16:52:30,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 217 transitions, 2231 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 16:52:30,570 INFO L231 Difference]: Finished difference. Result has 244 places, 193 transitions, 1720 flow [2024-06-04 16:52:30,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1709, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1720, PETRI_PLACES=244, PETRI_TRANSITIONS=193} [2024-06-04 16:52:30,570 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2024-06-04 16:52:30,571 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 193 transitions, 1720 flow [2024-06-04 16:52:30,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:30,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:52:30,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:52:30,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 16:52:30,571 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:52:30,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:52:30,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1661736278, now seen corresponding path program 5 times [2024-06-04 16:52:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:52:30,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680618296] [2024-06-04 16:52:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:52:30,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:52:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:52:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:52:36,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:52:36,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680618296] [2024-06-04 16:52:36,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680618296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:52:36,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:52:36,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:52:36,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735161657] [2024-06-04 16:52:36,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:52:36,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:52:36,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:52:36,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:52:36,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:52:36,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:52:36,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 193 transitions, 1720 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:36,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:52:36,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:52:36,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:52:37,369 INFO L124 PetriNetUnfolderBase]: 419/840 cut-off events. [2024-06-04 16:52:37,369 INFO L125 PetriNetUnfolderBase]: For 26454/26454 co-relation queries the response was YES. [2024-06-04 16:52:37,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4375 conditions, 840 events. 419/840 cut-off events. For 26454/26454 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4653 event pairs, 47 based on Foata normal form. 2/842 useless extension candidates. Maximal degree in co-relation 4261. Up to 699 conditions per place. [2024-06-04 16:52:37,377 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 191 selfloop transitions, 21 changer transitions 0/215 dead transitions. [2024-06-04 16:52:37,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 215 transitions, 2219 flow [2024-06-04 16:52:37,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:52:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:52:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-04 16:52:37,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-04 16:52:37,378 INFO L175 Difference]: Start difference. First operand has 244 places, 193 transitions, 1720 flow. Second operand 11 states and 130 transitions. [2024-06-04 16:52:37,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 215 transitions, 2219 flow [2024-06-04 16:52:37,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 215 transitions, 2181 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 16:52:37,460 INFO L231 Difference]: Finished difference. Result has 241 places, 195 transitions, 1761 flow [2024-06-04 16:52:37,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1682, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1761, PETRI_PLACES=241, PETRI_TRANSITIONS=195} [2024-06-04 16:52:37,461 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2024-06-04 16:52:37,461 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 195 transitions, 1761 flow [2024-06-04 16:52:37,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:37,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:52:37,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:52:37,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 16:52:37,462 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:52:37,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:52:37,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1846843162, now seen corresponding path program 6 times [2024-06-04 16:52:37,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:52:37,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234600775] [2024-06-04 16:52:37,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:52:37,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:52:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:52:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:52:44,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:52:44,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234600775] [2024-06-04 16:52:44,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234600775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:52:44,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:52:44,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:52:44,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481633022] [2024-06-04 16:52:44,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:52:44,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:52:44,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:52:44,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:52:44,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:52:44,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:52:44,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 195 transitions, 1761 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:44,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:52:44,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:52:44,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:52:44,580 INFO L124 PetriNetUnfolderBase]: 427/856 cut-off events. [2024-06-04 16:52:44,580 INFO L125 PetriNetUnfolderBase]: For 26824/26824 co-relation queries the response was YES. [2024-06-04 16:52:44,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4497 conditions, 856 events. 427/856 cut-off events. For 26824/26824 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4769 event pairs, 70 based on Foata normal form. 2/858 useless extension candidates. Maximal degree in co-relation 4384. Up to 751 conditions per place. [2024-06-04 16:52:44,588 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 197 selfloop transitions, 16 changer transitions 0/216 dead transitions. [2024-06-04 16:52:44,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 216 transitions, 2266 flow [2024-06-04 16:52:44,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:52:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:52:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-04 16:52:44,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-04 16:52:44,590 INFO L175 Difference]: Start difference. First operand has 241 places, 195 transitions, 1761 flow. Second operand 11 states and 130 transitions. [2024-06-04 16:52:44,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 216 transitions, 2266 flow [2024-06-04 16:52:44,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 216 transitions, 2206 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-04 16:52:44,679 INFO L231 Difference]: Finished difference. Result has 245 places, 197 transitions, 1774 flow [2024-06-04 16:52:44,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1701, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1774, PETRI_PLACES=245, PETRI_TRANSITIONS=197} [2024-06-04 16:52:44,679 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2024-06-04 16:52:44,680 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 197 transitions, 1774 flow [2024-06-04 16:52:44,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:44,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:52:44,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:52:44,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 16:52:44,680 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:52:44,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:52:44,681 INFO L85 PathProgramCache]: Analyzing trace with hash 297414426, now seen corresponding path program 7 times [2024-06-04 16:52:44,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:52:44,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591485655] [2024-06-04 16:52:44,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:52:44,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:52:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:52:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:52:50,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:52:50,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591485655] [2024-06-04 16:52:50,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591485655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:52:50,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:52:50,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:52:50,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869052486] [2024-06-04 16:52:50,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:52:50,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:52:50,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:52:50,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:52:50,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:52:50,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:52:50,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 197 transitions, 1774 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:50,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:52:50,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:52:50,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:52:50,673 INFO L124 PetriNetUnfolderBase]: 439/884 cut-off events. [2024-06-04 16:52:50,673 INFO L125 PetriNetUnfolderBase]: For 37980/37980 co-relation queries the response was YES. [2024-06-04 16:52:50,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4627 conditions, 884 events. 439/884 cut-off events. For 37980/37980 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4952 event pairs, 72 based on Foata normal form. 8/892 useless extension candidates. Maximal degree in co-relation 4512. Up to 764 conditions per place. [2024-06-04 16:52:50,682 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 189 selfloop transitions, 13 changer transitions 12/217 dead transitions. [2024-06-04 16:52:50,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 217 transitions, 2298 flow [2024-06-04 16:52:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:52:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:52:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 16:52:50,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3841642228739003 [2024-06-04 16:52:50,684 INFO L175 Difference]: Start difference. First operand has 245 places, 197 transitions, 1774 flow. Second operand 11 states and 131 transitions. [2024-06-04 16:52:50,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 217 transitions, 2298 flow [2024-06-04 16:52:50,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 217 transitions, 2244 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-04 16:52:50,791 INFO L231 Difference]: Finished difference. Result has 248 places, 194 transitions, 1725 flow [2024-06-04 16:52:50,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1720, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1725, PETRI_PLACES=248, PETRI_TRANSITIONS=194} [2024-06-04 16:52:50,791 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2024-06-04 16:52:50,791 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 194 transitions, 1725 flow [2024-06-04 16:52:50,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:50,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:52:50,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:52:50,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-04 16:52:50,792 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:52:50,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:52:50,793 INFO L85 PathProgramCache]: Analyzing trace with hash 302176026, now seen corresponding path program 8 times [2024-06-04 16:52:50,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:52:50,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555040157] [2024-06-04 16:52:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:52:50,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:52:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:52:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:52:57,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:52:57,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555040157] [2024-06-04 16:52:57,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555040157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:52:57,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:52:57,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:52:57,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879275612] [2024-06-04 16:52:57,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:52:57,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:52:57,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:52:57,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:52:57,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:52:57,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:52:57,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 194 transitions, 1725 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:57,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:52:57,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:52:57,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:52:57,594 INFO L124 PetriNetUnfolderBase]: 421/846 cut-off events. [2024-06-04 16:52:57,594 INFO L125 PetriNetUnfolderBase]: For 28123/28123 co-relation queries the response was YES. [2024-06-04 16:52:57,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4432 conditions, 846 events. 421/846 cut-off events. For 28123/28123 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4714 event pairs, 74 based on Foata normal form. 2/848 useless extension candidates. Maximal degree in co-relation 4316. Up to 760 conditions per place. [2024-06-04 16:52:57,601 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 189 selfloop transitions, 18 changer transitions 0/210 dead transitions. [2024-06-04 16:52:57,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 210 transitions, 2205 flow [2024-06-04 16:52:57,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:52:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:52:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-04 16:52:57,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375366568914956 [2024-06-04 16:52:57,603 INFO L175 Difference]: Start difference. First operand has 248 places, 194 transitions, 1725 flow. Second operand 11 states and 128 transitions. [2024-06-04 16:52:57,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 210 transitions, 2205 flow [2024-06-04 16:52:57,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 210 transitions, 2173 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 16:52:57,712 INFO L231 Difference]: Finished difference. Result has 244 places, 195 transitions, 1763 flow [2024-06-04 16:52:57,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1693, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1763, PETRI_PLACES=244, PETRI_TRANSITIONS=195} [2024-06-04 16:52:57,713 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2024-06-04 16:52:57,713 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 195 transitions, 1763 flow [2024-06-04 16:52:57,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:52:57,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:52:57,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:52:57,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-04 16:52:57,713 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:52:57,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:52:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash 301998396, now seen corresponding path program 9 times [2024-06-04 16:52:57,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:52:57,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432106006] [2024-06-04 16:52:57,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:52:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:52:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:53:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:53:02,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:53:02,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432106006] [2024-06-04 16:53:02,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432106006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:53:02,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:53:02,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:53:02,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272335125] [2024-06-04 16:53:02,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:53:02,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:53:02,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:53:02,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:53:02,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:53:02,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:53:02,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 195 transitions, 1763 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:02,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:53:02,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:53:02,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:53:03,151 INFO L124 PetriNetUnfolderBase]: 429/862 cut-off events. [2024-06-04 16:53:03,152 INFO L125 PetriNetUnfolderBase]: For 28549/28549 co-relation queries the response was YES. [2024-06-04 16:53:03,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4542 conditions, 862 events. 429/862 cut-off events. For 28549/28549 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4823 event pairs, 72 based on Foata normal form. 2/864 useless extension candidates. Maximal degree in co-relation 4428. Up to 762 conditions per place. [2024-06-04 16:53:03,158 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 191 selfloop transitions, 19 changer transitions 0/213 dead transitions. [2024-06-04 16:53:03,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 213 transitions, 2258 flow [2024-06-04 16:53:03,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:53:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:53:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-04 16:53:03,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-04 16:53:03,159 INFO L175 Difference]: Start difference. First operand has 244 places, 195 transitions, 1763 flow. Second operand 11 states and 130 transitions. [2024-06-04 16:53:03,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 213 transitions, 2258 flow [2024-06-04 16:53:03,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 213 transitions, 2182 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-04 16:53:03,244 INFO L231 Difference]: Finished difference. Result has 247 places, 197 transitions, 1772 flow [2024-06-04 16:53:03,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1772, PETRI_PLACES=247, PETRI_TRANSITIONS=197} [2024-06-04 16:53:03,244 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 217 predicate places. [2024-06-04 16:53:03,244 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 197 transitions, 1772 flow [2024-06-04 16:53:03,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:03,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:53:03,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:53:03,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-04 16:53:03,245 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:53:03,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:53:03,245 INFO L85 PathProgramCache]: Analyzing trace with hash -457637250, now seen corresponding path program 10 times [2024-06-04 16:53:03,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:53:03,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208447258] [2024-06-04 16:53:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:53:03,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:53:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:53:07,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-04 16:53:07,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:53:07,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208447258] [2024-06-04 16:53:07,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208447258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:53:07,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:53:07,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:53:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253730066] [2024-06-04 16:53:07,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:53:07,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:53:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:53:07,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:53:07,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:53:07,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:53:07,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 197 transitions, 1772 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:07,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:53:07,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:53:07,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:53:08,097 INFO L124 PetriNetUnfolderBase]: 433/870 cut-off events. [2024-06-04 16:53:08,097 INFO L125 PetriNetUnfolderBase]: For 29366/29366 co-relation queries the response was YES. [2024-06-04 16:53:08,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4596 conditions, 870 events. 433/870 cut-off events. For 29366/29366 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4881 event pairs, 76 based on Foata normal form. 2/872 useless extension candidates. Maximal degree in co-relation 4480. Up to 762 conditions per place. [2024-06-04 16:53:08,105 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 178 selfloop transitions, 31 changer transitions 0/212 dead transitions. [2024-06-04 16:53:08,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 212 transitions, 2256 flow [2024-06-04 16:53:08,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:53:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:53:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 16:53:08,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-04 16:53:08,108 INFO L175 Difference]: Start difference. First operand has 247 places, 197 transitions, 1772 flow. Second operand 11 states and 134 transitions. [2024-06-04 16:53:08,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 212 transitions, 2256 flow [2024-06-04 16:53:08,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 212 transitions, 2192 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-04 16:53:08,202 INFO L231 Difference]: Finished difference. Result has 250 places, 198 transitions, 1808 flow [2024-06-04 16:53:08,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1708, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1808, PETRI_PLACES=250, PETRI_TRANSITIONS=198} [2024-06-04 16:53:08,202 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 220 predicate places. [2024-06-04 16:53:08,203 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 198 transitions, 1808 flow [2024-06-04 16:53:08,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:08,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:53:08,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:53:08,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-04 16:53:08,203 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:53:08,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:53:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash -406103150, now seen corresponding path program 11 times [2024-06-04 16:53:08,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:53:08,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766584534] [2024-06-04 16:53:08,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:53:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:53:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:53:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:53:14,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:53:14,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766584534] [2024-06-04 16:53:14,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766584534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:53:14,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:53:14,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:53:14,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189262478] [2024-06-04 16:53:14,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:53:14,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:53:14,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:53:14,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:53:14,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:53:14,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:53:14,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 198 transitions, 1808 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:14,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:53:14,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:53:14,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:53:14,692 INFO L124 PetriNetUnfolderBase]: 444/891 cut-off events. [2024-06-04 16:53:14,692 INFO L125 PetriNetUnfolderBase]: For 35233/35233 co-relation queries the response was YES. [2024-06-04 16:53:14,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4918 conditions, 891 events. 444/891 cut-off events. For 35233/35233 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5005 event pairs, 75 based on Foata normal form. 2/893 useless extension candidates. Maximal degree in co-relation 4801. Up to 766 conditions per place. [2024-06-04 16:53:14,701 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 186 selfloop transitions, 28 changer transitions 0/217 dead transitions. [2024-06-04 16:53:14,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 217 transitions, 2476 flow [2024-06-04 16:53:14,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:53:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:53:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2024-06-04 16:53:14,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 16:53:14,702 INFO L175 Difference]: Start difference. First operand has 250 places, 198 transitions, 1808 flow. Second operand 12 states and 144 transitions. [2024-06-04 16:53:14,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 217 transitions, 2476 flow [2024-06-04 16:53:14,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 217 transitions, 2398 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 16:53:14,809 INFO L231 Difference]: Finished difference. Result has 254 places, 200 transitions, 1860 flow [2024-06-04 16:53:14,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1730, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1860, PETRI_PLACES=254, PETRI_TRANSITIONS=200} [2024-06-04 16:53:14,810 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 224 predicate places. [2024-06-04 16:53:14,810 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 200 transitions, 1860 flow [2024-06-04 16:53:14,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:14,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:53:14,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:53:14,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-04 16:53:14,810 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:53:14,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:53:14,811 INFO L85 PathProgramCache]: Analyzing trace with hash -451381140, now seen corresponding path program 12 times [2024-06-04 16:53:14,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:53:14,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100453585] [2024-06-04 16:53:14,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:53:14,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:53:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:53:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:53:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:53:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100453585] [2024-06-04 16:53:21,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100453585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:53:21,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:53:21,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:53:21,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326716121] [2024-06-04 16:53:21,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:53:21,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:53:21,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:53:21,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:53:21,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:53:21,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:53:21,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 200 transitions, 1860 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:21,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:53:21,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:53:21,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:53:21,965 INFO L124 PetriNetUnfolderBase]: 453/914 cut-off events. [2024-06-04 16:53:21,965 INFO L125 PetriNetUnfolderBase]: For 49829/49829 co-relation queries the response was YES. [2024-06-04 16:53:21,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4899 conditions, 914 events. 453/914 cut-off events. For 49829/49829 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5206 event pairs, 82 based on Foata normal form. 10/924 useless extension candidates. Maximal degree in co-relation 4781. Up to 774 conditions per place. [2024-06-04 16:53:21,973 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 181 selfloop transitions, 27 changer transitions 6/217 dead transitions. [2024-06-04 16:53:21,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 217 transitions, 2390 flow [2024-06-04 16:53:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:53:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:53:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 16:53:21,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-04 16:53:21,975 INFO L175 Difference]: Start difference. First operand has 254 places, 200 transitions, 1860 flow. Second operand 11 states and 136 transitions. [2024-06-04 16:53:21,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 217 transitions, 2390 flow [2024-06-04 16:53:22,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 217 transitions, 2295 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-04 16:53:22,085 INFO L231 Difference]: Finished difference. Result has 257 places, 197 transitions, 1793 flow [2024-06-04 16:53:22,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1765, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1793, PETRI_PLACES=257, PETRI_TRANSITIONS=197} [2024-06-04 16:53:22,086 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 227 predicate places. [2024-06-04 16:53:22,086 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 197 transitions, 1793 flow [2024-06-04 16:53:22,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:22,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:53:22,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:53:22,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-04 16:53:22,087 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:53:22,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:53:22,087 INFO L85 PathProgramCache]: Analyzing trace with hash -572336930, now seen corresponding path program 13 times [2024-06-04 16:53:22,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:53:22,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858864812] [2024-06-04 16:53:22,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:53:22,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:53:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:53:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:53:27,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:53:27,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858864812] [2024-06-04 16:53:27,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858864812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:53:27,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:53:27,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:53:27,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380176052] [2024-06-04 16:53:27,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:53:27,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:53:27,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:53:27,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:53:27,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:53:27,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:53:27,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 197 transitions, 1793 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:27,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:53:27,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:53:27,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:53:27,902 INFO L124 PetriNetUnfolderBase]: 448/905 cut-off events. [2024-06-04 16:53:27,903 INFO L125 PetriNetUnfolderBase]: For 43681/43681 co-relation queries the response was YES. [2024-06-04 16:53:27,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4775 conditions, 905 events. 448/905 cut-off events. For 43681/43681 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5103 event pairs, 78 based on Foata normal form. 8/913 useless extension candidates. Maximal degree in co-relation 4655. Up to 794 conditions per place. [2024-06-04 16:53:27,911 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 188 selfloop transitions, 13 changer transitions 11/215 dead transitions. [2024-06-04 16:53:27,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 215 transitions, 2315 flow [2024-06-04 16:53:27,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:53:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:53:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-04 16:53:27,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-04 16:53:27,912 INFO L175 Difference]: Start difference. First operand has 257 places, 197 transitions, 1793 flow. Second operand 11 states and 129 transitions. [2024-06-04 16:53:27,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 215 transitions, 2315 flow [2024-06-04 16:53:28,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 215 transitions, 2247 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-04 16:53:28,027 INFO L231 Difference]: Finished difference. Result has 257 places, 194 transitions, 1712 flow [2024-06-04 16:53:28,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1725, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1712, PETRI_PLACES=257, PETRI_TRANSITIONS=194} [2024-06-04 16:53:28,028 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 227 predicate places. [2024-06-04 16:53:28,028 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 194 transitions, 1712 flow [2024-06-04 16:53:28,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:28,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:53:28,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:53:28,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-04 16:53:28,029 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:53:28,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:53:28,029 INFO L85 PathProgramCache]: Analyzing trace with hash -628632630, now seen corresponding path program 14 times [2024-06-04 16:53:28,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:53:28,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51290358] [2024-06-04 16:53:28,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:53:28,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:53:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:53:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:53:34,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:53:34,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51290358] [2024-06-04 16:53:34,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51290358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:53:34,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:53:34,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:53:34,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919792927] [2024-06-04 16:53:34,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:53:34,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:53:34,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:53:34,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:53:34,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:53:34,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:53:34,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 194 transitions, 1712 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-04 16:53:34,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:53:34,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:53:34,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:53:34,752 INFO L124 PetriNetUnfolderBase]: 433/872 cut-off events. [2024-06-04 16:53:34,752 INFO L125 PetriNetUnfolderBase]: For 32582/32582 co-relation queries the response was YES. [2024-06-04 16:53:34,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4586 conditions, 872 events. 433/872 cut-off events. For 32582/32582 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4902 event pairs, 76 based on Foata normal form. 2/874 useless extension candidates. Maximal degree in co-relation 4465. Up to 780 conditions per place. [2024-06-04 16:53:34,759 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 192 selfloop transitions, 16 changer transitions 0/211 dead transitions. [2024-06-04 16:53:34,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 211 transitions, 2202 flow [2024-06-04 16:53:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:53:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:53:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-04 16:53:34,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-04 16:53:34,760 INFO L175 Difference]: Start difference. First operand has 257 places, 194 transitions, 1712 flow. Second operand 11 states and 116 transitions. [2024-06-04 16:53:34,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 211 transitions, 2202 flow [2024-06-04 16:53:34,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 211 transitions, 2166 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 16:53:34,868 INFO L231 Difference]: Finished difference. Result has 253 places, 195 transitions, 1750 flow [2024-06-04 16:53:34,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1676, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1750, PETRI_PLACES=253, PETRI_TRANSITIONS=195} [2024-06-04 16:53:34,869 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 223 predicate places. [2024-06-04 16:53:34,869 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 195 transitions, 1750 flow [2024-06-04 16:53:34,869 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-04 16:53:34,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:53:34,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:53:34,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-04 16:53:34,870 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:53:34,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:53:34,870 INFO L85 PathProgramCache]: Analyzing trace with hash 302182970, now seen corresponding path program 1 times [2024-06-04 16:53:34,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:53:34,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943896560] [2024-06-04 16:53:34,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:53:34,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:53:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:53:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:53:40,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:53:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943896560] [2024-06-04 16:53:40,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943896560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:53:40,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:53:40,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:53:40,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065794068] [2024-06-04 16:53:40,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:53:40,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:53:40,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:53:40,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:53:40,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:53:40,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:53:40,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 195 transitions, 1750 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:40,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:53:40,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:53:40,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:53:40,820 INFO L124 PetriNetUnfolderBase]: 445/900 cut-off events. [2024-06-04 16:53:40,821 INFO L125 PetriNetUnfolderBase]: For 47277/47277 co-relation queries the response was YES. [2024-06-04 16:53:40,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4778 conditions, 900 events. 445/900 cut-off events. For 47277/47277 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5117 event pairs, 72 based on Foata normal form. 8/908 useless extension candidates. Maximal degree in co-relation 4659. Up to 776 conditions per place. [2024-06-04 16:53:40,829 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 183 selfloop transitions, 19 changer transitions 9/214 dead transitions. [2024-06-04 16:53:40,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 214 transitions, 2280 flow [2024-06-04 16:53:40,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:53:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:53:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-04 16:53:40,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-04 16:53:40,831 INFO L175 Difference]: Start difference. First operand has 253 places, 195 transitions, 1750 flow. Second operand 12 states and 141 transitions. [2024-06-04 16:53:40,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 214 transitions, 2280 flow [2024-06-04 16:53:40,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 214 transitions, 2216 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-04 16:53:40,954 INFO L231 Difference]: Finished difference. Result has 256 places, 192 transitions, 1708 flow [2024-06-04 16:53:40,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1686, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1708, PETRI_PLACES=256, PETRI_TRANSITIONS=192} [2024-06-04 16:53:40,955 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2024-06-04 16:53:40,955 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 192 transitions, 1708 flow [2024-06-04 16:53:40,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:40,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:53:40,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:53:40,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-04 16:53:40,956 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:53:40,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:53:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash -399662466, now seen corresponding path program 2 times [2024-06-04 16:53:40,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:53:40,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171906084] [2024-06-04 16:53:40,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:53:40,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:53:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:53:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:53:48,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:53:48,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171906084] [2024-06-04 16:53:48,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171906084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:53:48,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:53:48,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:53:48,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819107742] [2024-06-04 16:53:48,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:53:48,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:53:48,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:53:48,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:53:48,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:53:48,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:53:48,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 192 transitions, 1708 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:48,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:53:48,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:53:48,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:53:48,923 INFO L124 PetriNetUnfolderBase]: 440/897 cut-off events. [2024-06-04 16:53:48,924 INFO L125 PetriNetUnfolderBase]: For 48429/48429 co-relation queries the response was YES. [2024-06-04 16:53:48,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4703 conditions, 897 events. 440/897 cut-off events. For 48429/48429 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5111 event pairs, 86 based on Foata normal form. 8/905 useless extension candidates. Maximal degree in co-relation 4583. Up to 773 conditions per place. [2024-06-04 16:53:48,932 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 178 selfloop transitions, 20 changer transitions 9/210 dead transitions. [2024-06-04 16:53:48,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 210 transitions, 2226 flow [2024-06-04 16:53:48,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:53:48,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:53:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-04 16:53:48,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3844086021505376 [2024-06-04 16:53:48,933 INFO L175 Difference]: Start difference. First operand has 256 places, 192 transitions, 1708 flow. Second operand 12 states and 143 transitions. [2024-06-04 16:53:48,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 210 transitions, 2226 flow [2024-06-04 16:53:49,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 210 transitions, 2184 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-04 16:53:49,053 INFO L231 Difference]: Finished difference. Result has 255 places, 189 transitions, 1675 flow [2024-06-04 16:53:49,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1666, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1675, PETRI_PLACES=255, PETRI_TRANSITIONS=189} [2024-06-04 16:53:49,053 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places. [2024-06-04 16:53:49,053 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 189 transitions, 1675 flow [2024-06-04 16:53:49,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:49,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:53:49,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:53:49,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-04 16:53:49,054 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:53:49,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:53:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash -399423456, now seen corresponding path program 3 times [2024-06-04 16:53:49,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:53:49,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885520845] [2024-06-04 16:53:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:53:49,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:53:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:53:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:53:54,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:53:54,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885520845] [2024-06-04 16:53:54,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885520845] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:53:54,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:53:54,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:53:54,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194326749] [2024-06-04 16:53:54,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:53:54,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:53:54,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:53:54,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:53:54,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:53:54,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:53:54,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 189 transitions, 1675 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:54,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:53:54,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:53:54,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:53:55,040 INFO L124 PetriNetUnfolderBase]: 453/928 cut-off events. [2024-06-04 16:53:55,040 INFO L125 PetriNetUnfolderBase]: For 61603/61603 co-relation queries the response was YES. [2024-06-04 16:53:55,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5435 conditions, 928 events. 453/928 cut-off events. For 61603/61603 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5312 event pairs, 92 based on Foata normal form. 6/934 useless extension candidates. Maximal degree in co-relation 5315. Up to 733 conditions per place. [2024-06-04 16:53:55,053 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 181 selfloop transitions, 19 changer transitions 7/210 dead transitions. [2024-06-04 16:53:55,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 210 transitions, 2379 flow [2024-06-04 16:53:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:53:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:53:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-04 16:53:55,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2024-06-04 16:53:55,055 INFO L175 Difference]: Start difference. First operand has 255 places, 189 transitions, 1675 flow. Second operand 11 states and 138 transitions. [2024-06-04 16:53:55,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 210 transitions, 2379 flow [2024-06-04 16:53:55,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 210 transitions, 2331 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 16:53:55,241 INFO L231 Difference]: Finished difference. Result has 252 places, 186 transitions, 1637 flow [2024-06-04 16:53:55,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1637, PETRI_PLACES=252, PETRI_TRANSITIONS=186} [2024-06-04 16:53:55,242 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2024-06-04 16:53:55,242 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 186 transitions, 1637 flow [2024-06-04 16:53:55,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:53:55,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:53:55,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:53:55,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-04 16:53:55,242 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:53:55,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:53:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash -405918576, now seen corresponding path program 4 times [2024-06-04 16:53:55,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:53:55,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751047460] [2024-06-04 16:53:55,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:53:55,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:53:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:54:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:54:02,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:54:02,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751047460] [2024-06-04 16:54:02,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751047460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:54:02,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:54:02,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:54:02,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325465819] [2024-06-04 16:54:02,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:54:02,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:54:02,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:54:02,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:54:02,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:54:02,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:54:02,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 186 transitions, 1637 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:02,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:54:02,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:54:02,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:54:02,965 INFO L124 PetriNetUnfolderBase]: 443/906 cut-off events. [2024-06-04 16:54:02,966 INFO L125 PetriNetUnfolderBase]: For 62366/62366 co-relation queries the response was YES. [2024-06-04 16:54:02,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5136 conditions, 906 events. 443/906 cut-off events. For 62366/62366 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5138 event pairs, 97 based on Foata normal form. 8/914 useless extension candidates. Maximal degree in co-relation 5017. Up to 786 conditions per place. [2024-06-04 16:54:02,974 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 174 selfloop transitions, 18 changer transitions 9/204 dead transitions. [2024-06-04 16:54:02,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 204 transitions, 2143 flow [2024-06-04 16:54:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:54:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:54:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-04 16:54:02,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-04 16:54:02,976 INFO L175 Difference]: Start difference. First operand has 252 places, 186 transitions, 1637 flow. Second operand 12 states and 141 transitions. [2024-06-04 16:54:02,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 204 transitions, 2143 flow [2024-06-04 16:54:03,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 204 transitions, 2101 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 16:54:03,137 INFO L231 Difference]: Finished difference. Result has 250 places, 183 transitions, 1602 flow [2024-06-04 16:54:03,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1602, PETRI_PLACES=250, PETRI_TRANSITIONS=183} [2024-06-04 16:54:03,137 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 220 predicate places. [2024-06-04 16:54:03,137 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 183 transitions, 1602 flow [2024-06-04 16:54:03,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:03,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:54:03,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:54:03,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-04 16:54:03,138 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:54:03,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:54:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1651937802, now seen corresponding path program 15 times [2024-06-04 16:54:03,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:54:03,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230135081] [2024-06-04 16:54:03,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:54:03,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:54:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:54:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:54:08,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:54:08,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230135081] [2024-06-04 16:54:08,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230135081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:54:08,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:54:08,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:54:08,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446378272] [2024-06-04 16:54:08,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:54:08,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:54:08,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:54:08,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:54:08,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:54:08,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:54:08,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 183 transitions, 1602 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-04 16:54:08,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:54:08,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:54:08,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:54:08,844 INFO L124 PetriNetUnfolderBase]: 438/899 cut-off events. [2024-06-04 16:54:08,844 INFO L125 PetriNetUnfolderBase]: For 61640/61640 co-relation queries the response was YES. [2024-06-04 16:54:08,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5076 conditions, 899 events. 438/899 cut-off events. For 61640/61640 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5073 event pairs, 68 based on Foata normal form. 8/907 useless extension candidates. Maximal degree in co-relation 4959. Up to 680 conditions per place. [2024-06-04 16:54:08,852 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 161 selfloop transitions, 12 changer transitions 27/203 dead transitions. [2024-06-04 16:54:08,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 203 transitions, 2106 flow [2024-06-04 16:54:08,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:54:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:54:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-04 16:54:08,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-04 16:54:08,854 INFO L175 Difference]: Start difference. First operand has 250 places, 183 transitions, 1602 flow. Second operand 10 states and 111 transitions. [2024-06-04 16:54:08,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 203 transitions, 2106 flow [2024-06-04 16:54:08,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 203 transitions, 2059 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-04 16:54:08,984 INFO L231 Difference]: Finished difference. Result has 246 places, 169 transitions, 1485 flow [2024-06-04 16:54:08,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1485, PETRI_PLACES=246, PETRI_TRANSITIONS=169} [2024-06-04 16:54:08,984 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2024-06-04 16:54:08,985 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 169 transitions, 1485 flow [2024-06-04 16:54:08,985 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-04 16:54:08,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:54:08,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:54:08,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-04 16:54:08,985 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:54:08,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:54:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1096353428, now seen corresponding path program 16 times [2024-06-04 16:54:08,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:54:08,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310462686] [2024-06-04 16:54:08,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:54:08,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:54:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:54:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:54:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:54:12,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310462686] [2024-06-04 16:54:12,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310462686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:54:12,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:54:12,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:54:12,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694726205] [2024-06-04 16:54:12,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:54:12,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:54:12,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:54:12,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:54:12,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:54:13,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:54:13,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 169 transitions, 1485 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:13,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:54:13,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:54:13,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:54:13,546 INFO L124 PetriNetUnfolderBase]: 385/794 cut-off events. [2024-06-04 16:54:13,546 INFO L125 PetriNetUnfolderBase]: For 67147/67147 co-relation queries the response was YES. [2024-06-04 16:54:13,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4788 conditions, 794 events. 385/794 cut-off events. For 67147/67147 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4398 event pairs, 71 based on Foata normal form. 10/804 useless extension candidates. Maximal degree in co-relation 4684. Up to 637 conditions per place. [2024-06-04 16:54:13,554 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 150 selfloop transitions, 19 changer transitions 14/186 dead transitions. [2024-06-04 16:54:13,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 186 transitions, 2023 flow [2024-06-04 16:54:13,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:54:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:54:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-04 16:54:13,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-04 16:54:13,555 INFO L175 Difference]: Start difference. First operand has 246 places, 169 transitions, 1485 flow. Second operand 10 states and 119 transitions. [2024-06-04 16:54:13,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 186 transitions, 2023 flow [2024-06-04 16:54:13,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 186 transitions, 1971 flow, removed 13 selfloop flow, removed 12 redundant places. [2024-06-04 16:54:13,689 INFO L231 Difference]: Finished difference. Result has 229 places, 163 transitions, 1429 flow [2024-06-04 16:54:13,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1429, PETRI_PLACES=229, PETRI_TRANSITIONS=163} [2024-06-04 16:54:13,692 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-04 16:54:13,692 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 163 transitions, 1429 flow [2024-06-04 16:54:13,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:13,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:54:13,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:54:13,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-04 16:54:13,693 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:54:13,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:54:13,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1769747274, now seen corresponding path program 17 times [2024-06-04 16:54:13,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:54:13,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188918036] [2024-06-04 16:54:13,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:54:13,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:54:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:54:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:54:18,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:54:18,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188918036] [2024-06-04 16:54:18,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188918036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:54:18,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:54:18,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:54:18,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071241497] [2024-06-04 16:54:18,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:54:18,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:54:18,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:54:18,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:54:18,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:54:18,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:54:18,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 163 transitions, 1429 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:18,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:54:18,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:54:18,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:54:18,553 INFO L124 PetriNetUnfolderBase]: 366/761 cut-off events. [2024-06-04 16:54:18,553 INFO L125 PetriNetUnfolderBase]: For 51421/51421 co-relation queries the response was YES. [2024-06-04 16:54:18,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4442 conditions, 761 events. 366/761 cut-off events. For 51421/51421 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4150 event pairs, 52 based on Foata normal form. 8/769 useless extension candidates. Maximal degree in co-relation 4344. Up to 591 conditions per place. [2024-06-04 16:54:18,560 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 142 selfloop transitions, 10 changer transitions 24/179 dead transitions. [2024-06-04 16:54:18,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 179 transitions, 1871 flow [2024-06-04 16:54:18,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:54:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:54:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 16:54:18,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-04 16:54:18,561 INFO L175 Difference]: Start difference. First operand has 229 places, 163 transitions, 1429 flow. Second operand 10 states and 116 transitions. [2024-06-04 16:54:18,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 179 transitions, 1871 flow [2024-06-04 16:54:18,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 179 transitions, 1809 flow, removed 10 selfloop flow, removed 11 redundant places. [2024-06-04 16:54:18,657 INFO L231 Difference]: Finished difference. Result has 223 places, 148 transitions, 1279 flow [2024-06-04 16:54:18,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1279, PETRI_PLACES=223, PETRI_TRANSITIONS=148} [2024-06-04 16:54:18,658 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 193 predicate places. [2024-06-04 16:54:18,658 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 148 transitions, 1279 flow [2024-06-04 16:54:18,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:18,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:54:18,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:54:18,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-04 16:54:18,659 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:54:18,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:54:18,659 INFO L85 PathProgramCache]: Analyzing trace with hash 102509066, now seen corresponding path program 18 times [2024-06-04 16:54:18,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:54:18,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066961868] [2024-06-04 16:54:18,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:54:18,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:54:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:54:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:54:23,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:54:23,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066961868] [2024-06-04 16:54:23,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066961868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:54:23,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:54:23,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:54:23,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747624498] [2024-06-04 16:54:23,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:54:23,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:54:23,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:54:23,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:54:23,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:54:23,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:54:23,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 148 transitions, 1279 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:23,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:54:23,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:54:23,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:54:24,268 INFO L124 PetriNetUnfolderBase]: 325/668 cut-off events. [2024-06-04 16:54:24,268 INFO L125 PetriNetUnfolderBase]: For 37063/37063 co-relation queries the response was YES. [2024-06-04 16:54:24,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3986 conditions, 668 events. 325/668 cut-off events. For 37063/37063 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3484 event pairs, 50 based on Foata normal form. 2/670 useless extension candidates. Maximal degree in co-relation 3891. Up to 577 conditions per place. [2024-06-04 16:54:24,274 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 146 selfloop transitions, 13 changer transitions 1/163 dead transitions. [2024-06-04 16:54:24,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 163 transitions, 1661 flow [2024-06-04 16:54:24,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:54:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:54:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-04 16:54:24,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2024-06-04 16:54:24,275 INFO L175 Difference]: Start difference. First operand has 223 places, 148 transitions, 1279 flow. Second operand 10 states and 113 transitions. [2024-06-04 16:54:24,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 163 transitions, 1661 flow [2024-06-04 16:54:24,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 163 transitions, 1612 flow, removed 12 selfloop flow, removed 14 redundant places. [2024-06-04 16:54:24,374 INFO L231 Difference]: Finished difference. Result has 204 places, 149 transitions, 1292 flow [2024-06-04 16:54:24,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1292, PETRI_PLACES=204, PETRI_TRANSITIONS=149} [2024-06-04 16:54:24,375 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 174 predicate places. [2024-06-04 16:54:24,375 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 149 transitions, 1292 flow [2024-06-04 16:54:24,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:24,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:54:24,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:54:24,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-04 16:54:24,376 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:54:24,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:54:24,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1581649082, now seen corresponding path program 19 times [2024-06-04 16:54:24,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:54:24,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941803746] [2024-06-04 16:54:24,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:54:24,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:54:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:54:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:54:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:54:29,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941803746] [2024-06-04 16:54:29,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941803746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:54:29,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:54:29,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:54:29,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002903769] [2024-06-04 16:54:29,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:54:29,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:54:29,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:54:29,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:54:29,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:54:29,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:54:29,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 149 transitions, 1292 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:29,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:54:29,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:54:29,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:54:30,273 INFO L124 PetriNetUnfolderBase]: 359/742 cut-off events. [2024-06-04 16:54:30,274 INFO L125 PetriNetUnfolderBase]: For 53844/53844 co-relation queries the response was YES. [2024-06-04 16:54:30,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4737 conditions, 742 events. 359/742 cut-off events. For 53844/53844 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3979 event pairs, 70 based on Foata normal form. 8/750 useless extension candidates. Maximal degree in co-relation 4648. Up to 555 conditions per place. [2024-06-04 16:54:30,280 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 142 selfloop transitions, 16 changer transitions 11/172 dead transitions. [2024-06-04 16:54:30,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 172 transitions, 1938 flow [2024-06-04 16:54:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:54:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:54:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 16:54:30,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-04 16:54:30,281 INFO L175 Difference]: Start difference. First operand has 204 places, 149 transitions, 1292 flow. Second operand 10 states and 125 transitions. [2024-06-04 16:54:30,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 172 transitions, 1938 flow [2024-06-04 16:54:30,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 172 transitions, 1890 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-04 16:54:30,396 INFO L231 Difference]: Finished difference. Result has 207 places, 147 transitions, 1267 flow [2024-06-04 16:54:30,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1267, PETRI_PLACES=207, PETRI_TRANSITIONS=147} [2024-06-04 16:54:30,396 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 177 predicate places. [2024-06-04 16:54:30,396 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 147 transitions, 1267 flow [2024-06-04 16:54:30,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:30,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:54:30,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:54:30,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-04 16:54:30,397 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:54:30,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:54:30,397 INFO L85 PathProgramCache]: Analyzing trace with hash 890947948, now seen corresponding path program 20 times [2024-06-04 16:54:30,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:54:30,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705901092] [2024-06-04 16:54:30,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:54:30,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:54:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:54:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:54:36,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:54:36,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705901092] [2024-06-04 16:54:36,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705901092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:54:36,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:54:36,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:54:36,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370153789] [2024-06-04 16:54:36,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:54:36,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:54:36,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:54:36,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:54:36,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:54:36,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:54:36,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 147 transitions, 1267 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:36,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:54:36,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:54:36,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:54:37,135 INFO L124 PetriNetUnfolderBase]: 328/677 cut-off events. [2024-06-04 16:54:37,135 INFO L125 PetriNetUnfolderBase]: For 42570/42570 co-relation queries the response was YES. [2024-06-04 16:54:37,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 677 events. 328/677 cut-off events. For 42570/42570 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3531 event pairs, 61 based on Foata normal form. 2/679 useless extension candidates. Maximal degree in co-relation 4168. Up to 595 conditions per place. [2024-06-04 16:54:37,141 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 138 selfloop transitions, 18 changer transitions 2/161 dead transitions. [2024-06-04 16:54:37,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 161 transitions, 1649 flow [2024-06-04 16:54:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:54:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:54:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 16:54:37,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-04 16:54:37,143 INFO L175 Difference]: Start difference. First operand has 207 places, 147 transitions, 1267 flow. Second operand 10 states and 115 transitions. [2024-06-04 16:54:37,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 161 transitions, 1649 flow [2024-06-04 16:54:37,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 161 transitions, 1606 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 16:54:37,256 INFO L231 Difference]: Finished difference. Result has 208 places, 148 transitions, 1298 flow [2024-06-04 16:54:37,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1298, PETRI_PLACES=208, PETRI_TRANSITIONS=148} [2024-06-04 16:54:37,257 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-04 16:54:37,257 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 148 transitions, 1298 flow [2024-06-04 16:54:37,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:37,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:54:37,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:54:37,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-04 16:54:37,258 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:54:37,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:54:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1577065112, now seen corresponding path program 21 times [2024-06-04 16:54:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:54:37,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852212154] [2024-06-04 16:54:37,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:54:37,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:54:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:54:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:54:42,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:54:42,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852212154] [2024-06-04 16:54:42,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852212154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:54:42,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:54:42,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:54:42,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655188770] [2024-06-04 16:54:42,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:54:42,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:54:42,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:54:42,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:54:42,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:54:42,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:54:42,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 148 transitions, 1298 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:42,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:54:42,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:54:42,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:54:43,024 INFO L124 PetriNetUnfolderBase]: 331/682 cut-off events. [2024-06-04 16:54:43,024 INFO L125 PetriNetUnfolderBase]: For 40987/40987 co-relation queries the response was YES. [2024-06-04 16:54:43,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 682 events. 331/682 cut-off events. For 40987/40987 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3547 event pairs, 46 based on Foata normal form. 2/684 useless extension candidates. Maximal degree in co-relation 4206. Up to 568 conditions per place. [2024-06-04 16:54:43,032 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 138 selfloop transitions, 21 changer transitions 1/163 dead transitions. [2024-06-04 16:54:43,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 163 transitions, 1680 flow [2024-06-04 16:54:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:54:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:54:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 16:54:43,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-04 16:54:43,033 INFO L175 Difference]: Start difference. First operand has 208 places, 148 transitions, 1298 flow. Second operand 10 states and 116 transitions. [2024-06-04 16:54:43,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 163 transitions, 1680 flow [2024-06-04 16:54:43,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 163 transitions, 1614 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-04 16:54:43,140 INFO L231 Difference]: Finished difference. Result has 209 places, 149 transitions, 1312 flow [2024-06-04 16:54:43,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1312, PETRI_PLACES=209, PETRI_TRANSITIONS=149} [2024-06-04 16:54:43,141 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2024-06-04 16:54:43,141 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 149 transitions, 1312 flow [2024-06-04 16:54:43,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:43,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:54:43,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:54:43,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-04 16:54:43,142 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:54:43,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:54:43,142 INFO L85 PathProgramCache]: Analyzing trace with hash -601003860, now seen corresponding path program 22 times [2024-06-04 16:54:43,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:54:43,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520411583] [2024-06-04 16:54:43,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:54:43,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:54:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:54:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:54:49,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:54:49,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520411583] [2024-06-04 16:54:49,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520411583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:54:49,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:54:49,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:54:49,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017837959] [2024-06-04 16:54:49,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:54:49,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:54:49,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:54:49,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:54:49,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:54:49,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:54:49,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 149 transitions, 1312 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:49,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:54:49,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:54:49,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:54:49,415 INFO L124 PetriNetUnfolderBase]: 335/690 cut-off events. [2024-06-04 16:54:49,415 INFO L125 PetriNetUnfolderBase]: For 43313/43313 co-relation queries the response was YES. [2024-06-04 16:54:49,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4369 conditions, 690 events. 335/690 cut-off events. For 43313/43313 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3609 event pairs, 65 based on Foata normal form. 2/692 useless extension candidates. Maximal degree in co-relation 4278. Up to 560 conditions per place. [2024-06-04 16:54:49,421 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 120 selfloop transitions, 38 changer transitions 1/162 dead transitions. [2024-06-04 16:54:49,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 162 transitions, 1690 flow [2024-06-04 16:54:49,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:54:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:54:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 16:54:49,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-04 16:54:49,423 INFO L175 Difference]: Start difference. First operand has 209 places, 149 transitions, 1312 flow. Second operand 10 states and 122 transitions. [2024-06-04 16:54:49,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 162 transitions, 1690 flow [2024-06-04 16:54:49,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 162 transitions, 1620 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-04 16:54:49,530 INFO L231 Difference]: Finished difference. Result has 211 places, 150 transitions, 1358 flow [2024-06-04 16:54:49,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1358, PETRI_PLACES=211, PETRI_TRANSITIONS=150} [2024-06-04 16:54:49,530 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-04 16:54:49,530 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 150 transitions, 1358 flow [2024-06-04 16:54:49,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:49,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:54:49,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:54:49,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-04 16:54:49,531 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:54:49,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:54:49,531 INFO L85 PathProgramCache]: Analyzing trace with hash -601008510, now seen corresponding path program 23 times [2024-06-04 16:54:49,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:54:49,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381743847] [2024-06-04 16:54:49,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:54:49,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:54:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:54:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:54:56,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:54:56,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381743847] [2024-06-04 16:54:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381743847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:54:56,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:54:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:54:56,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655309018] [2024-06-04 16:54:56,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:54:56,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:54:56,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:54:56,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:54:56,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:54:56,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:54:56,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 150 transitions, 1358 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:56,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:54:56,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:54:56,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:54:57,071 INFO L124 PetriNetUnfolderBase]: 368/757 cut-off events. [2024-06-04 16:54:57,071 INFO L125 PetriNetUnfolderBase]: For 61782/61782 co-relation queries the response was YES. [2024-06-04 16:54:57,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5398 conditions, 757 events. 368/757 cut-off events. For 61782/61782 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4072 event pairs, 72 based on Foata normal form. 2/759 useless extension candidates. Maximal degree in co-relation 5306. Up to 534 conditions per place. [2024-06-04 16:54:57,079 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 123 selfloop transitions, 42 changer transitions 1/169 dead transitions. [2024-06-04 16:54:57,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 169 transitions, 1966 flow [2024-06-04 16:54:57,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:54:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:54:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 16:54:57,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096774193548387 [2024-06-04 16:54:57,080 INFO L175 Difference]: Start difference. First operand has 211 places, 150 transitions, 1358 flow. Second operand 10 states and 127 transitions. [2024-06-04 16:54:57,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 169 transitions, 1966 flow [2024-06-04 16:54:57,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 169 transitions, 1860 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 16:54:57,233 INFO L231 Difference]: Finished difference. Result has 213 places, 152 transitions, 1410 flow [2024-06-04 16:54:57,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1410, PETRI_PLACES=213, PETRI_TRANSITIONS=152} [2024-06-04 16:54:57,233 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 183 predicate places. [2024-06-04 16:54:57,233 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 152 transitions, 1410 flow [2024-06-04 16:54:57,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:54:57,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:54:57,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:54:57,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-04 16:54:57,234 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:54:57,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:54:57,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1068079468, now seen corresponding path program 24 times [2024-06-04 16:54:57,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:54:57,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931722301] [2024-06-04 16:54:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:54:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:54:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:55:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:55:02,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:55:02,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931722301] [2024-06-04 16:55:02,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931722301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:55:02,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:55:02,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:55:02,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457176586] [2024-06-04 16:55:02,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:55:02,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:55:02,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:55:02,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:55:02,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:55:03,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:55:03,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 152 transitions, 1410 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:55:03,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:55:03,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:55:03,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:55:03,521 INFO L124 PetriNetUnfolderBase]: 355/734 cut-off events. [2024-06-04 16:55:03,521 INFO L125 PetriNetUnfolderBase]: For 57855/57855 co-relation queries the response was YES. [2024-06-04 16:55:03,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4653 conditions, 734 events. 355/734 cut-off events. For 57855/57855 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3943 event pairs, 69 based on Foata normal form. 10/744 useless extension candidates. Maximal degree in co-relation 4560. Up to 572 conditions per place. [2024-06-04 16:55:03,527 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 122 selfloop transitions, 35 changer transitions 7/167 dead transitions. [2024-06-04 16:55:03,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 167 transitions, 1828 flow [2024-06-04 16:55:03,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:55:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:55:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 16:55:03,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 16:55:03,528 INFO L175 Difference]: Start difference. First operand has 213 places, 152 transitions, 1410 flow. Second operand 10 states and 124 transitions. [2024-06-04 16:55:03,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 167 transitions, 1828 flow [2024-06-04 16:55:03,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 167 transitions, 1727 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-04 16:55:03,631 INFO L231 Difference]: Finished difference. Result has 215 places, 149 transitions, 1358 flow [2024-06-04 16:55:03,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1358, PETRI_PLACES=215, PETRI_TRANSITIONS=149} [2024-06-04 16:55:03,632 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 185 predicate places. [2024-06-04 16:55:03,632 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 149 transitions, 1358 flow [2024-06-04 16:55:03,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:55:03,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:55:03,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:55:03,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-04 16:55:03,632 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:55:03,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:55:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash -924451240, now seen corresponding path program 5 times [2024-06-04 16:55:03,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:55:03,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291996966] [2024-06-04 16:55:03,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:55:03,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:55:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:55:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:55:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:55:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291996966] [2024-06-04 16:55:12,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291996966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:55:12,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:55:12,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:55:12,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429400244] [2024-06-04 16:55:12,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:55:12,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:55:12,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:55:12,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:55:12,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:55:12,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:55:12,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 149 transitions, 1358 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:55:12,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:55:12,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:55:12,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:55:13,354 INFO L124 PetriNetUnfolderBase]: 350/725 cut-off events. [2024-06-04 16:55:13,355 INFO L125 PetriNetUnfolderBase]: For 53783/53783 co-relation queries the response was YES. [2024-06-04 16:55:13,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4564 conditions, 725 events. 350/725 cut-off events. For 53783/53783 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3893 event pairs, 67 based on Foata normal form. 8/733 useless extension candidates. Maximal degree in co-relation 4471. Up to 574 conditions per place. [2024-06-04 16:55:13,361 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 123 selfloop transitions, 31 changer transitions 8/165 dead transitions. [2024-06-04 16:55:13,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 165 transitions, 1774 flow [2024-06-04 16:55:13,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:55:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:55:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-04 16:55:13,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 16:55:13,362 INFO L175 Difference]: Start difference. First operand has 215 places, 149 transitions, 1358 flow. Second operand 11 states and 132 transitions. [2024-06-04 16:55:13,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 165 transitions, 1774 flow [2024-06-04 16:55:13,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 165 transitions, 1651 flow, removed 8 selfloop flow, removed 13 redundant places. [2024-06-04 16:55:13,476 INFO L231 Difference]: Finished difference. Result has 213 places, 146 transitions, 1284 flow [2024-06-04 16:55:13,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1284, PETRI_PLACES=213, PETRI_TRANSITIONS=146} [2024-06-04 16:55:13,476 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 183 predicate places. [2024-06-04 16:55:13,476 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 146 transitions, 1284 flow [2024-06-04 16:55:13,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:55:13,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:55:13,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:55:13,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-04 16:55:13,477 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:55:13,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:55:13,477 INFO L85 PathProgramCache]: Analyzing trace with hash -600823936, now seen corresponding path program 6 times [2024-06-04 16:55:13,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:55:13,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404685498] [2024-06-04 16:55:13,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:55:13,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:55:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:55:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:55:23,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:55:23,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404685498] [2024-06-04 16:55:23,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404685498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:55:23,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:55:23,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:55:23,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435927056] [2024-06-04 16:55:23,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:55:23,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:55:23,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:55:23,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:55:23,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:55:24,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:55:24,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 146 transitions, 1284 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:55:24,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:55:24,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:55:24,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:55:24,402 INFO L124 PetriNetUnfolderBase]: 345/722 cut-off events. [2024-06-04 16:55:24,403 INFO L125 PetriNetUnfolderBase]: For 53415/53415 co-relation queries the response was YES. [2024-06-04 16:55:24,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4448 conditions, 722 events. 345/722 cut-off events. For 53415/53415 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3871 event pairs, 69 based on Foata normal form. 8/730 useless extension candidates. Maximal degree in co-relation 4357. Up to 567 conditions per place. [2024-06-04 16:55:24,408 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 122 selfloop transitions, 29 changer transitions 8/162 dead transitions. [2024-06-04 16:55:24,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 162 transitions, 1692 flow [2024-06-04 16:55:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:55:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:55:24,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-04 16:55:24,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 16:55:24,409 INFO L175 Difference]: Start difference. First operand has 213 places, 146 transitions, 1284 flow. Second operand 11 states and 132 transitions. [2024-06-04 16:55:24,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 162 transitions, 1692 flow [2024-06-04 16:55:24,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 162 transitions, 1622 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 16:55:24,521 INFO L231 Difference]: Finished difference. Result has 211 places, 143 transitions, 1257 flow [2024-06-04 16:55:24,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1257, PETRI_PLACES=211, PETRI_TRANSITIONS=143} [2024-06-04 16:55:24,521 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-04 16:55:24,521 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 143 transitions, 1257 flow [2024-06-04 16:55:24,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:55:24,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:55:24,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:55:24,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-04 16:55:24,522 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:55:24,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:55:24,522 INFO L85 PathProgramCache]: Analyzing trace with hash -594328816, now seen corresponding path program 7 times [2024-06-04 16:55:24,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:55:24,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335633796] [2024-06-04 16:55:24,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:55:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:55:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:55:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:55:29,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:55:29,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335633796] [2024-06-04 16:55:29,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335633796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:55:29,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:55:29,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:55:29,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572007287] [2024-06-04 16:55:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:55:29,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:55:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:55:29,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:55:29,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:55:29,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:55:29,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 143 transitions, 1257 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:55:29,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:55:29,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:55:29,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:55:30,255 INFO L124 PetriNetUnfolderBase]: 336/707 cut-off events. [2024-06-04 16:55:30,255 INFO L125 PetriNetUnfolderBase]: For 47345/47345 co-relation queries the response was YES. [2024-06-04 16:55:30,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 707 events. 336/707 cut-off events. For 47345/47345 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3779 event pairs, 65 based on Foata normal form. 6/713 useless extension candidates. Maximal degree in co-relation 4241. Up to 555 conditions per place. [2024-06-04 16:55:30,261 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 118 selfloop transitions, 26 changer transitions 10/157 dead transitions. [2024-06-04 16:55:30,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 157 transitions, 1629 flow [2024-06-04 16:55:30,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:55:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:55:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-04 16:55:30,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36950146627565983 [2024-06-04 16:55:30,262 INFO L175 Difference]: Start difference. First operand has 211 places, 143 transitions, 1257 flow. Second operand 11 states and 126 transitions. [2024-06-04 16:55:30,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 157 transitions, 1629 flow [2024-06-04 16:55:30,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 157 transitions, 1563 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 16:55:30,355 INFO L231 Difference]: Finished difference. Result has 209 places, 140 transitions, 1221 flow [2024-06-04 16:55:30,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1221, PETRI_PLACES=209, PETRI_TRANSITIONS=140} [2024-06-04 16:55:30,355 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2024-06-04 16:55:30,355 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 140 transitions, 1221 flow [2024-06-04 16:55:30,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:55:30,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:55:30,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:55:30,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-04 16:55:30,356 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:55:30,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:55:30,356 INFO L85 PathProgramCache]: Analyzing trace with hash -792083986, now seen corresponding path program 25 times [2024-06-04 16:55:30,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:55:30,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408786437] [2024-06-04 16:55:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:55:30,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:55:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:55:36,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:55:36,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:55:36,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408786437] [2024-06-04 16:55:36,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408786437] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:55:36,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:55:36,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:55:36,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824059302] [2024-06-04 16:55:36,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:55:36,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:55:36,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:55:36,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:55:36,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:55:36,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:55:36,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 140 transitions, 1221 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:55:36,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:55:36,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:55:36,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:55:37,329 INFO L124 PetriNetUnfolderBase]: 325/678 cut-off events. [2024-06-04 16:55:37,330 INFO L125 PetriNetUnfolderBase]: For 40230/40230 co-relation queries the response was YES. [2024-06-04 16:55:37,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4197 conditions, 678 events. 325/678 cut-off events. For 40230/40230 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3566 event pairs, 70 based on Foata normal form. 2/680 useless extension candidates. Maximal degree in co-relation 4108. Up to 559 conditions per place. [2024-06-04 16:55:37,336 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 112 selfloop transitions, 35 changer transitions 1/151 dead transitions. [2024-06-04 16:55:37,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 151 transitions, 1569 flow [2024-06-04 16:55:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:55:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:55:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 16:55:37,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-04 16:55:37,337 INFO L175 Difference]: Start difference. First operand has 209 places, 140 transitions, 1221 flow. Second operand 10 states and 122 transitions. [2024-06-04 16:55:37,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 151 transitions, 1569 flow [2024-06-04 16:55:37,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 151 transitions, 1509 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 16:55:37,439 INFO L231 Difference]: Finished difference. Result has 204 places, 141 transitions, 1267 flow [2024-06-04 16:55:37,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1267, PETRI_PLACES=204, PETRI_TRANSITIONS=141} [2024-06-04 16:55:37,439 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 174 predicate places. [2024-06-04 16:55:37,439 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 141 transitions, 1267 flow [2024-06-04 16:55:37,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:55:37,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:55:37,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:55:37,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-04 16:55:37,440 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:55:37,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:55:37,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1321926668, now seen corresponding path program 26 times [2024-06-04 16:55:37,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:55:37,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924390913] [2024-06-04 16:55:37,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:55:37,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:55:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:55:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:55:44,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:55:44,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924390913] [2024-06-04 16:55:44,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924390913] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:55:44,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:55:44,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:55:44,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245018880] [2024-06-04 16:55:44,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:55:44,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:55:44,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:55:44,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:55:44,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:55:45,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:55:45,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 141 transitions, 1267 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:55:45,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:55:45,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:55:45,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:55:45,618 INFO L124 PetriNetUnfolderBase]: 358/745 cut-off events. [2024-06-04 16:55:45,618 INFO L125 PetriNetUnfolderBase]: For 54992/54992 co-relation queries the response was YES. [2024-06-04 16:55:45,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5187 conditions, 745 events. 358/745 cut-off events. For 54992/54992 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3988 event pairs, 81 based on Foata normal form. 2/747 useless extension candidates. Maximal degree in co-relation 5100. Up to 553 conditions per place. [2024-06-04 16:55:45,624 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 117 selfloop transitions, 37 changer transitions 1/158 dead transitions. [2024-06-04 16:55:45,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 158 transitions, 1837 flow [2024-06-04 16:55:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:55:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:55:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 16:55:45,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096774193548387 [2024-06-04 16:55:45,626 INFO L175 Difference]: Start difference. First operand has 204 places, 141 transitions, 1267 flow. Second operand 10 states and 127 transitions. [2024-06-04 16:55:45,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 158 transitions, 1837 flow [2024-06-04 16:55:45,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 158 transitions, 1725 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-04 16:55:45,761 INFO L231 Difference]: Finished difference. Result has 205 places, 143 transitions, 1301 flow [2024-06-04 16:55:45,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1301, PETRI_PLACES=205, PETRI_TRANSITIONS=143} [2024-06-04 16:55:45,761 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2024-06-04 16:55:45,762 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 143 transitions, 1301 flow [2024-06-04 16:55:45,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:55:45,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:55:45,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:55:45,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-04 16:55:45,762 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:55:45,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:55:45,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1255708584, now seen corresponding path program 27 times [2024-06-04 16:55:45,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:55:45,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081303632] [2024-06-04 16:55:45,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:55:45,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:55:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:55:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:55:54,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:55:54,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081303632] [2024-06-04 16:55:54,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081303632] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:55:54,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:55:54,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:55:54,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169550686] [2024-06-04 16:55:54,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:55:54,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:55:54,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:55:54,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:55:54,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:55:54,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 16:55:54,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 143 transitions, 1301 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:55:54,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:55:54,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 16:55:54,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:55:55,231 INFO L124 PetriNetUnfolderBase]: 362/753 cut-off events. [2024-06-04 16:55:55,231 INFO L125 PetriNetUnfolderBase]: For 56857/56857 co-relation queries the response was YES. [2024-06-04 16:55:55,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5226 conditions, 753 events. 362/753 cut-off events. For 56857/56857 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4072 event pairs, 83 based on Foata normal form. 2/755 useless extension candidates. Maximal degree in co-relation 5139. Up to 580 conditions per place. [2024-06-04 16:55:55,240 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 99 selfloop transitions, 53 changer transitions 1/156 dead transitions. [2024-06-04 16:55:55,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 156 transitions, 1667 flow [2024-06-04 16:55:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:55:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:55:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 154 transitions. [2024-06-04 16:55:55,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41397849462365593 [2024-06-04 16:55:55,242 INFO L175 Difference]: Start difference. First operand has 205 places, 143 transitions, 1301 flow. Second operand 12 states and 154 transitions. [2024-06-04 16:55:55,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 156 transitions, 1667 flow [2024-06-04 16:55:55,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 156 transitions, 1588 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-04 16:55:55,379 INFO L231 Difference]: Finished difference. Result has 211 places, 144 transitions, 1370 flow [2024-06-04 16:55:55,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1370, PETRI_PLACES=211, PETRI_TRANSITIONS=144} [2024-06-04 16:55:55,379 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-04 16:55:55,380 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 144 transitions, 1370 flow [2024-06-04 16:55:55,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:55:55,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:55:55,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:55:55,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-04 16:55:55,380 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:55:55,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:55:55,381 INFO L85 PathProgramCache]: Analyzing trace with hash -785827876, now seen corresponding path program 28 times [2024-06-04 16:55:55,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:55:55,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552395170] [2024-06-04 16:55:55,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:55:55,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:55:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:56:01,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-04 16:56:01,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:56:01,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552395170] [2024-06-04 16:56:01,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552395170] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:56:01,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:56:01,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:56:01,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107508308] [2024-06-04 16:56:01,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:56:01,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:56:01,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:56:01,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:56:01,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:56:01,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:56:01,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 144 transitions, 1370 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:01,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:56:01,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:56:01,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:56:01,495 INFO L124 PetriNetUnfolderBase]: 349/730 cut-off events. [2024-06-04 16:56:01,495 INFO L125 PetriNetUnfolderBase]: For 55004/55004 co-relation queries the response was YES. [2024-06-04 16:56:01,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4587 conditions, 730 events. 349/730 cut-off events. For 55004/55004 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3931 event pairs, 74 based on Foata normal form. 10/740 useless extension candidates. Maximal degree in co-relation 4498. Up to 579 conditions per place. [2024-06-04 16:56:01,501 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 115 selfloop transitions, 32 changer transitions 7/157 dead transitions. [2024-06-04 16:56:01,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 157 transitions, 1756 flow [2024-06-04 16:56:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:56:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:56:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 16:56:01,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 16:56:01,502 INFO L175 Difference]: Start difference. First operand has 211 places, 144 transitions, 1370 flow. Second operand 10 states and 124 transitions. [2024-06-04 16:56:01,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 157 transitions, 1756 flow [2024-06-04 16:56:01,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 157 transitions, 1606 flow, removed 24 selfloop flow, removed 10 redundant places. [2024-06-04 16:56:01,605 INFO L231 Difference]: Finished difference. Result has 211 places, 141 transitions, 1267 flow [2024-06-04 16:56:01,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1267, PETRI_PLACES=211, PETRI_TRANSITIONS=141} [2024-06-04 16:56:01,606 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-04 16:56:01,606 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 141 transitions, 1267 flow [2024-06-04 16:56:01,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:01,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:56:01,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:56:01,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-04 16:56:01,606 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:56:01,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:56:01,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1454573604, now seen corresponding path program 29 times [2024-06-04 16:56:01,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:56:01,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153955420] [2024-06-04 16:56:01,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:56:01,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:56:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:56:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:56:06,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:56:06,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153955420] [2024-06-04 16:56:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153955420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:56:06,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:56:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:56:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250129771] [2024-06-04 16:56:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:56:06,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:56:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:56:06,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:56:06,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:56:06,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:56:06,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 141 transitions, 1267 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:06,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:56:06,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:56:06,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:56:07,023 INFO L124 PetriNetUnfolderBase]: 348/729 cut-off events. [2024-06-04 16:56:07,023 INFO L125 PetriNetUnfolderBase]: For 56428/56428 co-relation queries the response was YES. [2024-06-04 16:56:07,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4526 conditions, 729 events. 348/729 cut-off events. For 56428/56428 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3948 event pairs, 106 based on Foata normal form. 10/739 useless extension candidates. Maximal degree in co-relation 4436. Up to 616 conditions per place. [2024-06-04 16:56:07,030 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 125 selfloop transitions, 20 changer transitions 7/155 dead transitions. [2024-06-04 16:56:07,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 155 transitions, 1685 flow [2024-06-04 16:56:07,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:56:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:56:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-04 16:56:07,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2024-06-04 16:56:07,031 INFO L175 Difference]: Start difference. First operand has 211 places, 141 transitions, 1267 flow. Second operand 10 states and 121 transitions. [2024-06-04 16:56:07,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 155 transitions, 1685 flow [2024-06-04 16:56:07,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 155 transitions, 1599 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-04 16:56:07,145 INFO L231 Difference]: Finished difference. Result has 210 places, 138 transitions, 1236 flow [2024-06-04 16:56:07,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1236, PETRI_PLACES=210, PETRI_TRANSITIONS=138} [2024-06-04 16:56:07,145 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2024-06-04 16:56:07,145 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 138 transitions, 1236 flow [2024-06-04 16:56:07,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:07,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:56:07,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:56:07,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-04 16:56:07,146 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:56:07,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:56:07,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1155692888, now seen corresponding path program 30 times [2024-06-04 16:56:07,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:56:07,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834040844] [2024-06-04 16:56:07,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:56:07,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:56:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:56:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:56:12,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:56:12,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834040844] [2024-06-04 16:56:12,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834040844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:56:12,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:56:12,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:56:12,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124955751] [2024-06-04 16:56:12,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:56:12,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:56:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:56:12,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:56:12,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:56:12,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:56:12,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 138 transitions, 1236 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:12,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:56:12,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:56:12,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:56:12,542 INFO L124 PetriNetUnfolderBase]: 340/711 cut-off events. [2024-06-04 16:56:12,542 INFO L125 PetriNetUnfolderBase]: For 49279/49279 co-relation queries the response was YES. [2024-06-04 16:56:12,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4646 conditions, 711 events. 340/711 cut-off events. For 49279/49279 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3820 event pairs, 73 based on Foata normal form. 2/713 useless extension candidates. Maximal degree in co-relation 4556. Up to 609 conditions per place. [2024-06-04 16:56:12,548 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 126 selfloop transitions, 22 changer transitions 2/153 dead transitions. [2024-06-04 16:56:12,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 153 transitions, 1763 flow [2024-06-04 16:56:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:56:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:56:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-04 16:56:12,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-04 16:56:12,550 INFO L175 Difference]: Start difference. First operand has 210 places, 138 transitions, 1236 flow. Second operand 10 states and 119 transitions. [2024-06-04 16:56:12,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 153 transitions, 1763 flow [2024-06-04 16:56:12,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 153 transitions, 1663 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-06-04 16:56:12,669 INFO L231 Difference]: Finished difference. Result has 211 places, 140 transitions, 1269 flow [2024-06-04 16:56:12,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1269, PETRI_PLACES=211, PETRI_TRANSITIONS=140} [2024-06-04 16:56:12,670 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-04 16:56:12,670 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 140 transitions, 1269 flow [2024-06-04 16:56:12,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:12,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:56:12,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:56:12,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-04 16:56:12,671 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:56:12,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:56:12,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1255886214, now seen corresponding path program 31 times [2024-06-04 16:56:12,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:56:12,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875630831] [2024-06-04 16:56:12,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:56:12,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:56:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:56:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:56:19,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:56:19,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875630831] [2024-06-04 16:56:19,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875630831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:56:19,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:56:19,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:56:19,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609527462] [2024-06-04 16:56:19,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:56:19,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:56:19,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:56:19,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:56:19,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:56:19,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:56:19,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 140 transitions, 1269 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:19,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:56:19,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:56:19,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:56:19,564 INFO L124 PetriNetUnfolderBase]: 362/753 cut-off events. [2024-06-04 16:56:19,565 INFO L125 PetriNetUnfolderBase]: For 66825/66825 co-relation queries the response was YES. [2024-06-04 16:56:19,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5505 conditions, 753 events. 362/753 cut-off events. For 66825/66825 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4075 event pairs, 84 based on Foata normal form. 2/755 useless extension candidates. Maximal degree in co-relation 5414. Up to 478 conditions per place. [2024-06-04 16:56:19,571 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 90 selfloop transitions, 63 changer transitions 1/157 dead transitions. [2024-06-04 16:56:19,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 157 transitions, 1855 flow [2024-06-04 16:56:19,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:56:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:56:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-04 16:56:19,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-04 16:56:19,572 INFO L175 Difference]: Start difference. First operand has 211 places, 140 transitions, 1269 flow. Second operand 10 states and 130 transitions. [2024-06-04 16:56:19,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 157 transitions, 1855 flow [2024-06-04 16:56:19,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 157 transitions, 1776 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-04 16:56:19,701 INFO L231 Difference]: Finished difference. Result has 215 places, 142 transitions, 1398 flow [2024-06-04 16:56:19,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1398, PETRI_PLACES=215, PETRI_TRANSITIONS=142} [2024-06-04 16:56:19,701 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 185 predicate places. [2024-06-04 16:56:19,701 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 142 transitions, 1398 flow [2024-06-04 16:56:19,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:19,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:56:19,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:56:19,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-04 16:56:19,702 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:56:19,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:56:19,702 INFO L85 PathProgramCache]: Analyzing trace with hash -958317766, now seen corresponding path program 32 times [2024-06-04 16:56:19,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:56:19,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938943844] [2024-06-04 16:56:19,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:56:19,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:56:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:56:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:56:25,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:56:25,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938943844] [2024-06-04 16:56:25,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938943844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:56:25,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:56:25,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:56:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603868187] [2024-06-04 16:56:25,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:56:25,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:56:25,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:56:25,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:56:25,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:56:25,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:56:25,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 142 transitions, 1398 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:25,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:56:25,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:56:25,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:56:25,652 INFO L124 PetriNetUnfolderBase]: 367/768 cut-off events. [2024-06-04 16:56:25,652 INFO L125 PetriNetUnfolderBase]: For 74092/74092 co-relation queries the response was YES. [2024-06-04 16:56:25,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5473 conditions, 768 events. 367/768 cut-off events. For 74092/74092 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4189 event pairs, 91 based on Foata normal form. 8/776 useless extension candidates. Maximal degree in co-relation 5381. Up to 659 conditions per place. [2024-06-04 16:56:25,658 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 124 selfloop transitions, 18 changer transitions 9/154 dead transitions. [2024-06-04 16:56:25,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 154 transitions, 1744 flow [2024-06-04 16:56:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:56:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:56:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-04 16:56:25,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-04 16:56:25,659 INFO L175 Difference]: Start difference. First operand has 215 places, 142 transitions, 1398 flow. Second operand 10 states and 117 transitions. [2024-06-04 16:56:25,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 154 transitions, 1744 flow [2024-06-04 16:56:25,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 154 transitions, 1607 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-04 16:56:25,803 INFO L231 Difference]: Finished difference. Result has 220 places, 139 transitions, 1276 flow [2024-06-04 16:56:25,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1261, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1276, PETRI_PLACES=220, PETRI_TRANSITIONS=139} [2024-06-04 16:56:25,803 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 190 predicate places. [2024-06-04 16:56:25,803 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 139 transitions, 1276 flow [2024-06-04 16:56:25,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:25,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:56:25,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:56:25,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-04 16:56:25,804 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:56:25,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:56:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash -963079366, now seen corresponding path program 33 times [2024-06-04 16:56:25,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:56:25,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776106841] [2024-06-04 16:56:25,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:56:25,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:56:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:56:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:56:31,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:56:31,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776106841] [2024-06-04 16:56:31,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776106841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:56:31,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:56:31,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:56:31,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780982533] [2024-06-04 16:56:31,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:56:31,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:56:31,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:56:31,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:56:31,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:56:31,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:56:31,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 139 transitions, 1276 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:31,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:56:31,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:56:31,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:56:31,483 INFO L124 PetriNetUnfolderBase]: 357/750 cut-off events. [2024-06-04 16:56:31,484 INFO L125 PetriNetUnfolderBase]: For 71149/71149 co-relation queries the response was YES. [2024-06-04 16:56:31,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5136 conditions, 750 events. 357/750 cut-off events. For 71149/71149 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4064 event pairs, 80 based on Foata normal form. 8/758 useless extension candidates. Maximal degree in co-relation 5042. Up to 631 conditions per place. [2024-06-04 16:56:31,490 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 121 selfloop transitions, 16 changer transitions 13/153 dead transitions. [2024-06-04 16:56:31,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 153 transitions, 1624 flow [2024-06-04 16:56:31,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:56:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:56:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 16:56:31,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-04 16:56:31,492 INFO L175 Difference]: Start difference. First operand has 220 places, 139 transitions, 1276 flow. Second operand 10 states and 118 transitions. [2024-06-04 16:56:31,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 153 transitions, 1624 flow [2024-06-04 16:56:31,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 153 transitions, 1578 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 16:56:31,661 INFO L231 Difference]: Finished difference. Result has 217 places, 135 transitions, 1205 flow [2024-06-04 16:56:31,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1205, PETRI_PLACES=217, PETRI_TRANSITIONS=135} [2024-06-04 16:56:31,661 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 187 predicate places. [2024-06-04 16:56:31,661 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 135 transitions, 1205 flow [2024-06-04 16:56:31,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:31,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:56:31,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:56:31,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-04 16:56:31,662 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:56:31,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:56:31,662 INFO L85 PathProgramCache]: Analyzing trace with hash -816154822, now seen corresponding path program 34 times [2024-06-04 16:56:31,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:56:31,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553329802] [2024-06-04 16:56:31,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:56:31,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:56:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:56:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:56:36,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:56:36,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553329802] [2024-06-04 16:56:36,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553329802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:56:36,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:56:36,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:56:36,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568515321] [2024-06-04 16:56:36,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:56:36,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:56:36,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:56:36,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:56:36,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:56:36,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:56:36,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 135 transitions, 1205 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:36,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:56:36,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:56:36,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:56:37,269 INFO L124 PetriNetUnfolderBase]: 322/681 cut-off events. [2024-06-04 16:56:37,270 INFO L125 PetriNetUnfolderBase]: For 56939/56939 co-relation queries the response was YES. [2024-06-04 16:56:37,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4149 conditions, 681 events. 322/681 cut-off events. For 56939/56939 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3631 event pairs, 71 based on Foata normal form. 10/691 useless extension candidates. Maximal degree in co-relation 4056. Up to 456 conditions per place. [2024-06-04 16:56:37,276 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 86 selfloop transitions, 52 changer transitions 7/148 dead transitions. [2024-06-04 16:56:37,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 148 transitions, 1573 flow [2024-06-04 16:56:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:56:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:56:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-04 16:56:37,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-04 16:56:37,277 INFO L175 Difference]: Start difference. First operand has 217 places, 135 transitions, 1205 flow. Second operand 10 states and 129 transitions. [2024-06-04 16:56:37,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 148 transitions, 1573 flow [2024-06-04 16:56:37,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 148 transitions, 1442 flow, removed 13 selfloop flow, removed 13 redundant places. [2024-06-04 16:56:37,378 INFO L231 Difference]: Finished difference. Result has 209 places, 132 transitions, 1161 flow [2024-06-04 16:56:37,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1161, PETRI_PLACES=209, PETRI_TRANSITIONS=132} [2024-06-04 16:56:37,378 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2024-06-04 16:56:37,378 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 132 transitions, 1161 flow [2024-06-04 16:56:37,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:37,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:56:37,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:56:37,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-04 16:56:37,380 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:56:37,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:56:37,380 INFO L85 PathProgramCache]: Analyzing trace with hash -792077042, now seen corresponding path program 8 times [2024-06-04 16:56:37,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:56:37,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418011380] [2024-06-04 16:56:37,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:56:37,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:56:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:56:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:56:44,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:56:44,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418011380] [2024-06-04 16:56:44,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418011380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:56:44,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:56:44,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:56:44,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716111922] [2024-06-04 16:56:44,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:56:44,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:56:44,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:56:44,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:56:44,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:56:44,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:56:44,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 132 transitions, 1161 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:44,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:56:44,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:56:44,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:56:44,641 INFO L124 PetriNetUnfolderBase]: 317/672 cut-off events. [2024-06-04 16:56:44,641 INFO L125 PetriNetUnfolderBase]: For 50221/50221 co-relation queries the response was YES. [2024-06-04 16:56:44,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3931 conditions, 672 events. 317/672 cut-off events. For 50221/50221 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3573 event pairs, 71 based on Foata normal form. 8/680 useless extension candidates. Maximal degree in co-relation 3844. Up to 536 conditions per place. [2024-06-04 16:56:44,646 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 108 selfloop transitions, 27 changer transitions 8/146 dead transitions. [2024-06-04 16:56:44,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 146 transitions, 1527 flow [2024-06-04 16:56:44,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:56:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:56:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-04 16:56:44,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-04 16:56:44,649 INFO L175 Difference]: Start difference. First operand has 209 places, 132 transitions, 1161 flow. Second operand 11 states and 133 transitions. [2024-06-04 16:56:44,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 146 transitions, 1527 flow [2024-06-04 16:56:44,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 146 transitions, 1364 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-04 16:56:44,747 INFO L231 Difference]: Finished difference. Result has 209 places, 129 transitions, 1040 flow [2024-06-04 16:56:44,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1040, PETRI_PLACES=209, PETRI_TRANSITIONS=129} [2024-06-04 16:56:44,748 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2024-06-04 16:56:44,748 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 129 transitions, 1040 flow [2024-06-04 16:56:44,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:44,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:56:44,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:56:44,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-04 16:56:44,749 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:56:44,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:56:44,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1664511342, now seen corresponding path program 9 times [2024-06-04 16:56:44,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:56:44,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479595654] [2024-06-04 16:56:44,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:56:44,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:56:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:56:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:56:51,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:56:51,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479595654] [2024-06-04 16:56:51,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479595654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:56:51,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:56:51,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:56:51,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305384583] [2024-06-04 16:56:51,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:56:51,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:56:51,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:56:51,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:56:51,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:56:51,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:56:51,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 129 transitions, 1040 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:51,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:56:51,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:56:51,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:56:51,896 INFO L124 PetriNetUnfolderBase]: 312/668 cut-off events. [2024-06-04 16:56:51,896 INFO L125 PetriNetUnfolderBase]: For 48581/48581 co-relation queries the response was YES. [2024-06-04 16:56:51,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 668 events. 312/668 cut-off events. For 48581/48581 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3581 event pairs, 76 based on Foata normal form. 8/676 useless extension candidates. Maximal degree in co-relation 3653. Up to 530 conditions per place. [2024-06-04 16:56:51,902 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 105 selfloop transitions, 24 changer transitions 9/141 dead transitions. [2024-06-04 16:56:51,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 141 transitions, 1386 flow [2024-06-04 16:56:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:56:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:56:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-04 16:56:51,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-04 16:56:51,904 INFO L175 Difference]: Start difference. First operand has 209 places, 129 transitions, 1040 flow. Second operand 11 states and 127 transitions. [2024-06-04 16:56:51,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 141 transitions, 1386 flow [2024-06-04 16:56:51,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 141 transitions, 1322 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 16:56:51,991 INFO L231 Difference]: Finished difference. Result has 208 places, 126 transitions, 1009 flow [2024-06-04 16:56:51,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1009, PETRI_PLACES=208, PETRI_TRANSITIONS=126} [2024-06-04 16:56:51,992 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-04 16:56:51,992 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 126 transitions, 1009 flow [2024-06-04 16:56:51,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:51,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:56:51,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:56:51,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-04 16:56:51,993 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:56:51,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:56:51,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1027561480, now seen corresponding path program 10 times [2024-06-04 16:56:51,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:56:51,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38977472] [2024-06-04 16:56:51,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:56:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:56:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:56:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:56:57,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:56:57,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38977472] [2024-06-04 16:56:57,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38977472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:56:57,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:56:57,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:56:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566288239] [2024-06-04 16:56:57,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:56:57,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:56:57,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:56:57,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:56:57,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:56:57,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:56:57,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 126 transitions, 1009 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:57,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:56:57,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:56:57,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:56:57,969 INFO L124 PetriNetUnfolderBase]: 329/712 cut-off events. [2024-06-04 16:56:57,969 INFO L125 PetriNetUnfolderBase]: For 55713/55713 co-relation queries the response was YES. [2024-06-04 16:56:57,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4329 conditions, 712 events. 329/712 cut-off events. For 55713/55713 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3866 event pairs, 111 based on Foata normal form. 6/718 useless extension candidates. Maximal degree in co-relation 4243. Up to 564 conditions per place. [2024-06-04 16:56:57,975 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 120 selfloop transitions, 15 changer transitions 7/145 dead transitions. [2024-06-04 16:56:57,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 145 transitions, 1523 flow [2024-06-04 16:56:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:56:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:56:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-04 16:56:57,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-04 16:56:57,977 INFO L175 Difference]: Start difference. First operand has 208 places, 126 transitions, 1009 flow. Second operand 11 states and 130 transitions. [2024-06-04 16:56:57,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 145 transitions, 1523 flow [2024-06-04 16:56:58,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 145 transitions, 1463 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 16:56:58,095 INFO L231 Difference]: Finished difference. Result has 207 places, 124 transitions, 971 flow [2024-06-04 16:56:58,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=971, PETRI_PLACES=207, PETRI_TRANSITIONS=124} [2024-06-04 16:56:58,096 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 177 predicate places. [2024-06-04 16:56:58,096 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 124 transitions, 971 flow [2024-06-04 16:56:58,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:56:58,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:56:58,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:56:58,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-04 16:56:58,096 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:56:58,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:56:58,097 INFO L85 PathProgramCache]: Analyzing trace with hash -785581922, now seen corresponding path program 11 times [2024-06-04 16:56:58,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:56:58,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353842829] [2024-06-04 16:56:58,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:56:58,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:56:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:02,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-04 16:57:02,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:02,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353842829] [2024-06-04 16:57:02,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353842829] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:02,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:02,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:57:02,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2992467] [2024-06-04 16:57:02,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:02,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:57:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:02,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:57:02,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:57:02,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:57:02,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 124 transitions, 971 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:02,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:02,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:57:02,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:03,152 INFO L124 PetriNetUnfolderBase]: 322/698 cut-off events. [2024-06-04 16:57:03,152 INFO L125 PetriNetUnfolderBase]: For 55677/55677 co-relation queries the response was YES. [2024-06-04 16:57:03,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4264 conditions, 698 events. 322/698 cut-off events. For 55677/55677 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3799 event pairs, 84 based on Foata normal form. 6/704 useless extension candidates. Maximal degree in co-relation 4177. Up to 558 conditions per place. [2024-06-04 16:57:03,158 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 101 selfloop transitions, 22 changer transitions 10/136 dead transitions. [2024-06-04 16:57:03,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 136 transitions, 1289 flow [2024-06-04 16:57:03,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:57:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:57:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-04 16:57:03,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36656891495601174 [2024-06-04 16:57:03,159 INFO L175 Difference]: Start difference. First operand has 207 places, 124 transitions, 971 flow. Second operand 11 states and 125 transitions. [2024-06-04 16:57:03,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 136 transitions, 1289 flow [2024-06-04 16:57:03,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 136 transitions, 1249 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-04 16:57:03,281 INFO L231 Difference]: Finished difference. Result has 204 places, 121 transitions, 961 flow [2024-06-04 16:57:03,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=961, PETRI_PLACES=204, PETRI_TRANSITIONS=121} [2024-06-04 16:57:03,293 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 174 predicate places. [2024-06-04 16:57:03,294 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 121 transitions, 961 flow [2024-06-04 16:57:03,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:03,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:03,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:03,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-04 16:57:03,294 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:03,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:03,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1159108450, now seen corresponding path program 12 times [2024-06-04 16:57:03,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:03,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152029371] [2024-06-04 16:57:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:08,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-04 16:57:08,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:08,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152029371] [2024-06-04 16:57:08,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152029371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:08,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:08,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:57:08,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631218014] [2024-06-04 16:57:08,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:08,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:57:08,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:08,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:57:08,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:57:08,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:57:08,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 121 transitions, 961 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:08,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:08,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:57:08,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:08,772 INFO L124 PetriNetUnfolderBase]: 337/732 cut-off events. [2024-06-04 16:57:08,772 INFO L125 PetriNetUnfolderBase]: For 66848/66848 co-relation queries the response was YES. [2024-06-04 16:57:08,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4884 conditions, 732 events. 337/732 cut-off events. For 66848/66848 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4016 event pairs, 123 based on Foata normal form. 6/738 useless extension candidates. Maximal degree in co-relation 4799. Up to 507 conditions per place. [2024-06-04 16:57:08,778 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 113 selfloop transitions, 15 changer transitions 9/140 dead transitions. [2024-06-04 16:57:08,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 140 transitions, 1461 flow [2024-06-04 16:57:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:57:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:57:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-04 16:57:08,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-04 16:57:08,779 INFO L175 Difference]: Start difference. First operand has 204 places, 121 transitions, 961 flow. Second operand 11 states and 133 transitions. [2024-06-04 16:57:08,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 140 transitions, 1461 flow [2024-06-04 16:57:08,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 140 transitions, 1405 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-04 16:57:08,926 INFO L231 Difference]: Finished difference. Result has 201 places, 118 transitions, 925 flow [2024-06-04 16:57:08,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=925, PETRI_PLACES=201, PETRI_TRANSITIONS=118} [2024-06-04 16:57:08,926 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 171 predicate places. [2024-06-04 16:57:08,926 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 118 transitions, 925 flow [2024-06-04 16:57:08,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:08,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:08,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:08,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-04 16:57:08,927 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:08,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash -594502838, now seen corresponding path program 13 times [2024-06-04 16:57:08,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:08,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341002147] [2024-06-04 16:57:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:08,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:16,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:16,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341002147] [2024-06-04 16:57:16,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341002147] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:16,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:16,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:57:16,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428803050] [2024-06-04 16:57:16,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:16,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:57:16,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:16,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:57:16,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:57:16,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:57:16,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 118 transitions, 925 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:16,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:16,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:57:16,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:16,605 INFO L124 PetriNetUnfolderBase]: 310/677 cut-off events. [2024-06-04 16:57:16,605 INFO L125 PetriNetUnfolderBase]: For 61428/61428 co-relation queries the response was YES. [2024-06-04 16:57:16,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4008 conditions, 677 events. 310/677 cut-off events. For 61428/61428 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3649 event pairs, 118 based on Foata normal form. 14/691 useless extension candidates. Maximal degree in co-relation 3924. Up to 550 conditions per place. [2024-06-04 16:57:16,611 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 104 selfloop transitions, 11 changer transitions 14/132 dead transitions. [2024-06-04 16:57:16,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 132 transitions, 1255 flow [2024-06-04 16:57:16,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:57:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:57:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-04 16:57:16,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36950146627565983 [2024-06-04 16:57:16,612 INFO L175 Difference]: Start difference. First operand has 201 places, 118 transitions, 925 flow. Second operand 11 states and 126 transitions. [2024-06-04 16:57:16,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 132 transitions, 1255 flow [2024-06-04 16:57:16,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 132 transitions, 1207 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-04 16:57:16,706 INFO L231 Difference]: Finished difference. Result has 197 places, 111 transitions, 852 flow [2024-06-04 16:57:16,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=852, PETRI_PLACES=197, PETRI_TRANSITIONS=111} [2024-06-04 16:57:16,706 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places. [2024-06-04 16:57:16,706 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 111 transitions, 852 flow [2024-06-04 16:57:16,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:16,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:16,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:16,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-04 16:57:16,707 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:16,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash -586220258, now seen corresponding path program 14 times [2024-06-04 16:57:16,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:16,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816655422] [2024-06-04 16:57:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:16,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:21,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:21,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816655422] [2024-06-04 16:57:21,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816655422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:21,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:21,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:57:21,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316425293] [2024-06-04 16:57:21,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:21,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:57:21,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:21,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:57:21,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:57:21,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:57:21,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 111 transitions, 852 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:21,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:21,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:57:21,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:22,282 INFO L124 PetriNetUnfolderBase]: 270/593 cut-off events. [2024-06-04 16:57:22,282 INFO L125 PetriNetUnfolderBase]: For 36861/36861 co-relation queries the response was YES. [2024-06-04 16:57:22,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3234 conditions, 593 events. 270/593 cut-off events. For 36861/36861 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3081 event pairs, 95 based on Foata normal form. 6/599 useless extension candidates. Maximal degree in co-relation 3153. Up to 507 conditions per place. [2024-06-04 16:57:22,287 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 100 selfloop transitions, 8 changer transitions 14/125 dead transitions. [2024-06-04 16:57:22,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 125 transitions, 1152 flow [2024-06-04 16:57:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:57:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:57:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-04 16:57:22,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-04 16:57:22,288 INFO L175 Difference]: Start difference. First operand has 197 places, 111 transitions, 852 flow. Second operand 11 states and 121 transitions. [2024-06-04 16:57:22,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 125 transitions, 1152 flow [2024-06-04 16:57:22,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 125 transitions, 1116 flow, removed 7 selfloop flow, removed 12 redundant places. [2024-06-04 16:57:22,357 INFO L231 Difference]: Finished difference. Result has 188 places, 106 transitions, 809 flow [2024-06-04 16:57:22,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=809, PETRI_PLACES=188, PETRI_TRANSITIONS=106} [2024-06-04 16:57:22,358 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 158 predicate places. [2024-06-04 16:57:22,358 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 106 transitions, 809 flow [2024-06-04 16:57:22,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:22,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:22,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:22,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-04 16:57:22,359 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:22,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:22,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1627928286, now seen corresponding path program 15 times [2024-06-04 16:57:22,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:22,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391584607] [2024-06-04 16:57:22,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:22,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:27,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:27,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391584607] [2024-06-04 16:57:27,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391584607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:27,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:27,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:57:27,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455901781] [2024-06-04 16:57:27,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:27,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:57:27,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:27,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:57:27,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:57:27,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:57:27,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 106 transitions, 809 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:27,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:27,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:57:27,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:28,071 INFO L124 PetriNetUnfolderBase]: 265/578 cut-off events. [2024-06-04 16:57:28,071 INFO L125 PetriNetUnfolderBase]: For 34151/34151 co-relation queries the response was YES. [2024-06-04 16:57:28,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3112 conditions, 578 events. 265/578 cut-off events. For 34151/34151 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2981 event pairs, 69 based on Foata normal form. 8/586 useless extension candidates. Maximal degree in co-relation 3035. Up to 386 conditions per place. [2024-06-04 16:57:28,076 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 69 selfloop transitions, 34 changer transitions 14/120 dead transitions. [2024-06-04 16:57:28,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 120 transitions, 1111 flow [2024-06-04 16:57:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:57:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:57:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 16:57:28,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-04 16:57:28,078 INFO L175 Difference]: Start difference. First operand has 188 places, 106 transitions, 809 flow. Second operand 11 states and 134 transitions. [2024-06-04 16:57:28,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 120 transitions, 1111 flow [2024-06-04 16:57:28,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 120 transitions, 1074 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-04 16:57:28,149 INFO L231 Difference]: Finished difference. Result has 179 places, 100 transitions, 807 flow [2024-06-04 16:57:28,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=807, PETRI_PLACES=179, PETRI_TRANSITIONS=100} [2024-06-04 16:57:28,149 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2024-06-04 16:57:28,149 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 100 transitions, 807 flow [2024-06-04 16:57:28,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:28,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:28,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:28,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-04 16:57:28,150 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:28,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:28,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1634184396, now seen corresponding path program 16 times [2024-06-04 16:57:28,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:28,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413150140] [2024-06-04 16:57:28,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:28,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:36,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:36,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413150140] [2024-06-04 16:57:36,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413150140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:36,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:36,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:57:36,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969594715] [2024-06-04 16:57:36,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:36,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:57:36,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:36,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:57:36,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:57:36,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:57:36,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 100 transitions, 807 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:36,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:36,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:57:36,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:36,687 INFO L124 PetriNetUnfolderBase]: 253/562 cut-off events. [2024-06-04 16:57:36,687 INFO L125 PetriNetUnfolderBase]: For 30381/30381 co-relation queries the response was YES. [2024-06-04 16:57:36,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2985 conditions, 562 events. 253/562 cut-off events. For 30381/30381 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2885 event pairs, 71 based on Foata normal form. 8/570 useless extension candidates. Maximal degree in co-relation 2912. Up to 376 conditions per place. [2024-06-04 16:57:36,691 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 71 selfloop transitions, 32 changer transitions 8/114 dead transitions. [2024-06-04 16:57:36,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 114 transitions, 1093 flow [2024-06-04 16:57:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:57:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:57:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-04 16:57:36,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 16:57:36,693 INFO L175 Difference]: Start difference. First operand has 179 places, 100 transitions, 807 flow. Second operand 11 states and 132 transitions. [2024-06-04 16:57:36,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 114 transitions, 1093 flow [2024-06-04 16:57:36,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 114 transitions, 990 flow, removed 6 selfloop flow, removed 15 redundant places. [2024-06-04 16:57:36,751 INFO L231 Difference]: Finished difference. Result has 171 places, 97 transitions, 762 flow [2024-06-04 16:57:36,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=762, PETRI_PLACES=171, PETRI_TRANSITIONS=97} [2024-06-04 16:57:36,751 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 141 predicate places. [2024-06-04 16:57:36,751 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 97 transitions, 762 flow [2024-06-04 16:57:36,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:36,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:36,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:36,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-04 16:57:36,752 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:36,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:36,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1634423406, now seen corresponding path program 17 times [2024-06-04 16:57:36,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:36,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424549336] [2024-06-04 16:57:36,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:42,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:42,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424549336] [2024-06-04 16:57:42,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424549336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:42,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:42,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:57:42,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084493946] [2024-06-04 16:57:42,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:42,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:57:42,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:42,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:57:42,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:57:42,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:57:42,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 97 transitions, 762 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:42,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:42,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:57:42,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:42,908 INFO L124 PetriNetUnfolderBase]: 237/533 cut-off events. [2024-06-04 16:57:42,908 INFO L125 PetriNetUnfolderBase]: For 24751/24751 co-relation queries the response was YES. [2024-06-04 16:57:42,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 533 events. 237/533 cut-off events. For 24751/24751 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2689 event pairs, 67 based on Foata normal form. 6/539 useless extension candidates. Maximal degree in co-relation 2603. Up to 348 conditions per place. [2024-06-04 16:57:42,912 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 65 selfloop transitions, 30 changer transitions 10/108 dead transitions. [2024-06-04 16:57:42,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 108 transitions, 994 flow [2024-06-04 16:57:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:57:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:57:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 16:57:42,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 16:57:42,913 INFO L175 Difference]: Start difference. First operand has 171 places, 97 transitions, 762 flow. Second operand 11 states and 124 transitions. [2024-06-04 16:57:42,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 108 transitions, 994 flow [2024-06-04 16:57:42,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 108 transitions, 918 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-04 16:57:42,956 INFO L231 Difference]: Finished difference. Result has 169 places, 93 transitions, 713 flow [2024-06-04 16:57:42,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=713, PETRI_PLACES=169, PETRI_TRANSITIONS=93} [2024-06-04 16:57:42,956 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 139 predicate places. [2024-06-04 16:57:42,956 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 93 transitions, 713 flow [2024-06-04 16:57:42,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:42,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:42,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:42,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-06-04 16:57:42,957 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:42,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash -495555720, now seen corresponding path program 1 times [2024-06-04 16:57:42,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:42,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338770901] [2024-06-04 16:57:42,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:42,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:50,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:50,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338770901] [2024-06-04 16:57:50,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338770901] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:50,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:50,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:57:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472964953] [2024-06-04 16:57:50,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:50,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:57:50,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:50,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:57:50,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:57:50,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:57:50,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 93 transitions, 713 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:50,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:50,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:57:50,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:51,301 INFO L124 PetriNetUnfolderBase]: 230/517 cut-off events. [2024-06-04 16:57:51,302 INFO L125 PetriNetUnfolderBase]: For 24265/24265 co-relation queries the response was YES. [2024-06-04 16:57:51,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2550 conditions, 517 events. 230/517 cut-off events. For 24265/24265 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2590 event pairs, 61 based on Foata normal form. 6/523 useless extension candidates. Maximal degree in co-relation 2479. Up to 418 conditions per place. [2024-06-04 16:57:51,305 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 82 selfloop transitions, 15 changer transitions 11/111 dead transitions. [2024-06-04 16:57:51,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 111 transitions, 977 flow [2024-06-04 16:57:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:57:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:57:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2024-06-04 16:57:51,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3682795698924731 [2024-06-04 16:57:51,307 INFO L175 Difference]: Start difference. First operand has 169 places, 93 transitions, 713 flow. Second operand 12 states and 137 transitions. [2024-06-04 16:57:51,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 111 transitions, 977 flow [2024-06-04 16:57:51,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 111 transitions, 878 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 16:57:51,346 INFO L231 Difference]: Finished difference. Result has 165 places, 90 transitions, 626 flow [2024-06-04 16:57:51,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=626, PETRI_PLACES=165, PETRI_TRANSITIONS=90} [2024-06-04 16:57:51,346 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2024-06-04 16:57:51,346 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 90 transitions, 626 flow [2024-06-04 16:57:51,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:51,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:51,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:51,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-06-04 16:57:51,347 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:51,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:51,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1364641024, now seen corresponding path program 2 times [2024-06-04 16:57:51,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:51,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035288868] [2024-06-04 16:57:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:51,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:57,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:57,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035288868] [2024-06-04 16:57:57,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035288868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:57,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:57,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:57:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736731167] [2024-06-04 16:57:57,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:57,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:57:57,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:57,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:57:57,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:57:57,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:57:57,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 90 transitions, 626 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:57,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:57,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:57:57,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:57,804 INFO L124 PetriNetUnfolderBase]: 223/504 cut-off events. [2024-06-04 16:57:57,804 INFO L125 PetriNetUnfolderBase]: For 23099/23099 co-relation queries the response was YES. [2024-06-04 16:57:57,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2366 conditions, 504 events. 223/504 cut-off events. For 23099/23099 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2493 event pairs, 57 based on Foata normal form. 6/510 useless extension candidates. Maximal degree in co-relation 2298. Up to 396 conditions per place. [2024-06-04 16:57:57,807 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 79 selfloop transitions, 10 changer transitions 16/108 dead transitions. [2024-06-04 16:57:57,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 108 transitions, 880 flow [2024-06-04 16:57:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:57:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:57:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2024-06-04 16:57:57,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575268817204301 [2024-06-04 16:57:57,808 INFO L175 Difference]: Start difference. First operand has 165 places, 90 transitions, 626 flow. Second operand 12 states and 133 transitions. [2024-06-04 16:57:57,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 108 transitions, 880 flow [2024-06-04 16:57:57,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 108 transitions, 844 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 16:57:57,847 INFO L231 Difference]: Finished difference. Result has 163 places, 85 transitions, 566 flow [2024-06-04 16:57:57,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=566, PETRI_PLACES=163, PETRI_TRANSITIONS=85} [2024-06-04 16:57:57,847 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2024-06-04 16:57:57,847 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 85 transitions, 566 flow [2024-06-04 16:57:57,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:57,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:57,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:57,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-06-04 16:57:57,848 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:57,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:57,848 INFO L85 PathProgramCache]: Analyzing trace with hash -364258070, now seen corresponding path program 3 times [2024-06-04 16:57:57,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:57,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011290002] [2024-06-04 16:57:57,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:57,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:06,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:06,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011290002] [2024-06-04 16:58:06,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011290002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:06,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:06,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:58:06,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791343864] [2024-06-04 16:58:06,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:06,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:58:06,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:06,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:58:06,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:58:06,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:58:06,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 85 transitions, 566 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:06,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:06,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:58:06,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:07,283 INFO L124 PetriNetUnfolderBase]: 208/473 cut-off events. [2024-06-04 16:58:07,283 INFO L125 PetriNetUnfolderBase]: For 23053/23053 co-relation queries the response was YES. [2024-06-04 16:58:07,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2227 conditions, 473 events. 208/473 cut-off events. For 23053/23053 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2293 event pairs, 53 based on Foata normal form. 6/479 useless extension candidates. Maximal degree in co-relation 2159. Up to 368 conditions per place. [2024-06-04 16:58:07,287 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 77 selfloop transitions, 13 changer transitions 11/104 dead transitions. [2024-06-04 16:58:07,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 104 transitions, 816 flow [2024-06-04 16:58:07,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:58:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:58:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2024-06-04 16:58:07,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-04 16:58:07,289 INFO L175 Difference]: Start difference. First operand has 163 places, 85 transitions, 566 flow. Second operand 12 states and 136 transitions. [2024-06-04 16:58:07,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 104 transitions, 816 flow [2024-06-04 16:58:07,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 104 transitions, 782 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-04 16:58:07,341 INFO L231 Difference]: Finished difference. Result has 156 places, 81 transitions, 527 flow [2024-06-04 16:58:07,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=527, PETRI_PLACES=156, PETRI_TRANSITIONS=81} [2024-06-04 16:58:07,341 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-04 16:58:07,341 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 81 transitions, 527 flow [2024-06-04 16:58:07,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:07,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:07,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:07,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-06-04 16:58:07,342 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:07,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:07,343 INFO L85 PathProgramCache]: Analyzing trace with hash -164812130, now seen corresponding path program 4 times [2024-06-04 16:58:07,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:07,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113784025] [2024-06-04 16:58:07,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:07,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:14,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-04 16:58:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113784025] [2024-06-04 16:58:14,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113784025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:14,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:14,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:58:14,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201063857] [2024-06-04 16:58:14,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:14,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:58:14,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:14,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:58:14,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:58:14,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:58:14,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 81 transitions, 527 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:14,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:14,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:58:14,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:14,933 INFO L124 PetriNetUnfolderBase]: 182/417 cut-off events. [2024-06-04 16:58:14,934 INFO L125 PetriNetUnfolderBase]: For 16509/16509 co-relation queries the response was YES. [2024-06-04 16:58:14,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 417 events. 182/417 cut-off events. For 16509/16509 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1940 event pairs, 42 based on Foata normal form. 6/423 useless extension candidates. Maximal degree in co-relation 1718. Up to 331 conditions per place. [2024-06-04 16:58:14,937 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 68 selfloop transitions, 6 changer transitions 22/99 dead transitions. [2024-06-04 16:58:14,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 99 transitions, 765 flow [2024-06-04 16:58:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:58:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:58:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2024-06-04 16:58:14,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575268817204301 [2024-06-04 16:58:14,938 INFO L175 Difference]: Start difference. First operand has 156 places, 81 transitions, 527 flow. Second operand 12 states and 133 transitions. [2024-06-04 16:58:14,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 99 transitions, 765 flow [2024-06-04 16:58:14,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 99 transitions, 727 flow, removed 6 selfloop flow, removed 12 redundant places. [2024-06-04 16:58:14,961 INFO L231 Difference]: Finished difference. Result has 151 places, 73 transitions, 444 flow [2024-06-04 16:58:14,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=444, PETRI_PLACES=151, PETRI_TRANSITIONS=73} [2024-06-04 16:58:14,962 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-04 16:58:14,962 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 73 transitions, 444 flow [2024-06-04 16:58:14,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:14,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:14,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:14,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2024-06-04 16:58:14,963 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:14,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:14,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1471331308, now seen corresponding path program 5 times [2024-06-04 16:58:14,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:14,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631085500] [2024-06-04 16:58:14,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:14,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:21,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-04 16:58:21,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:21,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631085500] [2024-06-04 16:58:21,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631085500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:21,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:21,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:58:21,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916669603] [2024-06-04 16:58:21,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:21,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:58:21,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:21,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:58:21,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:58:22,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:58:22,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 73 transitions, 444 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:22,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:22,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:58:22,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:22,360 INFO L124 PetriNetUnfolderBase]: 170/381 cut-off events. [2024-06-04 16:58:22,360 INFO L125 PetriNetUnfolderBase]: For 15661/15661 co-relation queries the response was YES. [2024-06-04 16:58:22,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1614 conditions, 381 events. 170/381 cut-off events. For 15661/15661 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1717 event pairs, 38 based on Foata normal form. 6/387 useless extension candidates. Maximal degree in co-relation 1551. Up to 294 conditions per place. [2024-06-04 16:58:22,362 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 62 selfloop transitions, 5 changer transitions 17/87 dead transitions. [2024-06-04 16:58:22,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 87 transitions, 648 flow [2024-06-04 16:58:22,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:58:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:58:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 16:58:22,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36129032258064514 [2024-06-04 16:58:22,363 INFO L175 Difference]: Start difference. First operand has 151 places, 73 transitions, 444 flow. Second operand 10 states and 112 transitions. [2024-06-04 16:58:22,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 87 transitions, 648 flow [2024-06-04 16:58:22,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 87 transitions, 610 flow, removed 8 selfloop flow, removed 12 redundant places. [2024-06-04 16:58:22,385 INFO L231 Difference]: Finished difference. Result has 135 places, 67 transitions, 390 flow [2024-06-04 16:58:22,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=390, PETRI_PLACES=135, PETRI_TRANSITIONS=67} [2024-06-04 16:58:22,385 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 105 predicate places. [2024-06-04 16:58:22,386 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 67 transitions, 390 flow [2024-06-04 16:58:22,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:22,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:22,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:22,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-06-04 16:58:22,386 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:22,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:22,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1451249428, now seen corresponding path program 6 times [2024-06-04 16:58:22,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:22,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120722092] [2024-06-04 16:58:22,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:22,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15