./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix034_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/mix034_pso.opt_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 76401ed0 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix034_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-76401ed-m [2024-06-20 19:02:16,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 19:02:16,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 19:02:16,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 19:02:16,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 19:02:16,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 19:02:16,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 19:02:16,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 19:02:16,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 19:02:16,640 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 19:02:16,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 19:02:16,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 19:02:16,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 19:02:16,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 19:02:16,642 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 19:02:16,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 19:02:16,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 19:02:16,643 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 19:02:16,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 19:02:16,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 19:02:16,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 19:02:16,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 19:02:16,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 19:02:16,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 19:02:16,644 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 19:02:16,644 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 19:02:16,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 19:02:16,645 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 19:02:16,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 19:02:16,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 19:02:16,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 19:02:16,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 19:02:16,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:02:16,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 19:02:16,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 19:02:16,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 19:02:16,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 19:02:16,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 19:02:16,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 19:02:16,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 19:02:16,648 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 19:02:16,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 19:02:16,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 19:02:16,649 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-20 19:02:16,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 19:02:16,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 19:02:16,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 19:02:16,870 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 19:02:16,871 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 19:02:16,871 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/mix034_pso.opt_tso.opt.yml/witness.yml [2024-06-20 19:02:17,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 19:02:17,042 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 19:02:17,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2024-06-20 19:02:18,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 19:02:18,249 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 19:02:18,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2024-06-20 19:02:18,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d44cdc31/9efcb46923b7403a8f5073d46fe4a465/FLAG4f9d09bed [2024-06-20 19:02:18,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d44cdc31/9efcb46923b7403a8f5073d46fe4a465 [2024-06-20 19:02:18,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 19:02:18,284 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 19:02:18,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 19:02:18,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 19:02:18,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 19:02:18,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:02:17" (1/2) ... [2024-06-20 19:02:18,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523c9f0a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:02:18, skipping insertion in model container [2024-06-20 19:02:18,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:02:17" (1/2) ... [2024-06-20 19:02:18,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2c7a9abb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:02:18, skipping insertion in model container [2024-06-20 19:02:18,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:02:18" (2/2) ... [2024-06-20 19:02:18,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523c9f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18, skipping insertion in model container [2024-06-20 19:02:18,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:02:18" (2/2) ... [2024-06-20 19:02:18,294 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 19:02:18,348 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 19:02:18,349 INFO L97 edCorrectnessWitness]: Location invariant before [L817-L817] (((((((((((((((((! 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 <= __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_buff0_thd2 >= 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$r_buff1_thd2 >= 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_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 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$r_buff1_thd2 >= 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_buff0_thd1) + (long long )y >= 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$r_buff1_thd2 >= 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_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 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$r_buff1_thd1) + (long long )y >= 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) && (0LL - (long long )x$read_delayed) + (long long )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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 )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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 )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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 )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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 )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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 )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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 + (long long )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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$flush_delayed + (long long )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 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$r_buff1_thd2 >= 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_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 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$r_buff1_thd2 >= 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_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 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_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 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$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 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$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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 )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 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 )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 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 )z >= 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_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (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 )x$r_buff1_thd2 - (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) && 0 <= z) && __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) && z <= 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)) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_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 || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-20 19:02:18,349 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] (((((((((((((((((! 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 <= __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_buff0_thd2 >= 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$r_buff1_thd2 >= 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_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 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$r_buff1_thd2 >= 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_buff0_thd1) + (long long )y >= 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$r_buff1_thd2 >= 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_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 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$r_buff1_thd1) + (long long )y >= 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) && (0LL - (long long )x$read_delayed) + (long long )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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 )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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 )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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 )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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 )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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 )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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 + (long long )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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$flush_delayed + (long long )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 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$r_buff1_thd2 >= 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_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 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$r_buff1_thd2 >= 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_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 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_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 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$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 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$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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 )y >= 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_buff0_thd2 >= 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$r_buff1_thd2 >= 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) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 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 )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 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 )z >= 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_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (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 )x$r_buff1_thd2 - (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) && 0 <= z) && __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) && z <= 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)) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_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 || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-20 19:02:18,350 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 19:02:18,350 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-06-20 19:02:18,387 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 19:02:18,699 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:02:18,711 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 19:02:18,955 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:02:18,982 INFO L206 MainTranslator]: Completed translation [2024-06-20 19:02:18,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18 WrapperNode [2024-06-20 19:02:18,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 19:02:18,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 19:02:18,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 19:02:18,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 19:02:18,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18" (1/1) ... [2024-06-20 19:02:19,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18" (1/1) ... [2024-06-20 19:02:19,055 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 121 [2024-06-20 19:02:19,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 19:02:19,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 19:02:19,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 19:02:19,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 19:02:19,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18" (1/1) ... [2024-06-20 19:02:19,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18" (1/1) ... [2024-06-20 19:02:19,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18" (1/1) ... [2024-06-20 19:02:19,116 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-20 19:02:19,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18" (1/1) ... [2024-06-20 19:02:19,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18" (1/1) ... [2024-06-20 19:02:19,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18" (1/1) ... [2024-06-20 19:02:19,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18" (1/1) ... [2024-06-20 19:02:19,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18" (1/1) ... [2024-06-20 19:02:19,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18" (1/1) ... [2024-06-20 19:02:19,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 19:02:19,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 19:02:19,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 19:02:19,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 19:02:19,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18" (1/1) ... [2024-06-20 19:02:19,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:02:19,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 19:02:19,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-20 19:02:19,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-20 19:02:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 19:02:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 19:02:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 19:02:19,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 19:02:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 19:02:19,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 19:02:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 19:02:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 19:02:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 19:02:19,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 19:02:19,247 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 19:02:19,363 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 19:02:19,365 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 19:02:20,082 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 19:02:20,082 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 19:02:20,179 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 19:02:20,180 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 19:02:20,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:02:20 BoogieIcfgContainer [2024-06-20 19:02:20,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 19:02:20,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 19:02:20,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 19:02:20,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 19:02:20,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:02:17" (1/4) ... [2024-06-20 19:02:20,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744f2327 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:02:20, skipping insertion in model container [2024-06-20 19:02:20,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:02:18" (2/4) ... [2024-06-20 19:02:20,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744f2327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:02:20, skipping insertion in model container [2024-06-20 19:02:20,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:02:18" (3/4) ... [2024-06-20 19:02:20,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744f2327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:02:20, skipping insertion in model container [2024-06-20 19:02:20,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:02:20" (4/4) ... [2024-06-20 19:02:20,187 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2024-06-20 19:02:20,198 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 19:02:20,199 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-20 19:02:20,199 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 19:02:20,271 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 19:02:20,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-20 19:02:20,336 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-20 19:02:20,337 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:02:20,338 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-20 19:02:20,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-20 19:02:20,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-20 19:02:20,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 19:02:20,358 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;@51c1619e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 19:02:20,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-20 19:02:20,369 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 19:02:20,369 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 19:02:20,369 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:02:20,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:20,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 19:02:20,370 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:02:20,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:20,378 INFO L85 PathProgramCache]: Analyzing trace with hash 325228573, now seen corresponding path program 1 times [2024-06-20 19:02:20,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:20,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564229045] [2024-06-20 19:02:20,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:20,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:23,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-20 19:02:23,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:23,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564229045] [2024-06-20 19:02:23,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564229045] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:23,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:23,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 19:02:23,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541853179] [2024-06-20 19:02:23,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:23,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 19:02:23,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:24,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 19:02:24,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 19:02:24,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-20 19:02:24,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:24,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:24,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-20 19:02:24,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:24,223 INFO L124 PetriNetUnfolderBase]: 131/264 cut-off events. [2024-06-20 19:02:24,223 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-20 19:02:24,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 264 events. 131/264 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1001 event pairs, 75 based on Foata normal form. 1/252 useless extension candidates. Maximal degree in co-relation 509. Up to 235 conditions per place. [2024-06-20 19:02:24,229 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 20 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-20 19:02:24,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 113 flow [2024-06-20 19:02:24,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 19:02:24,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 19:02:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2024-06-20 19:02:24,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6236559139784946 [2024-06-20 19:02:24,240 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 58 transitions. [2024-06-20 19:02:24,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 113 flow [2024-06-20 19:02:24,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-20 19:02:24,243 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-20 19:02:24,245 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-20 19:02:24,249 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-20 19:02:24,249 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-20 19:02:24,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:24,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:24,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:24,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 19:02:24,250 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:02:24,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:24,251 INFO L85 PathProgramCache]: Analyzing trace with hash -987918916, now seen corresponding path program 1 times [2024-06-20 19:02:24,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:24,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094912816] [2024-06-20 19:02:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:24,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:26,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-20 19:02:26,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094912816] [2024-06-20 19:02:26,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094912816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:26,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:26,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 19:02:26,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371955564] [2024-06-20 19:02:26,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:26,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 19:02:26,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:26,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 19:02:26,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 19:02:26,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2024-06-20 19:02:26,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:26,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:26,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2024-06-20 19:02:26,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:26,821 INFO L124 PetriNetUnfolderBase]: 150/290 cut-off events. [2024-06-20 19:02:26,821 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-06-20 19:02:26,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 290 events. 150/290 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1116 event pairs, 68 based on Foata normal form. 2/286 useless extension candidates. Maximal degree in co-relation 646. Up to 258 conditions per place. [2024-06-20 19:02:26,823 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 25 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-20 19:02:26,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 157 flow [2024-06-20 19:02:26,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 19:02:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 19:02:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2024-06-20 19:02:26,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-06-20 19:02:26,825 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 72 transitions. [2024-06-20 19:02:26,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 157 flow [2024-06-20 19:02:26,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 19:02:26,827 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-20 19:02:26,827 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-20 19:02:26,827 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-20 19:02:26,828 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-20 19:02:26,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:26,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:26,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:26,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 19:02:26,829 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:02:26,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:26,829 INFO L85 PathProgramCache]: Analyzing trace with hash -560714168, now seen corresponding path program 1 times [2024-06-20 19:02:26,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:26,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913565438] [2024-06-20 19:02:26,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:26,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:02:29,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913565438] [2024-06-20 19:02:29,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913565438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:29,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:29,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 19:02:29,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657544625] [2024-06-20 19:02:29,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:29,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 19:02:29,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:29,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 19:02:29,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-20 19:02:29,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2024-06-20 19:02:29,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:29,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:29,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2024-06-20 19:02:29,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:30,239 INFO L124 PetriNetUnfolderBase]: 147/287 cut-off events. [2024-06-20 19:02:30,239 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2024-06-20 19:02:30,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 287 events. 147/287 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1066 event pairs, 47 based on Foata normal form. 2/285 useless extension candidates. Maximal degree in co-relation 709. Up to 244 conditions per place. [2024-06-20 19:02:30,243 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 29 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2024-06-20 19:02:30,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 205 flow [2024-06-20 19:02:30,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:02:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:02:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2024-06-20 19:02:30,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.567741935483871 [2024-06-20 19:02:30,244 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 88 transitions. [2024-06-20 19:02:30,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 205 flow [2024-06-20 19:02:30,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 196 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-20 19:02:30,246 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 119 flow [2024-06-20 19:02:30,246 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-20 19:02:30,247 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-20 19:02:30,247 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 119 flow [2024-06-20 19:02:30,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:30,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:30,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:30,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 19:02:30,248 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:02:30,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:30,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1117085549, now seen corresponding path program 1 times [2024-06-20 19:02:30,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:30,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176736603] [2024-06-20 19:02:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:30,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:02:33,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:33,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176736603] [2024-06-20 19:02:33,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176736603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:33,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:33,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:02:33,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945421338] [2024-06-20 19:02:33,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:33,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:02:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:33,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:02:33,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:02:33,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2024-06-20 19:02:33,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:33,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:33,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2024-06-20 19:02:33,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:33,833 INFO L124 PetriNetUnfolderBase]: 143/277 cut-off events. [2024-06-20 19:02:33,834 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2024-06-20 19:02:33,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 277 events. 143/277 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1030 event pairs, 25 based on Foata normal form. 4/275 useless extension candidates. Maximal degree in co-relation 748. Up to 218 conditions per place. [2024-06-20 19:02:33,836 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 29 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2024-06-20 19:02:33,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 219 flow [2024-06-20 19:02:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:02:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:02:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-20 19:02:33,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-06-20 19:02:33,838 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 119 flow. Second operand 6 states and 99 transitions. [2024-06-20 19:02:33,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 219 flow [2024-06-20 19:02:33,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 204 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-20 19:02:33,840 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 116 flow [2024-06-20 19:02:33,840 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-20 19:02:33,841 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-20 19:02:33,841 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 116 flow [2024-06-20 19:02:33,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:33,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:33,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:33,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 19:02:33,842 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-20 19:02:33,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:33,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1616896671, now seen corresponding path program 1 times [2024-06-20 19:02:33,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:33,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629462577] [2024-06-20 19:02:33,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:33,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:02:38,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:38,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629462577] [2024-06-20 19:02:38,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629462577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:38,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:38,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:02:38,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826199869] [2024-06-20 19:02:38,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:38,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:02:38,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:38,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:02:38,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:02:38,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-20 19:02:38,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:38,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:38,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-20 19:02:38,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:38,306 INFO L124 PetriNetUnfolderBase]: 119/247 cut-off events. [2024-06-20 19:02:38,306 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2024-06-20 19:02:38,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 247 events. 119/247 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 911 event pairs, 34 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 683. Up to 211 conditions per place. [2024-06-20 19:02:38,308 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 24 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2024-06-20 19:02:38,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 194 flow [2024-06-20 19:02:38,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:02:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:02:38,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-06-20 19:02:38,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645161290322581 [2024-06-20 19:02:38,311 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 116 flow. Second operand 5 states and 72 transitions. [2024-06-20 19:02:38,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 194 flow [2024-06-20 19:02:38,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 174 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-20 19:02:38,314 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 123 flow [2024-06-20 19:02:38,314 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=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-06-20 19:02:38,315 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2024-06-20 19:02:38,315 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 123 flow [2024-06-20 19:02:38,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:38,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:38,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:38,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 19:02:38,316 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:02:38,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:38,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1415809949, now seen corresponding path program 1 times [2024-06-20 19:02:38,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:38,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497751334] [2024-06-20 19:02:38,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:38,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:02:42,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:42,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497751334] [2024-06-20 19:02:42,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497751334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:42,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:42,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:02:42,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630604468] [2024-06-20 19:02:42,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:42,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:02:42,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:42,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:02:42,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:02:42,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:02:42,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 123 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:42,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:42,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:02:42,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:43,068 INFO L124 PetriNetUnfolderBase]: 139/275 cut-off events. [2024-06-20 19:02:43,068 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2024-06-20 19:02:43,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 275 events. 139/275 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1015 event pairs, 41 based on Foata normal form. 1/275 useless extension candidates. Maximal degree in co-relation 806. Up to 242 conditions per place. [2024-06-20 19:02:43,070 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 26 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2024-06-20 19:02:43,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 213 flow [2024-06-20 19:02:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:02:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:02:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-06-20 19:02:43,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42473118279569894 [2024-06-20 19:02:43,072 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 123 flow. Second operand 6 states and 79 transitions. [2024-06-20 19:02:43,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 213 flow [2024-06-20 19:02:43,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 202 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-20 19:02:43,076 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 145 flow [2024-06-20 19:02:43,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2024-06-20 19:02:43,079 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2024-06-20 19:02:43,079 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 145 flow [2024-06-20 19:02:43,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:43,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:43,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:43,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 19:02:43,080 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:02:43,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:43,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1029528762, now seen corresponding path program 1 times [2024-06-20 19:02:43,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:43,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514441588] [2024-06-20 19:02:43,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:43,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:02:47,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:47,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514441588] [2024-06-20 19:02:47,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514441588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:47,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:47,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:02:47,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137414225] [2024-06-20 19:02:47,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:47,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:02:47,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:47,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:02:47,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:02:47,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:02:47,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 145 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:47,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:47,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:02:47,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:48,005 INFO L124 PetriNetUnfolderBase]: 156/299 cut-off events. [2024-06-20 19:02:48,011 INFO L125 PetriNetUnfolderBase]: For 844/844 co-relation queries the response was YES. [2024-06-20 19:02:48,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 299 events. 156/299 cut-off events. For 844/844 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1115 event pairs, 46 based on Foata normal form. 2/300 useless extension candidates. Maximal degree in co-relation 961. Up to 255 conditions per place. [2024-06-20 19:02:48,024 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 31 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-20 19:02:48,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 257 flow [2024-06-20 19:02:48,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:02:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:02:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-06-20 19:02:48,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44623655913978494 [2024-06-20 19:02:48,037 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 145 flow. Second operand 6 states and 83 transitions. [2024-06-20 19:02:48,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 257 flow [2024-06-20 19:02:48,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 240 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 19:02:48,039 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 161 flow [2024-06-20 19:02:48,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-20 19:02:48,039 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-20 19:02:48,039 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 161 flow [2024-06-20 19:02:48,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:48,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:48,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:48,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 19:02:48,040 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:02:48,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:48,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1743905832, now seen corresponding path program 2 times [2024-06-20 19:02:48,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:48,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549157116] [2024-06-20 19:02:48,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:48,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:02:52,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:52,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549157116] [2024-06-20 19:02:52,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549157116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:52,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:52,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:02:52,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869417327] [2024-06-20 19:02:52,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:52,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:02:52,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:52,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:02:52,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:02:52,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:02:52,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 161 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:52,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:52,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:02:52,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:52,831 INFO L124 PetriNetUnfolderBase]: 157/304 cut-off events. [2024-06-20 19:02:52,831 INFO L125 PetriNetUnfolderBase]: For 1121/1123 co-relation queries the response was YES. [2024-06-20 19:02:52,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 304 events. 157/304 cut-off events. For 1121/1123 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1153 event pairs, 50 based on Foata normal form. 4/307 useless extension candidates. Maximal degree in co-relation 1039. Up to 248 conditions per place. [2024-06-20 19:02:52,833 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 28 selfloop transitions, 11 changer transitions 0/44 dead transitions. [2024-06-20 19:02:52,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 273 flow [2024-06-20 19:02:52,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:02:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:02:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-06-20 19:02:52,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44623655913978494 [2024-06-20 19:02:52,834 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 161 flow. Second operand 6 states and 83 transitions. [2024-06-20 19:02:52,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 273 flow [2024-06-20 19:02:52,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 256 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 19:02:52,838 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 187 flow [2024-06-20 19:02:52,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2024-06-20 19:02:52,839 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-20 19:02:52,839 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 187 flow [2024-06-20 19:02:52,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:52,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:52,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:52,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 19:02:52,839 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:02:52,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:52,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1743897896, now seen corresponding path program 1 times [2024-06-20 19:02:52,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:52,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352337533] [2024-06-20 19:02:52,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:52,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:02:56,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:56,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352337533] [2024-06-20 19:02:56,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352337533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:56,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:56,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:02:56,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381059227] [2024-06-20 19:02:56,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:56,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:02:56,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:56,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:02:56,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:02:56,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:02:56,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 187 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:56,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:56,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:02:56,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:57,104 INFO L124 PetriNetUnfolderBase]: 144/284 cut-off events. [2024-06-20 19:02:57,104 INFO L125 PetriNetUnfolderBase]: For 1084/1084 co-relation queries the response was YES. [2024-06-20 19:02:57,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 284 events. 144/284 cut-off events. For 1084/1084 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1064 event pairs, 39 based on Foata normal form. 1/284 useless extension candidates. Maximal degree in co-relation 1007. Up to 248 conditions per place. [2024-06-20 19:02:57,108 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 31 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2024-06-20 19:02:57,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 295 flow [2024-06-20 19:02:57,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:02:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:02:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-20 19:02:57,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147465437788018 [2024-06-20 19:02:57,109 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 187 flow. Second operand 7 states and 90 transitions. [2024-06-20 19:02:57,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 295 flow [2024-06-20 19:02:57,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 268 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-20 19:02:57,112 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 199 flow [2024-06-20 19:02:57,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=199, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-06-20 19:02:57,113 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2024-06-20 19:02:57,113 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 199 flow [2024-06-20 19:02:57,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:57,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:57,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:57,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 19:02:57,114 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-20 19:02:57,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1850739904, now seen corresponding path program 1 times [2024-06-20 19:02:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:57,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803384434] [2024-06-20 19:02:57,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:57,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:03:01,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:01,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803384434] [2024-06-20 19:03:01,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803384434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:01,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:01,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:03:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855496393] [2024-06-20 19:03:01,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:01,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:03:01,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:01,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:03:01,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:03:01,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:03:01,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 199 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:01,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:01,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:03:01,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:01,936 INFO L124 PetriNetUnfolderBase]: 150/293 cut-off events. [2024-06-20 19:03:01,936 INFO L125 PetriNetUnfolderBase]: For 1477/1477 co-relation queries the response was YES. [2024-06-20 19:03:01,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 293 events. 150/293 cut-off events. For 1477/1477 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1094 event pairs, 42 based on Foata normal form. 1/293 useless extension candidates. Maximal degree in co-relation 1091. Up to 241 conditions per place. [2024-06-20 19:03:01,938 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 38 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2024-06-20 19:03:01,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 343 flow [2024-06-20 19:03:01,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:03:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:03:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-20 19:03:01,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423963133640553 [2024-06-20 19:03:01,939 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 199 flow. Second operand 7 states and 96 transitions. [2024-06-20 19:03:01,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 343 flow [2024-06-20 19:03:01,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 320 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-20 19:03:01,941 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 221 flow [2024-06-20 19:03:01,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2024-06-20 19:03:01,942 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2024-06-20 19:03:01,942 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 221 flow [2024-06-20 19:03:01,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:01,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:01,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:01,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 19:03:01,943 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:03:01,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:01,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1767065768, now seen corresponding path program 1 times [2024-06-20 19:03:01,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:01,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126850598] [2024-06-20 19:03:01,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:01,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:03:06,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:06,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126850598] [2024-06-20 19:03:06,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126850598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:06,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:06,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:03:06,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983758427] [2024-06-20 19:03:06,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:06,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:03:06,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:06,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:03:06,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:03:07,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:07,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 221 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:07,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:07,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:07,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:07,246 INFO L124 PetriNetUnfolderBase]: 168/315 cut-off events. [2024-06-20 19:03:07,247 INFO L125 PetriNetUnfolderBase]: For 1820/1820 co-relation queries the response was YES. [2024-06-20 19:03:07,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 315 events. 168/315 cut-off events. For 1820/1820 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1165 event pairs, 44 based on Foata normal form. 2/316 useless extension candidates. Maximal degree in co-relation 1222. Up to 275 conditions per place. [2024-06-20 19:03:07,249 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 41 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-06-20 19:03:07,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 369 flow [2024-06-20 19:03:07,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:03:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:03:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-20 19:03:07,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41013824884792627 [2024-06-20 19:03:07,251 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 221 flow. Second operand 7 states and 89 transitions. [2024-06-20 19:03:07,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 369 flow [2024-06-20 19:03:07,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 340 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-20 19:03:07,254 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 235 flow [2024-06-20 19:03:07,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-06-20 19:03:07,254 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2024-06-20 19:03:07,255 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 235 flow [2024-06-20 19:03:07,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:07,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:07,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:07,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 19:03:07,255 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:03:07,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:07,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1773732008, now seen corresponding path program 2 times [2024-06-20 19:03:07,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:07,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811190605] [2024-06-20 19:03:07,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:07,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:03:12,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:12,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811190605] [2024-06-20 19:03:12,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811190605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:12,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:12,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:03:12,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341668023] [2024-06-20 19:03:12,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:12,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:03:12,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:12,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:03:12,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:03:12,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:12,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 235 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:12,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:12,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:12,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:12,375 INFO L124 PetriNetUnfolderBase]: 179/336 cut-off events. [2024-06-20 19:03:12,375 INFO L125 PetriNetUnfolderBase]: For 2335/2337 co-relation queries the response was YES. [2024-06-20 19:03:12,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 336 events. 179/336 cut-off events. For 2335/2337 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1279 event pairs, 48 based on Foata normal form. 4/339 useless extension candidates. Maximal degree in co-relation 1369. Up to 264 conditions per place. [2024-06-20 19:03:12,378 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 36 selfloop transitions, 18 changer transitions 0/57 dead transitions. [2024-06-20 19:03:12,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 431 flow [2024-06-20 19:03:12,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:03:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:03:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-20 19:03:12,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-20 19:03:12,379 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 235 flow. Second operand 7 states and 91 transitions. [2024-06-20 19:03:12,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 431 flow [2024-06-20 19:03:12,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 404 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-20 19:03:12,383 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 289 flow [2024-06-20 19:03:12,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=289, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-06-20 19:03:12,385 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-06-20 19:03:12,385 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 289 flow [2024-06-20 19:03:12,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:12,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:12,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:12,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 19:03:12,386 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:03:12,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash 911052452, now seen corresponding path program 3 times [2024-06-20 19:03:12,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:12,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401889136] [2024-06-20 19:03:12,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:12,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:03:17,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:17,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401889136] [2024-06-20 19:03:17,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401889136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:17,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:17,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:03:17,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891567231] [2024-06-20 19:03:17,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:17,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:03:17,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:17,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:03:17,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:03:17,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:17,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 289 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:17,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:17,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:17,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:17,592 INFO L124 PetriNetUnfolderBase]: 175/332 cut-off events. [2024-06-20 19:03:17,593 INFO L125 PetriNetUnfolderBase]: For 2682/2684 co-relation queries the response was YES. [2024-06-20 19:03:17,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 332 events. 175/332 cut-off events. For 2682/2684 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1274 event pairs, 50 based on Foata normal form. 4/335 useless extension candidates. Maximal degree in co-relation 1399. Up to 261 conditions per place. [2024-06-20 19:03:17,595 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 36 selfloop transitions, 17 changer transitions 0/56 dead transitions. [2024-06-20 19:03:17,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 56 transitions, 423 flow [2024-06-20 19:03:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:03:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:03:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-20 19:03:17,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-20 19:03:17,597 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 289 flow. Second operand 7 states and 91 transitions. [2024-06-20 19:03:17,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 56 transitions, 423 flow [2024-06-20 19:03:17,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 56 transitions, 388 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-20 19:03:17,600 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 293 flow [2024-06-20 19:03:17,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=293, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2024-06-20 19:03:17,602 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-06-20 19:03:17,602 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 293 flow [2024-06-20 19:03:17,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:17,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:17,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:17,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 19:03:17,603 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:03:17,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:17,603 INFO L85 PathProgramCache]: Analyzing trace with hash -915519820, now seen corresponding path program 1 times [2024-06-20 19:03:17,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:17,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357542479] [2024-06-20 19:03:17,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:17,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:03:21,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:21,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357542479] [2024-06-20 19:03:21,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357542479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:21,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:21,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:21,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19711954] [2024-06-20 19:03:21,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:21,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:21,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:21,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:21,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:22,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:22,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 293 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:22,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:22,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:22,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:22,394 INFO L124 PetriNetUnfolderBase]: 189/359 cut-off events. [2024-06-20 19:03:22,394 INFO L125 PetriNetUnfolderBase]: For 2974/2974 co-relation queries the response was YES. [2024-06-20 19:03:22,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 359 events. 189/359 cut-off events. For 2974/2974 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1409 event pairs, 48 based on Foata normal form. 1/359 useless extension candidates. Maximal degree in co-relation 1549. Up to 312 conditions per place. [2024-06-20 19:03:22,398 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 50 selfloop transitions, 15 changer transitions 0/68 dead transitions. [2024-06-20 19:03:22,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 68 transitions, 518 flow [2024-06-20 19:03:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:03:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:03:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-20 19:03:22,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-20 19:03:22,400 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 293 flow. Second operand 9 states and 109 transitions. [2024-06-20 19:03:22,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 68 transitions, 518 flow [2024-06-20 19:03:22,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 468 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-20 19:03:22,406 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 363 flow [2024-06-20 19:03:22,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=363, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-06-20 19:03:22,407 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2024-06-20 19:03:22,407 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 363 flow [2024-06-20 19:03:22,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:22,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:22,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:22,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 19:03:22,408 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:03:22,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:22,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1055685154, now seen corresponding path program 2 times [2024-06-20 19:03:22,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:22,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67537149] [2024-06-20 19:03:22,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:22,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:27,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:03:27,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:27,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67537149] [2024-06-20 19:03:27,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67537149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:27,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:27,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:27,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816333823] [2024-06-20 19:03:27,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:27,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:27,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:27,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:27,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:28,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:28,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 363 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:28,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:28,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:28,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:28,389 INFO L124 PetriNetUnfolderBase]: 187/356 cut-off events. [2024-06-20 19:03:28,390 INFO L125 PetriNetUnfolderBase]: For 3342/3342 co-relation queries the response was YES. [2024-06-20 19:03:28,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 356 events. 187/356 cut-off events. For 3342/3342 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1379 event pairs, 47 based on Foata normal form. 1/356 useless extension candidates. Maximal degree in co-relation 1580. Up to 294 conditions per place. [2024-06-20 19:03:28,392 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 47 selfloop transitions, 20 changer transitions 0/70 dead transitions. [2024-06-20 19:03:28,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 559 flow [2024-06-20 19:03:28,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:03:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:03:28,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-20 19:03:28,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-20 19:03:28,393 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 363 flow. Second operand 8 states and 100 transitions. [2024-06-20 19:03:28,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 559 flow [2024-06-20 19:03:28,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 522 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-20 19:03:28,397 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 404 flow [2024-06-20 19:03:28,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=404, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2024-06-20 19:03:28,398 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2024-06-20 19:03:28,398 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 404 flow [2024-06-20 19:03:28,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:28,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:28,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:28,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 19:03:28,399 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:03:28,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:28,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1534636507, now seen corresponding path program 1 times [2024-06-20 19:03:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:28,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673452889] [2024-06-20 19:03:28,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:03:33,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:33,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673452889] [2024-06-20 19:03:33,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673452889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:33,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:33,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:33,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740564789] [2024-06-20 19:03:33,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:33,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:33,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:33,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:33,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:33,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:33,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 404 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:33,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:33,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:33,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:33,971 INFO L124 PetriNetUnfolderBase]: 193/366 cut-off events. [2024-06-20 19:03:33,971 INFO L125 PetriNetUnfolderBase]: For 3879/3879 co-relation queries the response was YES. [2024-06-20 19:03:33,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 366 events. 193/366 cut-off events. For 3879/3879 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1429 event pairs, 44 based on Foata normal form. 2/367 useless extension candidates. Maximal degree in co-relation 1678. Up to 306 conditions per place. [2024-06-20 19:03:33,975 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 55 selfloop transitions, 14 changer transitions 0/72 dead transitions. [2024-06-20 19:03:33,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 72 transitions, 600 flow [2024-06-20 19:03:33,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:03:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:03:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-20 19:03:33,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-20 19:03:33,978 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 404 flow. Second operand 8 states and 100 transitions. [2024-06-20 19:03:33,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 72 transitions, 600 flow [2024-06-20 19:03:33,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 72 transitions, 540 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-20 19:03:33,982 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 401 flow [2024-06-20 19:03:33,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=401, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2024-06-20 19:03:33,983 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2024-06-20 19:03:33,983 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 401 flow [2024-06-20 19:03:33,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:33,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:33,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:33,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 19:03:33,986 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:03:33,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash -848614857, now seen corresponding path program 2 times [2024-06-20 19:03:33,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:33,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765049962] [2024-06-20 19:03:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:39,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:03:39,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:39,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765049962] [2024-06-20 19:03:39,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765049962] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:39,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:39,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:39,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586241177] [2024-06-20 19:03:39,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:39,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:39,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:39,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:39,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:39,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:39,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 59 transitions, 401 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:39,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:39,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:39,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:39,616 INFO L124 PetriNetUnfolderBase]: 204/385 cut-off events. [2024-06-20 19:03:39,617 INFO L125 PetriNetUnfolderBase]: For 4067/4069 co-relation queries the response was YES. [2024-06-20 19:03:39,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1801 conditions, 385 events. 204/385 cut-off events. For 4067/4069 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1522 event pairs, 45 based on Foata normal form. 4/388 useless extension candidates. Maximal degree in co-relation 1767. Up to 274 conditions per place. [2024-06-20 19:03:39,619 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 48 selfloop transitions, 26 changer transitions 0/77 dead transitions. [2024-06-20 19:03:39,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 77 transitions, 665 flow [2024-06-20 19:03:39,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:03:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:03:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-20 19:03:39,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153225806451613 [2024-06-20 19:03:39,621 INFO L175 Difference]: Start difference. First operand has 72 places, 59 transitions, 401 flow. Second operand 8 states and 103 transitions. [2024-06-20 19:03:39,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 77 transitions, 665 flow [2024-06-20 19:03:39,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 77 transitions, 626 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 19:03:39,625 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 482 flow [2024-06-20 19:03:39,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=482, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2024-06-20 19:03:39,626 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2024-06-20 19:03:39,626 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 482 flow [2024-06-20 19:03:39,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:39,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:39,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:39,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 19:03:39,627 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:03:39,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:39,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1814792577, now seen corresponding path program 3 times [2024-06-20 19:03:39,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:39,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309031367] [2024-06-20 19:03:39,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:39,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:44,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-20 19:03:44,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:44,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309031367] [2024-06-20 19:03:44,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309031367] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:44,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:44,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:44,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113701434] [2024-06-20 19:03:44,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:44,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:44,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:44,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:44,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:44,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:44,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 482 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:44,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:44,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:44,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:45,037 INFO L124 PetriNetUnfolderBase]: 210/395 cut-off events. [2024-06-20 19:03:45,037 INFO L125 PetriNetUnfolderBase]: For 4692/4694 co-relation queries the response was YES. [2024-06-20 19:03:45,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1962 conditions, 395 events. 210/395 cut-off events. For 4692/4694 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1578 event pairs, 45 based on Foata normal form. 4/398 useless extension candidates. Maximal degree in co-relation 1926. Up to 280 conditions per place. [2024-06-20 19:03:45,040 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 50 selfloop transitions, 26 changer transitions 0/79 dead transitions. [2024-06-20 19:03:45,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 79 transitions, 732 flow [2024-06-20 19:03:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:03:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:03:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-20 19:03:45,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-20 19:03:45,041 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 482 flow. Second operand 8 states and 104 transitions. [2024-06-20 19:03:45,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 79 transitions, 732 flow [2024-06-20 19:03:45,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 79 transitions, 684 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-20 19:03:45,047 INFO L231 Difference]: Finished difference. Result has 79 places, 66 transitions, 519 flow [2024-06-20 19:03:45,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=519, PETRI_PLACES=79, PETRI_TRANSITIONS=66} [2024-06-20 19:03:45,047 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-06-20 19:03:45,048 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 66 transitions, 519 flow [2024-06-20 19:03:45,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:45,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:45,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:45,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 19:03:45,049 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:03:45,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:45,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2041778913, now seen corresponding path program 4 times [2024-06-20 19:03:45,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:45,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444333119] [2024-06-20 19:03:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:50,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-20 19:03:50,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:50,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444333119] [2024-06-20 19:03:50,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444333119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:50,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:50,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884446734] [2024-06-20 19:03:50,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:50,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:50,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:50,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:50,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:50,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 66 transitions, 519 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:50,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:50,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:50,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:50,374 INFO L124 PetriNetUnfolderBase]: 206/391 cut-off events. [2024-06-20 19:03:50,375 INFO L125 PetriNetUnfolderBase]: For 4861/4863 co-relation queries the response was YES. [2024-06-20 19:03:50,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 391 events. 206/391 cut-off events. For 4861/4863 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1555 event pairs, 51 based on Foata normal form. 4/394 useless extension candidates. Maximal degree in co-relation 1927. Up to 277 conditions per place. [2024-06-20 19:03:50,378 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 50 selfloop transitions, 26 changer transitions 0/79 dead transitions. [2024-06-20 19:03:50,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 716 flow [2024-06-20 19:03:50,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:03:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:03:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-20 19:03:50,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-20 19:03:50,379 INFO L175 Difference]: Start difference. First operand has 79 places, 66 transitions, 519 flow. Second operand 8 states and 104 transitions. [2024-06-20 19:03:50,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 716 flow [2024-06-20 19:03:50,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 649 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-20 19:03:50,405 INFO L231 Difference]: Finished difference. Result has 82 places, 67 transitions, 518 flow [2024-06-20 19:03:50,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=518, PETRI_PLACES=82, PETRI_TRANSITIONS=67} [2024-06-20 19:03:50,405 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 52 predicate places. [2024-06-20 19:03:50,405 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 518 flow [2024-06-20 19:03:50,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:50,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:50,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:50,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 19:03:50,406 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:03:50,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1814515747, now seen corresponding path program 1 times [2024-06-20 19:03:50,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:50,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219476008] [2024-06-20 19:03:50,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:50,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:03:56,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:56,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219476008] [2024-06-20 19:03:56,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219476008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:56,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:56,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:03:56,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031081581] [2024-06-20 19:03:56,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:56,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:03:56,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:56,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:03:56,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:03:56,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:56,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 518 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:56,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:56,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:56,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:56,493 INFO L124 PetriNetUnfolderBase]: 204/386 cut-off events. [2024-06-20 19:03:56,493 INFO L125 PetriNetUnfolderBase]: For 4941/4941 co-relation queries the response was YES. [2024-06-20 19:03:56,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1948 conditions, 386 events. 204/386 cut-off events. For 4941/4941 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1528 event pairs, 55 based on Foata normal form. 1/386 useless extension candidates. Maximal degree in co-relation 1909. Up to 345 conditions per place. [2024-06-20 19:03:56,496 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 61 selfloop transitions, 14 changer transitions 0/78 dead transitions. [2024-06-20 19:03:56,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 78 transitions, 702 flow [2024-06-20 19:03:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:03:56,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:03:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-20 19:03:56,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-20 19:03:56,497 INFO L175 Difference]: Start difference. First operand has 82 places, 67 transitions, 518 flow. Second operand 9 states and 104 transitions. [2024-06-20 19:03:56,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 78 transitions, 702 flow [2024-06-20 19:03:56,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 78 transitions, 660 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-20 19:03:56,503 INFO L231 Difference]: Finished difference. Result has 86 places, 69 transitions, 525 flow [2024-06-20 19:03:56,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=525, PETRI_PLACES=86, PETRI_TRANSITIONS=69} [2024-06-20 19:03:56,503 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2024-06-20 19:03:56,503 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 69 transitions, 525 flow [2024-06-20 19:03:56,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:56,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:56,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:56,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 19:03:56,504 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:03:56,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash 683537005, now seen corresponding path program 1 times [2024-06-20 19:03:56,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:56,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807693379] [2024-06-20 19:03:56,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:56,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:01,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:04:01,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:01,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807693379] [2024-06-20 19:04:01,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807693379] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:01,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:01,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:04:01,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214299010] [2024-06-20 19:04:01,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:01,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:04:01,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:01,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:04:01,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:04:02,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:04:02,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 69 transitions, 525 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:02,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:02,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:04:02,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:02,392 INFO L124 PetriNetUnfolderBase]: 189/372 cut-off events. [2024-06-20 19:04:02,392 INFO L125 PetriNetUnfolderBase]: For 5609/5609 co-relation queries the response was YES. [2024-06-20 19:04:02,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 372 events. 189/372 cut-off events. For 5609/5609 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1539 event pairs, 23 based on Foata normal form. 2/369 useless extension candidates. Maximal degree in co-relation 1868. Up to 271 conditions per place. [2024-06-20 19:04:02,395 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 61 selfloop transitions, 14 changer transitions 0/85 dead transitions. [2024-06-20 19:04:02,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 85 transitions, 725 flow [2024-06-20 19:04:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:04:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:04:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-20 19:04:02,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274193548387097 [2024-06-20 19:04:02,397 INFO L175 Difference]: Start difference. First operand has 86 places, 69 transitions, 525 flow. Second operand 8 states and 106 transitions. [2024-06-20 19:04:02,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 85 transitions, 725 flow [2024-06-20 19:04:02,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 85 transitions, 643 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-20 19:04:02,402 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 487 flow [2024-06-20 19:04:02,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=487, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2024-06-20 19:04:02,403 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-06-20 19:04:02,403 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 487 flow [2024-06-20 19:04:02,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:02,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:02,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:02,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 19:04:02,404 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:04:02,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:02,404 INFO L85 PathProgramCache]: Analyzing trace with hash -444566465, now seen corresponding path program 2 times [2024-06-20 19:04:02,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:02,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557536511] [2024-06-20 19:04:02,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:02,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04: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-20 19:04:07,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:07,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557536511] [2024-06-20 19:04:07,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557536511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:07,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:07,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:04:07,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759193080] [2024-06-20 19:04:07,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:07,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:04:07,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:07,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:04:07,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:04:07,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:04:07,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 487 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:07,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:07,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:04:07,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:07,771 INFO L124 PetriNetUnfolderBase]: 193/380 cut-off events. [2024-06-20 19:04:07,772 INFO L125 PetriNetUnfolderBase]: For 6124/6124 co-relation queries the response was YES. [2024-06-20 19:04:07,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1935 conditions, 380 events. 193/380 cut-off events. For 6124/6124 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1583 event pairs, 40 based on Foata normal form. 2/377 useless extension candidates. Maximal degree in co-relation 1895. Up to 294 conditions per place. [2024-06-20 19:04:07,774 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 58 selfloop transitions, 17 changer transitions 0/85 dead transitions. [2024-06-20 19:04:07,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 687 flow [2024-06-20 19:04:07,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:04:07,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:04:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-20 19:04:07,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314516129032258 [2024-06-20 19:04:07,777 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 487 flow. Second operand 8 states and 107 transitions. [2024-06-20 19:04:07,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 687 flow [2024-06-20 19:04:07,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 85 transitions, 653 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-20 19:04:07,782 INFO L231 Difference]: Finished difference. Result has 86 places, 71 transitions, 506 flow [2024-06-20 19:04:07,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=506, PETRI_PLACES=86, PETRI_TRANSITIONS=71} [2024-06-20 19:04:07,782 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2024-06-20 19:04:07,782 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 71 transitions, 506 flow [2024-06-20 19:04:07,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:07,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:07,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:07,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 19:04:07,784 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:04:07,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:07,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1755035389, now seen corresponding path program 1 times [2024-06-20 19:04:07,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:07,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790823873] [2024-06-20 19:04:07,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:07,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:12,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-20 19:04:12,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:12,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790823873] [2024-06-20 19:04:12,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790823873] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:12,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:12,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:04:12,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885152540] [2024-06-20 19:04:12,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:12,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:04:12,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:12,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:04:12,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:04:12,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:04:12,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 71 transitions, 506 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:12,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:12,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:04:12,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:13,234 INFO L124 PetriNetUnfolderBase]: 210/400 cut-off events. [2024-06-20 19:04:13,234 INFO L125 PetriNetUnfolderBase]: For 6290/6290 co-relation queries the response was YES. [2024-06-20 19:04:13,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2009 conditions, 400 events. 210/400 cut-off events. For 6290/6290 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1608 event pairs, 48 based on Foata normal form. 1/400 useless extension candidates. Maximal degree in co-relation 1968. Up to 331 conditions per place. [2024-06-20 19:04:13,237 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 62 selfloop transitions, 22 changer transitions 0/87 dead transitions. [2024-06-20 19:04:13,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 738 flow [2024-06-20 19:04:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:04:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:04:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-20 19:04:13,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-20 19:04:13,252 INFO L175 Difference]: Start difference. First operand has 86 places, 71 transitions, 506 flow. Second operand 9 states and 110 transitions. [2024-06-20 19:04:13,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 738 flow [2024-06-20 19:04:13,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 87 transitions, 697 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 19:04:13,258 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 545 flow [2024-06-20 19:04:13,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=545, PETRI_PLACES=89, PETRI_TRANSITIONS=73} [2024-06-20 19:04:13,259 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2024-06-20 19:04:13,259 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 545 flow [2024-06-20 19:04:13,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:13,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:13,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:13,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 19:04:13,261 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:04:13,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash -329275295, now seen corresponding path program 3 times [2024-06-20 19:04:13,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:13,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759368463] [2024-06-20 19:04:13,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:13,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:04:17,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:17,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759368463] [2024-06-20 19:04:17,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759368463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:17,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:17,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:04:17,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707515779] [2024-06-20 19:04:17,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:17,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:04:17,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:17,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:04:17,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:04:17,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-20 19:04:17,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 73 transitions, 545 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:17,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:17,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-20 19:04:17,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:18,008 INFO L124 PetriNetUnfolderBase]: 196/386 cut-off events. [2024-06-20 19:04:18,008 INFO L125 PetriNetUnfolderBase]: For 7177/7177 co-relation queries the response was YES. [2024-06-20 19:04:18,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 386 events. 196/386 cut-off events. For 7177/7177 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1587 event pairs, 38 based on Foata normal form. 2/381 useless extension candidates. Maximal degree in co-relation 1958. Up to 314 conditions per place. [2024-06-20 19:04:18,011 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 64 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2024-06-20 19:04:18,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 87 transitions, 751 flow [2024-06-20 19:04:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:04:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:04:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-20 19:04:18,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-20 19:04:18,014 INFO L175 Difference]: Start difference. First operand has 89 places, 73 transitions, 545 flow. Second operand 8 states and 112 transitions. [2024-06-20 19:04:18,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 87 transitions, 751 flow [2024-06-20 19:04:18,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 87 transitions, 689 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 19:04:18,020 INFO L231 Difference]: Finished difference. Result has 91 places, 76 transitions, 545 flow [2024-06-20 19:04:18,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=545, PETRI_PLACES=91, PETRI_TRANSITIONS=76} [2024-06-20 19:04:18,021 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 61 predicate places. [2024-06-20 19:04:18,021 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 76 transitions, 545 flow [2024-06-20 19:04:18,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:18,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:18,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:18,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 19:04:18,021 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:04:18,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1759683777, now seen corresponding path program 1 times [2024-06-20 19:04:18,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:18,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499750882] [2024-06-20 19:04:18,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:18,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:04:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:22,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499750882] [2024-06-20 19:04:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499750882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:22,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:22,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:04:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989620070] [2024-06-20 19:04:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:22,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:04:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:22,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:04:22,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:04:23,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:04:23,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 76 transitions, 545 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:23,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:23,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:04:23,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:23,290 INFO L124 PetriNetUnfolderBase]: 220/418 cut-off events. [2024-06-20 19:04:23,291 INFO L125 PetriNetUnfolderBase]: For 7684/7684 co-relation queries the response was YES. [2024-06-20 19:04:23,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2166 conditions, 418 events. 220/418 cut-off events. For 7684/7684 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1708 event pairs, 43 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 2122. Up to 348 conditions per place. [2024-06-20 19:04:23,294 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 72 selfloop transitions, 17 changer transitions 0/92 dead transitions. [2024-06-20 19:04:23,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 92 transitions, 795 flow [2024-06-20 19:04:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:04:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:04:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-20 19:04:23,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-20 19:04:23,296 INFO L175 Difference]: Start difference. First operand has 91 places, 76 transitions, 545 flow. Second operand 9 states and 111 transitions. [2024-06-20 19:04:23,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 92 transitions, 795 flow [2024-06-20 19:04:23,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 759 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-20 19:04:23,303 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 578 flow [2024-06-20 19:04:23,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=578, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2024-06-20 19:04:23,304 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2024-06-20 19:04:23,304 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 578 flow [2024-06-20 19:04:23,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:23,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:23,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:23,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 19:04:23,305 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:04:23,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash -652080023, now seen corresponding path program 4 times [2024-06-20 19:04:23,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:23,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688054548] [2024-06-20 19:04:23,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:23,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:04:27,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:27,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688054548] [2024-06-20 19:04:27,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688054548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:27,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:27,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:04:27,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191716646] [2024-06-20 19:04:27,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:27,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:04:27,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:27,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:04:27,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:04:27,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-20 19:04:27,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 578 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:27,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:27,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-20 19:04:27,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:28,039 INFO L124 PetriNetUnfolderBase]: 199/394 cut-off events. [2024-06-20 19:04:28,040 INFO L125 PetriNetUnfolderBase]: For 7779/7781 co-relation queries the response was YES. [2024-06-20 19:04:28,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2052 conditions, 394 events. 199/394 cut-off events. For 7779/7781 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1666 event pairs, 39 based on Foata normal form. 4/393 useless extension candidates. Maximal degree in co-relation 2007. Up to 310 conditions per place. [2024-06-20 19:04:28,043 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 62 selfloop transitions, 17 changer transitions 0/89 dead transitions. [2024-06-20 19:04:28,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 89 transitions, 770 flow [2024-06-20 19:04:28,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:04:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:04:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-20 19:04:28,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-20 19:04:28,045 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 578 flow. Second operand 8 states and 112 transitions. [2024-06-20 19:04:28,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 89 transitions, 770 flow [2024-06-20 19:04:28,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 89 transitions, 717 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 19:04:28,055 INFO L231 Difference]: Finished difference. Result has 97 places, 80 transitions, 580 flow [2024-06-20 19:04:28,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=580, PETRI_PLACES=97, PETRI_TRANSITIONS=80} [2024-06-20 19:04:28,056 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 67 predicate places. [2024-06-20 19:04:28,056 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 80 transitions, 580 flow [2024-06-20 19:04:28,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:28,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:28,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:28,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 19:04:28,057 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:04:28,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:28,057 INFO L85 PathProgramCache]: Analyzing trace with hash -415719965, now seen corresponding path program 2 times [2024-06-20 19:04:28,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:28,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090523742] [2024-06-20 19:04:28,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:28,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:04:33,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:33,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090523742] [2024-06-20 19:04:33,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090523742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:33,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:33,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:04:33,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178514086] [2024-06-20 19:04:33,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:33,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:04:33,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:33,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:04:33,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:04:33,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:04:33,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 80 transitions, 580 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:33,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:33,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:04:33,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:33,881 INFO L124 PetriNetUnfolderBase]: 238/452 cut-off events. [2024-06-20 19:04:33,881 INFO L125 PetriNetUnfolderBase]: For 9544/9546 co-relation queries the response was YES. [2024-06-20 19:04:33,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2449 conditions, 452 events. 238/452 cut-off events. For 9544/9546 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1904 event pairs, 40 based on Foata normal form. 4/455 useless extension candidates. Maximal degree in co-relation 2402. Up to 291 conditions per place. [2024-06-20 19:04:33,885 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 61 selfloop transitions, 37 changer transitions 0/101 dead transitions. [2024-06-20 19:04:33,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 101 transitions, 1024 flow [2024-06-20 19:04:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:04:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:04:33,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-20 19:04:33,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-20 19:04:33,888 INFO L175 Difference]: Start difference. First operand has 97 places, 80 transitions, 580 flow. Second operand 9 states and 117 transitions. [2024-06-20 19:04:33,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 101 transitions, 1024 flow [2024-06-20 19:04:33,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 101 transitions, 959 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-20 19:04:33,898 INFO L231 Difference]: Finished difference. Result has 100 places, 86 transitions, 688 flow [2024-06-20 19:04:33,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=688, PETRI_PLACES=100, PETRI_TRANSITIONS=86} [2024-06-20 19:04:33,898 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 70 predicate places. [2024-06-20 19:04:33,899 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 86 transitions, 688 flow [2024-06-20 19:04:33,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:33,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:33,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:33,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 19:04:33,899 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:04:33,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:33,900 INFO L85 PathProgramCache]: Analyzing trace with hash -163451463, now seen corresponding path program 3 times [2024-06-20 19:04:33,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:33,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834900918] [2024-06-20 19:04:33,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:33,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:04:39,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:39,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834900918] [2024-06-20 19:04:39,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834900918] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:39,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:39,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:04:39,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395529533] [2024-06-20 19:04:39,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:39,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:04:39,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:39,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:04:39,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:04:39,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:04:39,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 86 transitions, 688 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:39,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:39,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:04:39,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:39,840 INFO L124 PetriNetUnfolderBase]: 244/462 cut-off events. [2024-06-20 19:04:39,840 INFO L125 PetriNetUnfolderBase]: For 10468/10470 co-relation queries the response was YES. [2024-06-20 19:04:39,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2582 conditions, 462 events. 244/462 cut-off events. For 10468/10470 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1960 event pairs, 51 based on Foata normal form. 4/465 useless extension candidates. Maximal degree in co-relation 2534. Up to 297 conditions per place. [2024-06-20 19:04:39,845 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 65 selfloop transitions, 35 changer transitions 0/103 dead transitions. [2024-06-20 19:04:39,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 103 transitions, 1038 flow [2024-06-20 19:04:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:04:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:04:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-20 19:04:39,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229390681003584 [2024-06-20 19:04:39,846 INFO L175 Difference]: Start difference. First operand has 100 places, 86 transitions, 688 flow. Second operand 9 states and 118 transitions. [2024-06-20 19:04:39,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 103 transitions, 1038 flow [2024-06-20 19:04:39,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 103 transitions, 976 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-20 19:04:39,859 INFO L231 Difference]: Finished difference. Result has 105 places, 88 transitions, 735 flow [2024-06-20 19:04:39,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=735, PETRI_PLACES=105, PETRI_TRANSITIONS=88} [2024-06-20 19:04:39,863 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 75 predicate places. [2024-06-20 19:04:39,863 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 88 transitions, 735 flow [2024-06-20 19:04:39,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:39,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:39,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:39,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 19:04:39,865 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:04:39,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:39,865 INFO L85 PathProgramCache]: Analyzing trace with hash -415711595, now seen corresponding path program 4 times [2024-06-20 19:04:39,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:39,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514133080] [2024-06-20 19:04:39,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:39,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:45,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-20 19:04:45,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:45,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514133080] [2024-06-20 19:04:45,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514133080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:45,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:45,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:04:45,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903908467] [2024-06-20 19:04:45,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:45,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:04:45,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:45,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:04:45,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:04:45,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:04:45,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 88 transitions, 735 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:45,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:45,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:04:45,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:45,581 INFO L124 PetriNetUnfolderBase]: 240/456 cut-off events. [2024-06-20 19:04:45,581 INFO L125 PetriNetUnfolderBase]: For 10354/10354 co-relation queries the response was YES. [2024-06-20 19:04:45,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2562 conditions, 456 events. 240/456 cut-off events. For 10354/10354 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1935 event pairs, 55 based on Foata normal form. 2/457 useless extension candidates. Maximal degree in co-relation 2512. Up to 406 conditions per place. [2024-06-20 19:04:45,585 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 81 selfloop transitions, 14 changer transitions 0/98 dead transitions. [2024-06-20 19:04:45,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 98 transitions, 955 flow [2024-06-20 19:04:45,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:04:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:04:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-20 19:04:45,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-20 19:04:45,601 INFO L175 Difference]: Start difference. First operand has 105 places, 88 transitions, 735 flow. Second operand 9 states and 105 transitions. [2024-06-20 19:04:45,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 98 transitions, 955 flow [2024-06-20 19:04:45,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 98 transitions, 858 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-20 19:04:45,613 INFO L231 Difference]: Finished difference. Result has 108 places, 88 transitions, 671 flow [2024-06-20 19:04:45,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=671, PETRI_PLACES=108, PETRI_TRANSITIONS=88} [2024-06-20 19:04:45,615 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2024-06-20 19:04:45,616 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 88 transitions, 671 flow [2024-06-20 19:04:45,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:45,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:45,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:45,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 19:04:45,616 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:04:45,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:45,617 INFO L85 PathProgramCache]: Analyzing trace with hash -423994175, now seen corresponding path program 5 times [2024-06-20 19:04:45,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:45,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879656391] [2024-06-20 19:04:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:45,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:04:50,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:50,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879656391] [2024-06-20 19:04:50,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879656391] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:50,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:50,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:04:50,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77201658] [2024-06-20 19:04:50,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:50,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:04:50,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:50,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:04:50,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:04:50,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:04:50,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 88 transitions, 671 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:50,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:50,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:04:50,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:51,198 INFO L124 PetriNetUnfolderBase]: 236/452 cut-off events. [2024-06-20 19:04:51,198 INFO L125 PetriNetUnfolderBase]: For 9942/9944 co-relation queries the response was YES. [2024-06-20 19:04:51,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2406 conditions, 452 events. 236/452 cut-off events. For 9942/9944 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1912 event pairs, 49 based on Foata normal form. 4/455 useless extension candidates. Maximal degree in co-relation 2355. Up to 291 conditions per place. [2024-06-20 19:04:51,203 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 61 selfloop transitions, 37 changer transitions 0/101 dead transitions. [2024-06-20 19:04:51,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 101 transitions, 921 flow [2024-06-20 19:04:51,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:04:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:04:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-20 19:04:51,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157706093189964 [2024-06-20 19:04:51,205 INFO L175 Difference]: Start difference. First operand has 108 places, 88 transitions, 671 flow. Second operand 9 states and 116 transitions. [2024-06-20 19:04:51,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 101 transitions, 921 flow [2024-06-20 19:04:51,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 101 transitions, 866 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-20 19:04:51,215 INFO L231 Difference]: Finished difference. Result has 109 places, 88 transitions, 695 flow [2024-06-20 19:04:51,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=695, PETRI_PLACES=109, PETRI_TRANSITIONS=88} [2024-06-20 19:04:51,216 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 79 predicate places. [2024-06-20 19:04:51,216 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 88 transitions, 695 flow [2024-06-20 19:04:51,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:51,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:51,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:51,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 19:04:51,217 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:04:51,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:51,217 INFO L85 PathProgramCache]: Analyzing trace with hash -415412383, now seen corresponding path program 1 times [2024-06-20 19:04:51,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:51,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627540291] [2024-06-20 19:04:51,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:51,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:04:57,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:57,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627540291] [2024-06-20 19:04:57,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627540291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:57,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:57,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:04:57,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739110328] [2024-06-20 19:04:57,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:57,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:04:57,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:57,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:04:57,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:04:57,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:04:57,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 88 transitions, 695 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:57,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:57,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:04:57,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:58,115 INFO L124 PetriNetUnfolderBase]: 233/443 cut-off events. [2024-06-20 19:04:58,116 INFO L125 PetriNetUnfolderBase]: For 9761/9761 co-relation queries the response was YES. [2024-06-20 19:04:58,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2381 conditions, 443 events. 233/443 cut-off events. For 9761/9761 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1830 event pairs, 49 based on Foata normal form. 2/444 useless extension candidates. Maximal degree in co-relation 2329. Up to 392 conditions per place. [2024-06-20 19:04:58,128 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 81 selfloop transitions, 15 changer transitions 0/99 dead transitions. [2024-06-20 19:04:58,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 99 transitions, 913 flow [2024-06-20 19:04:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:04:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:04:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-20 19:04:58,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2024-06-20 19:04:58,129 INFO L175 Difference]: Start difference. First operand has 109 places, 88 transitions, 695 flow. Second operand 10 states and 113 transitions. [2024-06-20 19:04:58,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 99 transitions, 913 flow [2024-06-20 19:04:58,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 99 transitions, 808 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-20 19:04:58,140 INFO L231 Difference]: Finished difference. Result has 110 places, 88 transitions, 624 flow [2024-06-20 19:04:58,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=624, PETRI_PLACES=110, PETRI_TRANSITIONS=88} [2024-06-20 19:04:58,141 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places. [2024-06-20 19:04:58,141 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 624 flow [2024-06-20 19:04:58,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:58,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:58,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:58,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 19:04:58,142 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:04:58,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:58,142 INFO L85 PathProgramCache]: Analyzing trace with hash -985223485, now seen corresponding path program 1 times [2024-06-20 19:04:58,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:58,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813456402] [2024-06-20 19:04:58,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:58,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:05:03,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:03,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813456402] [2024-06-20 19:05:03,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813456402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:03,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:03,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:03,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145280512] [2024-06-20 19:05:03,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:03,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:03,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:03,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:03,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:03,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:05:03,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 624 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:03,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:03,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:05:03,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:03,634 INFO L124 PetriNetUnfolderBase]: 237/452 cut-off events. [2024-06-20 19:05:03,634 INFO L125 PetriNetUnfolderBase]: For 10125/10125 co-relation queries the response was YES. [2024-06-20 19:05:03,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 452 events. 237/452 cut-off events. For 10125/10125 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1896 event pairs, 26 based on Foata normal form. 2/453 useless extension candidates. Maximal degree in co-relation 2308. Up to 359 conditions per place. [2024-06-20 19:05:03,638 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 88 selfloop transitions, 15 changer transitions 0/106 dead transitions. [2024-06-20 19:05:03,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 106 transitions, 884 flow [2024-06-20 19:05:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-20 19:05:03,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-20 19:05:03,641 INFO L175 Difference]: Start difference. First operand has 110 places, 88 transitions, 624 flow. Second operand 9 states and 109 transitions. [2024-06-20 19:05:03,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 106 transitions, 884 flow [2024-06-20 19:05:03,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 106 transitions, 846 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-20 19:05:03,654 INFO L231 Difference]: Finished difference. Result has 111 places, 89 transitions, 632 flow [2024-06-20 19:05:03,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=632, PETRI_PLACES=111, PETRI_TRANSITIONS=89} [2024-06-20 19:05:03,655 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2024-06-20 19:05:03,655 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 89 transitions, 632 flow [2024-06-20 19:05:03,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:03,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:03,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:03,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 19:05:03,656 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:05:03,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1480342477, now seen corresponding path program 2 times [2024-06-20 19:05:03,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:03,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586695817] [2024-06-20 19:05:03,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:03,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:09,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-20 19:05:09,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:09,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586695817] [2024-06-20 19:05:09,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586695817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:09,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:09,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:09,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693111042] [2024-06-20 19:05:09,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:09,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:09,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:09,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:09,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:09,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:05:09,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 89 transitions, 632 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:09,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:09,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:05:09,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:09,769 INFO L124 PetriNetUnfolderBase]: 248/473 cut-off events. [2024-06-20 19:05:09,770 INFO L125 PetriNetUnfolderBase]: For 11793/11793 co-relation queries the response was YES. [2024-06-20 19:05:09,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2539 conditions, 473 events. 248/473 cut-off events. For 11793/11793 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2043 event pairs, 44 based on Foata normal form. 2/474 useless extension candidates. Maximal degree in co-relation 2485. Up to 378 conditions per place. [2024-06-20 19:05:09,773 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 84 selfloop transitions, 21 changer transitions 0/108 dead transitions. [2024-06-20 19:05:09,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 108 transitions, 972 flow [2024-06-20 19:05:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-20 19:05:09,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050179211469534 [2024-06-20 19:05:09,774 INFO L175 Difference]: Start difference. First operand has 111 places, 89 transitions, 632 flow. Second operand 9 states and 113 transitions. [2024-06-20 19:05:09,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 108 transitions, 972 flow [2024-06-20 19:05:09,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 108 transitions, 936 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-20 19:05:09,788 INFO L231 Difference]: Finished difference. Result has 113 places, 91 transitions, 668 flow [2024-06-20 19:05:09,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=668, PETRI_PLACES=113, PETRI_TRANSITIONS=91} [2024-06-20 19:05:09,789 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places. [2024-06-20 19:05:09,789 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 91 transitions, 668 flow [2024-06-20 19:05:09,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:09,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:09,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:09,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 19:05:09,790 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:05:09,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:09,790 INFO L85 PathProgramCache]: Analyzing trace with hash -896509855, now seen corresponding path program 3 times [2024-06-20 19:05:09,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:09,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901300138] [2024-06-20 19:05:09,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:09,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:05:14,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:14,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901300138] [2024-06-20 19:05:14,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901300138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:14,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:14,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:14,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466588392] [2024-06-20 19:05:14,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:14,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:14,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:14,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:15,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:05:15,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 91 transitions, 668 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:15,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:15,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:05:15,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:15,312 INFO L124 PetriNetUnfolderBase]: 245/468 cut-off events. [2024-06-20 19:05:15,313 INFO L125 PetriNetUnfolderBase]: For 11711/11711 co-relation queries the response was YES. [2024-06-20 19:05:15,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 468 events. 245/468 cut-off events. For 11711/11711 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2016 event pairs, 45 based on Foata normal form. 2/469 useless extension candidates. Maximal degree in co-relation 2432. Up to 392 conditions per place. [2024-06-20 19:05:15,315 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 82 selfloop transitions, 21 changer transitions 0/106 dead transitions. [2024-06-20 19:05:15,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 106 transitions, 914 flow [2024-06-20 19:05:15,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-20 19:05:15,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-20 19:05:15,317 INFO L175 Difference]: Start difference. First operand has 113 places, 91 transitions, 668 flow. Second operand 9 states and 110 transitions. [2024-06-20 19:05:15,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 106 transitions, 914 flow [2024-06-20 19:05:15,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 106 transitions, 870 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-20 19:05:15,331 INFO L231 Difference]: Finished difference. Result has 117 places, 91 transitions, 671 flow [2024-06-20 19:05:15,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=671, PETRI_PLACES=117, PETRI_TRANSITIONS=91} [2024-06-20 19:05:15,332 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 87 predicate places. [2024-06-20 19:05:15,332 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 91 transitions, 671 flow [2024-06-20 19:05:15,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:15,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:15,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:15,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 19:05:15,333 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:05:15,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash -896503903, now seen corresponding path program 1 times [2024-06-20 19:05:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:15,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415289242] [2024-06-20 19:05:15,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:05:20,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:20,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415289242] [2024-06-20 19:05:20,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415289242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:20,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:20,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:05:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252263784] [2024-06-20 19:05:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:20,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:05:20,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:20,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:05:20,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:05:20,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:05:20,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 91 transitions, 671 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:20,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:20,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:05:20,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:20,706 INFO L124 PetriNetUnfolderBase]: 243/465 cut-off events. [2024-06-20 19:05:20,706 INFO L125 PetriNetUnfolderBase]: For 11182/11182 co-relation queries the response was YES. [2024-06-20 19:05:20,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2452 conditions, 465 events. 243/465 cut-off events. For 11182/11182 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1994 event pairs, 44 based on Foata normal form. 1/465 useless extension candidates. Maximal degree in co-relation 2395. Up to 389 conditions per place. [2024-06-20 19:05:20,709 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 81 selfloop transitions, 24 changer transitions 0/108 dead transitions. [2024-06-20 19:05:20,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 108 transitions, 955 flow [2024-06-20 19:05:20,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:05:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:05:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-20 19:05:20,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 19:05:20,710 INFO L175 Difference]: Start difference. First operand has 117 places, 91 transitions, 671 flow. Second operand 10 states and 120 transitions. [2024-06-20 19:05:20,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 108 transitions, 955 flow [2024-06-20 19:05:20,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 108 transitions, 910 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-20 19:05:20,727 INFO L231 Difference]: Finished difference. Result has 119 places, 93 transitions, 717 flow [2024-06-20 19:05:20,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=717, PETRI_PLACES=119, PETRI_TRANSITIONS=93} [2024-06-20 19:05:20,728 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2024-06-20 19:05:20,728 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 93 transitions, 717 flow [2024-06-20 19:05:20,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:20,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:20,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:20,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 19:05:20,728 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:05:20,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:20,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1612088501, now seen corresponding path program 4 times [2024-06-20 19:05:20,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:20,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633110409] [2024-06-20 19:05:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:20,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:25,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:05:25,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:25,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633110409] [2024-06-20 19:05:25,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633110409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:25,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:25,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911378167] [2024-06-20 19:05:25,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:25,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:25,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:25,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:25,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:05:25,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 93 transitions, 717 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:25,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:25,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:05:25,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:26,238 INFO L124 PetriNetUnfolderBase]: 250/478 cut-off events. [2024-06-20 19:05:26,238 INFO L125 PetriNetUnfolderBase]: For 12426/12426 co-relation queries the response was YES. [2024-06-20 19:05:26,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2554 conditions, 478 events. 250/478 cut-off events. For 12426/12426 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2081 event pairs, 42 based on Foata normal form. 2/479 useless extension candidates. Maximal degree in co-relation 2496. Up to 413 conditions per place. [2024-06-20 19:05:26,241 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 89 selfloop transitions, 17 changer transitions 0/109 dead transitions. [2024-06-20 19:05:26,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 109 transitions, 995 flow [2024-06-20 19:05:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-20 19:05:26,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-20 19:05:26,243 INFO L175 Difference]: Start difference. First operand has 119 places, 93 transitions, 717 flow. Second operand 9 states and 109 transitions. [2024-06-20 19:05:26,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 109 transitions, 995 flow [2024-06-20 19:05:26,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 109 transitions, 920 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-20 19:05:26,260 INFO L231 Difference]: Finished difference. Result has 121 places, 97 transitions, 725 flow [2024-06-20 19:05:26,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=725, PETRI_PLACES=121, PETRI_TRANSITIONS=97} [2024-06-20 19:05:26,261 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 91 predicate places. [2024-06-20 19:05:26,261 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 97 transitions, 725 flow [2024-06-20 19:05:26,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:26,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:26,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:26,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 19:05:26,262 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:05:26,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:26,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1617595031, now seen corresponding path program 5 times [2024-06-20 19:05:26,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:26,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193828699] [2024-06-20 19:05:26,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:26,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:31,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-20 19:05:31,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193828699] [2024-06-20 19:05:31,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193828699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:31,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:31,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119723391] [2024-06-20 19:05:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:31,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:31,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:31,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:31,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:31,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:05:31,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 97 transitions, 725 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:31,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:31,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:05:31,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:31,493 INFO L124 PetriNetUnfolderBase]: 254/486 cut-off events. [2024-06-20 19:05:31,494 INFO L125 PetriNetUnfolderBase]: For 13263/13263 co-relation queries the response was YES. [2024-06-20 19:05:31,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 486 events. 254/486 cut-off events. For 13263/13263 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2119 event pairs, 44 based on Foata normal form. 2/487 useless extension candidates. Maximal degree in co-relation 2565. Up to 421 conditions per place. [2024-06-20 19:05:31,497 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 90 selfloop transitions, 18 changer transitions 0/111 dead transitions. [2024-06-20 19:05:31,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 111 transitions, 997 flow [2024-06-20 19:05:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-20 19:05:31,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-20 19:05:31,498 INFO L175 Difference]: Start difference. First operand has 121 places, 97 transitions, 725 flow. Second operand 9 states and 109 transitions. [2024-06-20 19:05:31,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 111 transitions, 997 flow [2024-06-20 19:05:31,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 111 transitions, 947 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-20 19:05:31,518 INFO L231 Difference]: Finished difference. Result has 124 places, 99 transitions, 743 flow [2024-06-20 19:05:31,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=743, PETRI_PLACES=124, PETRI_TRANSITIONS=99} [2024-06-20 19:05:31,518 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 94 predicate places. [2024-06-20 19:05:31,518 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 99 transitions, 743 flow [2024-06-20 19:05:31,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:31,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:31,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:31,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 19:05:31,519 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:05:31,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:31,519 INFO L85 PathProgramCache]: Analyzing trace with hash 11103911, now seen corresponding path program 6 times [2024-06-20 19:05:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:31,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477420738] [2024-06-20 19:05:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:36,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-20 19:05:36,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:36,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477420738] [2024-06-20 19:05:36,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477420738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:36,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:36,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:36,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39506100] [2024-06-20 19:05:36,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:36,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:36,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:36,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:36,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:36,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:05:36,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 99 transitions, 743 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:36,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:36,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:05:36,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:37,085 INFO L124 PetriNetUnfolderBase]: 258/491 cut-off events. [2024-06-20 19:05:37,085 INFO L125 PetriNetUnfolderBase]: For 14051/14051 co-relation queries the response was YES. [2024-06-20 19:05:37,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2673 conditions, 491 events. 258/491 cut-off events. For 14051/14051 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2134 event pairs, 42 based on Foata normal form. 2/492 useless extension candidates. Maximal degree in co-relation 2612. Up to 383 conditions per place. [2024-06-20 19:05:37,088 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 83 selfloop transitions, 28 changer transitions 0/114 dead transitions. [2024-06-20 19:05:37,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 114 transitions, 1019 flow [2024-06-20 19:05:37,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:37,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-20 19:05:37,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4014336917562724 [2024-06-20 19:05:37,090 INFO L175 Difference]: Start difference. First operand has 124 places, 99 transitions, 743 flow. Second operand 9 states and 112 transitions. [2024-06-20 19:05:37,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 114 transitions, 1019 flow [2024-06-20 19:05:37,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 114 transitions, 979 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-20 19:05:37,111 INFO L231 Difference]: Finished difference. Result has 128 places, 100 transitions, 783 flow [2024-06-20 19:05:37,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=783, PETRI_PLACES=128, PETRI_TRANSITIONS=100} [2024-06-20 19:05:37,112 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 98 predicate places. [2024-06-20 19:05:37,112 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 100 transitions, 783 flow [2024-06-20 19:05:37,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:37,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:37,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:37,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 19:05:37,112 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:05:37,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:37,113 INFO L85 PathProgramCache]: Analyzing trace with hash -911838058, now seen corresponding path program 1 times [2024-06-20 19:05:37,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:37,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022121813] [2024-06-20 19:05:37,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:37,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:05:42,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:42,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022121813] [2024-06-20 19:05:42,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022121813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:42,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:42,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:05:42,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131942551] [2024-06-20 19:05:42,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:42,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:05:42,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:42,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:05:42,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:05:42,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:05:42,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 100 transitions, 783 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:42,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:42,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:05:42,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:43,008 INFO L124 PetriNetUnfolderBase]: 264/502 cut-off events. [2024-06-20 19:05:43,009 INFO L125 PetriNetUnfolderBase]: For 14926/14926 co-relation queries the response was YES. [2024-06-20 19:05:43,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2767 conditions, 502 events. 264/502 cut-off events. For 14926/14926 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2190 event pairs, 41 based on Foata normal form. 2/503 useless extension candidates. Maximal degree in co-relation 2705. Up to 421 conditions per place. [2024-06-20 19:05:43,012 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 91 selfloop transitions, 23 changer transitions 0/117 dead transitions. [2024-06-20 19:05:43,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 117 transitions, 1103 flow [2024-06-20 19:05:43,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:05:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:05:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-20 19:05:43,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-20 19:05:43,014 INFO L175 Difference]: Start difference. First operand has 128 places, 100 transitions, 783 flow. Second operand 10 states and 122 transitions. [2024-06-20 19:05:43,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 117 transitions, 1103 flow [2024-06-20 19:05:43,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 117 transitions, 1033 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-20 19:05:43,037 INFO L231 Difference]: Finished difference. Result has 131 places, 103 transitions, 813 flow [2024-06-20 19:05:43,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=813, PETRI_PLACES=131, PETRI_TRANSITIONS=103} [2024-06-20 19:05:43,037 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 101 predicate places. [2024-06-20 19:05:43,038 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 103 transitions, 813 flow [2024-06-20 19:05:43,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:43,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:43,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:43,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 19:05:43,038 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:05:43,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:43,039 INFO L85 PathProgramCache]: Analyzing trace with hash -456767271, now seen corresponding path program 7 times [2024-06-20 19:05:43,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:43,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322602038] [2024-06-20 19:05:43,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:43,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:05:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:47,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322602038] [2024-06-20 19:05:47,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322602038] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:47,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:47,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:47,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438465762] [2024-06-20 19:05:47,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:47,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:47,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:47,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:47,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:47,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:05:47,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 103 transitions, 813 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:47,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:47,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:05:47,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:48,239 INFO L124 PetriNetUnfolderBase]: 268/509 cut-off events. [2024-06-20 19:05:48,240 INFO L125 PetriNetUnfolderBase]: For 15760/15760 co-relation queries the response was YES. [2024-06-20 19:05:48,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2857 conditions, 509 events. 268/509 cut-off events. For 15760/15760 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2252 event pairs, 46 based on Foata normal form. 2/509 useless extension candidates. Maximal degree in co-relation 2794. Up to 395 conditions per place. [2024-06-20 19:05:48,243 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 76 selfloop transitions, 38 changer transitions 0/117 dead transitions. [2024-06-20 19:05:48,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 117 transitions, 1116 flow [2024-06-20 19:05:48,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-20 19:05:48,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-20 19:05:48,245 INFO L175 Difference]: Start difference. First operand has 131 places, 103 transitions, 813 flow. Second operand 9 states and 110 transitions. [2024-06-20 19:05:48,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 117 transitions, 1116 flow [2024-06-20 19:05:48,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 117 transitions, 1038 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-20 19:05:48,269 INFO L231 Difference]: Finished difference. Result has 133 places, 106 transitions, 861 flow [2024-06-20 19:05:48,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=861, PETRI_PLACES=133, PETRI_TRANSITIONS=106} [2024-06-20 19:05:48,270 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places. [2024-06-20 19:05:48,270 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 106 transitions, 861 flow [2024-06-20 19:05:48,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:48,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:48,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:48,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 19:05:48,271 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:05:48,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:48,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1260504439, now seen corresponding path program 8 times [2024-06-20 19:05:48,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:48,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679246883] [2024-06-20 19:05:48,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:48,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:05:53,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679246883] [2024-06-20 19:05:53,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679246883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:53,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:53,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:53,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997484765] [2024-06-20 19:05:53,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:53,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:53,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:53,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:53,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:53,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:05:53,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 106 transitions, 861 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:53,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:53,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:05:53,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:53,943 INFO L124 PetriNetUnfolderBase]: 275/526 cut-off events. [2024-06-20 19:05:53,943 INFO L125 PetriNetUnfolderBase]: For 16804/16804 co-relation queries the response was YES. [2024-06-20 19:05:53,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2999 conditions, 526 events. 275/526 cut-off events. For 16804/16804 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2370 event pairs, 50 based on Foata normal form. 2/526 useless extension candidates. Maximal degree in co-relation 2934. Up to 407 conditions per place. [2024-06-20 19:05:53,947 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 80 selfloop transitions, 38 changer transitions 0/121 dead transitions. [2024-06-20 19:05:53,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 121 transitions, 1184 flow [2024-06-20 19:05:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-20 19:05:53,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-20 19:05:53,949 INFO L175 Difference]: Start difference. First operand has 133 places, 106 transitions, 861 flow. Second operand 9 states and 111 transitions. [2024-06-20 19:05:53,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 121 transitions, 1184 flow [2024-06-20 19:05:53,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 121 transitions, 1078 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-20 19:05:53,976 INFO L231 Difference]: Finished difference. Result has 137 places, 111 transitions, 909 flow [2024-06-20 19:05:53,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=909, PETRI_PLACES=137, PETRI_TRANSITIONS=111} [2024-06-20 19:05:53,977 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places. [2024-06-20 19:05:53,977 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 111 transitions, 909 flow [2024-06-20 19:05:53,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:53,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:53,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:53,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 19:05:53,979 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:05:53,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:53,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1260356569, now seen corresponding path program 9 times [2024-06-20 19:05:53,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:53,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174109039] [2024-06-20 19:05:53,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:53,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:05:59,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:59,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174109039] [2024-06-20 19:05:59,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174109039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:59,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:59,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:59,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516891654] [2024-06-20 19:05:59,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:59,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:59,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:59,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:59,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:59,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:05:59,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 111 transitions, 909 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:59,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:59,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:05:59,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:59,920 INFO L124 PetriNetUnfolderBase]: 279/532 cut-off events. [2024-06-20 19:05:59,921 INFO L125 PetriNetUnfolderBase]: For 17869/17869 co-relation queries the response was YES. [2024-06-20 19:05:59,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3076 conditions, 532 events. 279/532 cut-off events. For 17869/17869 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2409 event pairs, 46 based on Foata normal form. 2/532 useless extension candidates. Maximal degree in co-relation 3009. Up to 386 conditions per place. [2024-06-20 19:05:59,924 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 80 selfloop transitions, 41 changer transitions 0/124 dead transitions. [2024-06-20 19:05:59,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 124 transitions, 1283 flow [2024-06-20 19:05:59,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-20 19:05:59,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050179211469534 [2024-06-20 19:05:59,925 INFO L175 Difference]: Start difference. First operand has 137 places, 111 transitions, 909 flow. Second operand 9 states and 113 transitions. [2024-06-20 19:05:59,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 124 transitions, 1283 flow [2024-06-20 19:05:59,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 124 transitions, 1196 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-20 19:05:59,963 INFO L231 Difference]: Finished difference. Result has 142 places, 112 transitions, 932 flow [2024-06-20 19:05:59,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=932, PETRI_PLACES=142, PETRI_TRANSITIONS=112} [2024-06-20 19:05:59,964 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 112 predicate places. [2024-06-20 19:05:59,964 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 112 transitions, 932 flow [2024-06-20 19:05:59,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:59,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:59,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:59,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 19:05:59,965 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:05:59,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:59,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1265866819, now seen corresponding path program 10 times [2024-06-20 19:05:59,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:59,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886555534] [2024-06-20 19:05:59,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:59,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:06:05,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:05,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886555534] [2024-06-20 19:06:05,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886555534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:05,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:05,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:05,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061136959] [2024-06-20 19:06:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:05,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:05,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:05,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:05,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:05,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:06:05,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 112 transitions, 932 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:05,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:05,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:06:05,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:06,030 INFO L124 PetriNetUnfolderBase]: 276/529 cut-off events. [2024-06-20 19:06:06,030 INFO L125 PetriNetUnfolderBase]: For 16532/16534 co-relation queries the response was YES. [2024-06-20 19:06:06,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2913 conditions, 529 events. 276/529 cut-off events. For 16532/16534 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2396 event pairs, 41 based on Foata normal form. 4/532 useless extension candidates. Maximal degree in co-relation 2845. Up to 436 conditions per place. [2024-06-20 19:06:06,057 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 90 selfloop transitions, 29 changer transitions 0/122 dead transitions. [2024-06-20 19:06:06,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 122 transitions, 1194 flow [2024-06-20 19:06:06,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:06:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:06:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-20 19:06:06,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-20 19:06:06,059 INFO L175 Difference]: Start difference. First operand has 142 places, 112 transitions, 932 flow. Second operand 9 states and 111 transitions. [2024-06-20 19:06:06,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 122 transitions, 1194 flow [2024-06-20 19:06:06,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 122 transitions, 1072 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-20 19:06:06,128 INFO L231 Difference]: Finished difference. Result has 144 places, 112 transitions, 872 flow [2024-06-20 19:06:06,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=872, PETRI_PLACES=144, PETRI_TRANSITIONS=112} [2024-06-20 19:06:06,129 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 114 predicate places. [2024-06-20 19:06:06,129 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 112 transitions, 872 flow [2024-06-20 19:06:06,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:06,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:06,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:06,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 19:06:06,130 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:06:06,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:06,130 INFO L85 PathProgramCache]: Analyzing trace with hash 6780638, now seen corresponding path program 2 times [2024-06-20 19:06:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:06,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250685754] [2024-06-20 19:06:06,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:06,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:06:12,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:12,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250685754] [2024-06-20 19:06:12,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250685754] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:12,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:12,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:06:12,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173250087] [2024-06-20 19:06:12,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:12,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:06:12,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:12,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:06:12,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:06:12,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:06:12,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 112 transitions, 872 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:12,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:12,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:06:12,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:12,593 INFO L124 PetriNetUnfolderBase]: 279/534 cut-off events. [2024-06-20 19:06:12,593 INFO L125 PetriNetUnfolderBase]: For 15883/15883 co-relation queries the response was YES. [2024-06-20 19:06:12,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2831 conditions, 534 events. 279/534 cut-off events. For 15883/15883 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2420 event pairs, 44 based on Foata normal form. 1/534 useless extension candidates. Maximal degree in co-relation 2763. Up to 484 conditions per place. [2024-06-20 19:06:12,597 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 107 selfloop transitions, 16 changer transitions 0/126 dead transitions. [2024-06-20 19:06:12,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 126 transitions, 1177 flow [2024-06-20 19:06:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:06:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:06:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-20 19:06:12,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2024-06-20 19:06:12,599 INFO L175 Difference]: Start difference. First operand has 144 places, 112 transitions, 872 flow. Second operand 10 states and 114 transitions. [2024-06-20 19:06:12,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 126 transitions, 1177 flow [2024-06-20 19:06:12,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 126 transitions, 1039 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-06-20 19:06:12,628 INFO L231 Difference]: Finished difference. Result has 143 places, 116 transitions, 815 flow [2024-06-20 19:06:12,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=815, PETRI_PLACES=143, PETRI_TRANSITIONS=116} [2024-06-20 19:06:12,629 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 113 predicate places. [2024-06-20 19:06:12,629 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 116 transitions, 815 flow [2024-06-20 19:06:12,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:12,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:12,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:12,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 19:06:12,629 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:06:12,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:12,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1266082300, now seen corresponding path program 3 times [2024-06-20 19:06:12,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:12,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687668538] [2024-06-20 19:06:12,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:12,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:06:18,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:18,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687668538] [2024-06-20 19:06:18,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687668538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:18,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:06:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018669823] [2024-06-20 19:06:18,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:18,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:06:18,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:18,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:06:18,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:06:18,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:06:18,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 116 transitions, 815 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:18,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:18,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:06:18,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:19,162 INFO L124 PetriNetUnfolderBase]: 285/546 cut-off events. [2024-06-20 19:06:19,163 INFO L125 PetriNetUnfolderBase]: For 17483/17485 co-relation queries the response was YES. [2024-06-20 19:06:19,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 546 events. 285/546 cut-off events. For 17483/17485 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2497 event pairs, 41 based on Foata normal form. 4/549 useless extension candidates. Maximal degree in co-relation 2760. Up to 373 conditions per place. [2024-06-20 19:06:19,181 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 87 selfloop transitions, 43 changer transitions 0/133 dead transitions. [2024-06-20 19:06:19,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 133 transitions, 1205 flow [2024-06-20 19:06:19,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:06:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:06:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-20 19:06:19,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4129032258064516 [2024-06-20 19:06:19,182 INFO L175 Difference]: Start difference. First operand has 143 places, 116 transitions, 815 flow. Second operand 10 states and 128 transitions. [2024-06-20 19:06:19,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 133 transitions, 1205 flow [2024-06-20 19:06:19,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 133 transitions, 1164 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-20 19:06:19,211 INFO L231 Difference]: Finished difference. Result has 147 places, 119 transitions, 922 flow [2024-06-20 19:06:19,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=922, PETRI_PLACES=147, PETRI_TRANSITIONS=119} [2024-06-20 19:06:19,212 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2024-06-20 19:06:19,212 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 119 transitions, 922 flow [2024-06-20 19:06:19,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:19,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:19,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:19,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 19:06:19,213 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:06:19,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash -456551790, now seen corresponding path program 4 times [2024-06-20 19:06:19,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992754457] [2024-06-20 19:06:19,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:06:25,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:25,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992754457] [2024-06-20 19:06:25,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992754457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:25,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:25,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:06:25,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709883650] [2024-06-20 19:06:25,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:25,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:06:25,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:25,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:06:25,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:06:25,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:06:25,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 119 transitions, 922 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:25,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:25,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:06:25,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:25,709 INFO L124 PetriNetUnfolderBase]: 291/556 cut-off events. [2024-06-20 19:06:25,710 INFO L125 PetriNetUnfolderBase]: For 18672/18672 co-relation queries the response was YES. [2024-06-20 19:06:25,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3043 conditions, 556 events. 291/556 cut-off events. For 18672/18672 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2556 event pairs, 49 based on Foata normal form. 2/556 useless extension candidates. Maximal degree in co-relation 2974. Up to 349 conditions per place. [2024-06-20 19:06:25,714 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 78 selfloop transitions, 55 changer transitions 0/136 dead transitions. [2024-06-20 19:06:25,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 136 transitions, 1332 flow [2024-06-20 19:06:25,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:06:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:06:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-20 19:06:25,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4129032258064516 [2024-06-20 19:06:25,742 INFO L175 Difference]: Start difference. First operand has 147 places, 119 transitions, 922 flow. Second operand 10 states and 128 transitions. [2024-06-20 19:06:25,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 136 transitions, 1332 flow [2024-06-20 19:06:25,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 136 transitions, 1206 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-20 19:06:25,774 INFO L231 Difference]: Finished difference. Result has 149 places, 122 transitions, 974 flow [2024-06-20 19:06:25,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=974, PETRI_PLACES=149, PETRI_TRANSITIONS=122} [2024-06-20 19:06:25,774 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 119 predicate places. [2024-06-20 19:06:25,775 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 122 transitions, 974 flow [2024-06-20 19:06:25,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:25,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:25,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:25,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 19:06:25,775 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:06:25,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash 7107068, now seen corresponding path program 5 times [2024-06-20 19:06:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:25,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190427421] [2024-06-20 19:06:25,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:31,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-20 19:06:31,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:31,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190427421] [2024-06-20 19:06:31,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190427421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:31,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:31,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:06:31,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902733853] [2024-06-20 19:06:31,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:31,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:06:31,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:31,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:06:31,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:06:32,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:06:32,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 122 transitions, 974 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:32,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:32,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:06:32,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:32,342 INFO L124 PetriNetUnfolderBase]: 294/559 cut-off events. [2024-06-20 19:06:32,342 INFO L125 PetriNetUnfolderBase]: For 18476/18476 co-relation queries the response was YES. [2024-06-20 19:06:32,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 559 events. 294/559 cut-off events. For 18476/18476 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2557 event pairs, 44 based on Foata normal form. 1/559 useless extension candidates. Maximal degree in co-relation 3056. Up to 503 conditions per place. [2024-06-20 19:06:32,346 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 112 selfloop transitions, 20 changer transitions 0/135 dead transitions. [2024-06-20 19:06:32,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 135 transitions, 1294 flow [2024-06-20 19:06:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:06:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:06:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-20 19:06:32,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36656891495601174 [2024-06-20 19:06:32,369 INFO L175 Difference]: Start difference. First operand has 149 places, 122 transitions, 974 flow. Second operand 11 states and 125 transitions. [2024-06-20 19:06:32,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 135 transitions, 1294 flow [2024-06-20 19:06:32,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 135 transitions, 1138 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-20 19:06:32,404 INFO L231 Difference]: Finished difference. Result has 152 places, 124 transitions, 897 flow [2024-06-20 19:06:32,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=897, PETRI_PLACES=152, PETRI_TRANSITIONS=124} [2024-06-20 19:06:32,405 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 122 predicate places. [2024-06-20 19:06:32,405 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 124 transitions, 897 flow [2024-06-20 19:06:32,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:32,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:32,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:32,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 19:06:32,406 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:06:32,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:32,406 INFO L85 PathProgramCache]: Analyzing trace with hash -251766802, now seen corresponding path program 6 times [2024-06-20 19:06:32,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:32,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244415495] [2024-06-20 19:06:32,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:32,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:06:38,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:38,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244415495] [2024-06-20 19:06:38,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244415495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:38,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:38,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:06:38,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550682211] [2024-06-20 19:06:38,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:38,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:06:38,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:38,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:06:38,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:06:38,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:06:38,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 124 transitions, 897 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:38,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:38,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:06:38,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:39,105 INFO L124 PetriNetUnfolderBase]: 295/563 cut-off events. [2024-06-20 19:06:39,106 INFO L125 PetriNetUnfolderBase]: For 19192/19194 co-relation queries the response was YES. [2024-06-20 19:06:39,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3034 conditions, 563 events. 295/563 cut-off events. For 19192/19194 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2577 event pairs, 41 based on Foata normal form. 4/566 useless extension candidates. Maximal degree in co-relation 2963. Up to 390 conditions per place. [2024-06-20 19:06:39,110 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 87 selfloop transitions, 50 changer transitions 0/140 dead transitions. [2024-06-20 19:06:39,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 140 transitions, 1321 flow [2024-06-20 19:06:39,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:06:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:06:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-20 19:06:39,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-20 19:06:39,111 INFO L175 Difference]: Start difference. First operand has 152 places, 124 transitions, 897 flow. Second operand 10 states and 126 transitions. [2024-06-20 19:06:39,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 140 transitions, 1321 flow [2024-06-20 19:06:39,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 140 transitions, 1258 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-20 19:06:39,146 INFO L231 Difference]: Finished difference. Result has 153 places, 127 transitions, 1012 flow [2024-06-20 19:06:39,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1012, PETRI_PLACES=153, PETRI_TRANSITIONS=127} [2024-06-20 19:06:39,147 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 123 predicate places. [2024-06-20 19:06:39,147 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 127 transitions, 1012 flow [2024-06-20 19:06:39,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:39,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:39,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:39,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 19:06:39,148 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:06:39,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:39,148 INFO L85 PathProgramCache]: Analyzing trace with hash 462014674, now seen corresponding path program 1 times [2024-06-20 19:06:39,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:39,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603391906] [2024-06-20 19:06:39,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:39,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:06:44,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:44,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603391906] [2024-06-20 19:06:44,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603391906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:44,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:44,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:06:44,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938490598] [2024-06-20 19:06:44,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:44,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:06:44,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:44,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:06:44,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:06:44,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:06:44,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 127 transitions, 1012 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:44,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:44,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:06:44,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:44,985 INFO L124 PetriNetUnfolderBase]: 299/570 cut-off events. [2024-06-20 19:06:44,985 INFO L125 PetriNetUnfolderBase]: For 20155/20155 co-relation queries the response was YES. [2024-06-20 19:06:44,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3174 conditions, 570 events. 299/570 cut-off events. For 20155/20155 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2624 event pairs, 22 based on Foata normal form. 2/571 useless extension candidates. Maximal degree in co-relation 3102. Up to 467 conditions per place. [2024-06-20 19:06:44,989 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 128 selfloop transitions, 16 changer transitions 0/147 dead transitions. [2024-06-20 19:06:44,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 147 transitions, 1356 flow [2024-06-20 19:06:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:06:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:06:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-20 19:06:44,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-20 19:06:44,990 INFO L175 Difference]: Start difference. First operand has 153 places, 127 transitions, 1012 flow. Second operand 10 states and 119 transitions. [2024-06-20 19:06:44,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 147 transitions, 1356 flow [2024-06-20 19:06:45,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 147 transitions, 1200 flow, removed 30 selfloop flow, removed 8 redundant places. [2024-06-20 19:06:45,025 INFO L231 Difference]: Finished difference. Result has 155 places, 128 transitions, 902 flow [2024-06-20 19:06:45,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=902, PETRI_PLACES=155, PETRI_TRANSITIONS=128} [2024-06-20 19:06:45,026 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places. [2024-06-20 19:06:45,026 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 128 transitions, 902 flow [2024-06-20 19:06:45,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:45,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:45,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:45,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 19:06:45,027 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:06:45,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:45,027 INFO L85 PathProgramCache]: Analyzing trace with hash -2026584866, now seen corresponding path program 2 times [2024-06-20 19:06:45,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:45,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634330741] [2024-06-20 19:06:45,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:45,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:06:50,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:50,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634330741] [2024-06-20 19:06:50,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634330741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:50,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:50,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:06:50,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663410172] [2024-06-20 19:06:50,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:50,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:06:50,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:50,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:06:50,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:06:50,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:06:50,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 128 transitions, 902 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:50,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:50,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:06:50,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:50,596 INFO L124 PetriNetUnfolderBase]: 310/591 cut-off events. [2024-06-20 19:06:50,596 INFO L125 PetriNetUnfolderBase]: For 22752/22752 co-relation queries the response was YES. [2024-06-20 19:06:50,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3245 conditions, 591 events. 310/591 cut-off events. For 22752/22752 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2748 event pairs, 41 based on Foata normal form. 2/592 useless extension candidates. Maximal degree in co-relation 3172. Up to 471 conditions per place. [2024-06-20 19:06:50,601 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 124 selfloop transitions, 22 changer transitions 0/149 dead transitions. [2024-06-20 19:06:50,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 149 transitions, 1358 flow [2024-06-20 19:06:50,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:06:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:06:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-20 19:06:50,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-20 19:06:50,602 INFO L175 Difference]: Start difference. First operand has 155 places, 128 transitions, 902 flow. Second operand 10 states and 125 transitions. [2024-06-20 19:06:50,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 149 transitions, 1358 flow [2024-06-20 19:06:50,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 149 transitions, 1322 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-20 19:06:50,644 INFO L231 Difference]: Finished difference. Result has 157 places, 130 transitions, 936 flow [2024-06-20 19:06:50,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=936, PETRI_PLACES=157, PETRI_TRANSITIONS=130} [2024-06-20 19:06:50,644 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places. [2024-06-20 19:06:50,645 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 130 transitions, 936 flow [2024-06-20 19:06:50,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:50,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:50,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:50,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 19:06:50,645 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:06:50,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:50,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2022000896, now seen corresponding path program 3 times [2024-06-20 19:06:50,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:50,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133245853] [2024-06-20 19:06:50,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:50,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:06:55,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:55,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133245853] [2024-06-20 19:06:55,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133245853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:55,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:55,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:06:55,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854844446] [2024-06-20 19:06:55,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:55,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:06:55,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:55,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:06:55,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:06:55,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:06:55,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 130 transitions, 936 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:55,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:55,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:06:55,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:56,120 INFO L124 PetriNetUnfolderBase]: 314/599 cut-off events. [2024-06-20 19:06:56,120 INFO L125 PetriNetUnfolderBase]: For 23963/23963 co-relation queries the response was YES. [2024-06-20 19:06:56,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3315 conditions, 599 events. 314/599 cut-off events. For 23963/23963 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2800 event pairs, 43 based on Foata normal form. 2/600 useless extension candidates. Maximal degree in co-relation 3241. Up to 499 conditions per place. [2024-06-20 19:06:56,124 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 123 selfloop transitions, 23 changer transitions 0/149 dead transitions. [2024-06-20 19:06:56,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 149 transitions, 1384 flow [2024-06-20 19:06:56,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:06:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:06:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-20 19:06:56,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967741935483871 [2024-06-20 19:06:56,126 INFO L175 Difference]: Start difference. First operand has 157 places, 130 transitions, 936 flow. Second operand 10 states and 123 transitions. [2024-06-20 19:06:56,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 149 transitions, 1384 flow [2024-06-20 19:06:56,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 149 transitions, 1346 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 19:06:56,167 INFO L231 Difference]: Finished difference. Result has 161 places, 131 transitions, 960 flow [2024-06-20 19:06:56,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=960, PETRI_PLACES=161, PETRI_TRANSITIONS=131} [2024-06-20 19:06:56,168 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2024-06-20 19:06:56,168 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 131 transitions, 960 flow [2024-06-20 19:06:56,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:56,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:56,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:56,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 19:06:56,169 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:06:56,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:56,169 INFO L85 PathProgramCache]: Analyzing trace with hash -2021823266, now seen corresponding path program 4 times [2024-06-20 19:06:56,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:56,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137973526] [2024-06-20 19:06:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:56,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:07:01,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:01,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137973526] [2024-06-20 19:07:01,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137973526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:01,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:01,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:07:01,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085068642] [2024-06-20 19:07:01,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:01,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:07:01,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:01,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:07:01,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:07:01,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:07:01,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 131 transitions, 960 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:01,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:01,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:07:01,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:02,111 INFO L124 PetriNetUnfolderBase]: 311/594 cut-off events. [2024-06-20 19:07:02,111 INFO L125 PetriNetUnfolderBase]: For 22371/22371 co-relation queries the response was YES. [2024-06-20 19:07:02,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3232 conditions, 594 events. 311/594 cut-off events. For 22371/22371 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2768 event pairs, 44 based on Foata normal form. 2/595 useless extension candidates. Maximal degree in co-relation 3156. Up to 513 conditions per place. [2024-06-20 19:07:02,115 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 121 selfloop transitions, 23 changer transitions 0/147 dead transitions. [2024-06-20 19:07:02,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 147 transitions, 1290 flow [2024-06-20 19:07:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:07:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:07:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-20 19:07:02,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 19:07:02,122 INFO L175 Difference]: Start difference. First operand has 161 places, 131 transitions, 960 flow. Second operand 10 states and 120 transitions. [2024-06-20 19:07:02,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 147 transitions, 1290 flow [2024-06-20 19:07:02,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 147 transitions, 1231 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-20 19:07:02,156 INFO L231 Difference]: Finished difference. Result has 163 places, 131 transitions, 951 flow [2024-06-20 19:07:02,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=951, PETRI_PLACES=163, PETRI_TRANSITIONS=131} [2024-06-20 19:07:02,157 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2024-06-20 19:07:02,157 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 131 transitions, 951 flow [2024-06-20 19:07:02,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:02,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:02,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:02,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 19:07:02,157 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:07:02,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:02,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1795568980, now seen corresponding path program 1 times [2024-06-20 19:07:02,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:02,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642154683] [2024-06-20 19:07:02,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:02,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:07:08,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:08,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642154683] [2024-06-20 19:07:08,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642154683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:08,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:08,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:07:08,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724152782] [2024-06-20 19:07:08,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:08,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:07:08,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:08,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:07:08,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:07:08,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:07:08,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 131 transitions, 951 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:08,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:08,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:07:08,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:08,916 INFO L124 PetriNetUnfolderBase]: 314/601 cut-off events. [2024-06-20 19:07:08,917 INFO L125 PetriNetUnfolderBase]: For 22090/22090 co-relation queries the response was YES. [2024-06-20 19:07:08,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3282 conditions, 601 events. 314/601 cut-off events. For 22090/22090 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2822 event pairs, 43 based on Foata normal form. 1/601 useless extension candidates. Maximal degree in co-relation 3205. Up to 518 conditions per place. [2024-06-20 19:07:08,930 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 120 selfloop transitions, 26 changer transitions 0/149 dead transitions. [2024-06-20 19:07:08,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 149 transitions, 1335 flow [2024-06-20 19:07:08,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:07:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:07:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-20 19:07:08,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-20 19:07:08,945 INFO L175 Difference]: Start difference. First operand has 163 places, 131 transitions, 951 flow. Second operand 11 states and 130 transitions. [2024-06-20 19:07:08,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 149 transitions, 1335 flow [2024-06-20 19:07:08,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 149 transitions, 1286 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-20 19:07:08,997 INFO L231 Difference]: Finished difference. Result has 165 places, 133 transitions, 1013 flow [2024-06-20 19:07:08,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1013, PETRI_PLACES=165, PETRI_TRANSITIONS=133} [2024-06-20 19:07:08,997 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2024-06-20 19:07:08,998 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 133 transitions, 1013 flow [2024-06-20 19:07:08,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:08,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:08,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:08,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 19:07:08,999 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:07:08,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:08,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1624878416, now seen corresponding path program 5 times [2024-06-20 19:07:08,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:08,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515365977] [2024-06-20 19:07:08,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:09,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:07:14,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:14,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515365977] [2024-06-20 19:07:14,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515365977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:14,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:14,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:07:14,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340948766] [2024-06-20 19:07:14,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:14,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:07:14,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:14,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:07:14,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:07:14,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:07:14,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 133 transitions, 1013 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:14,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:14,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:07:14,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:15,046 INFO L124 PetriNetUnfolderBase]: 328/627 cut-off events. [2024-06-20 19:07:15,047 INFO L125 PetriNetUnfolderBase]: For 26973/26973 co-relation queries the response was YES. [2024-06-20 19:07:15,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3538 conditions, 627 events. 328/627 cut-off events. For 26973/26973 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2984 event pairs, 44 based on Foata normal form. 2/628 useless extension candidates. Maximal degree in co-relation 3460. Up to 530 conditions per place. [2024-06-20 19:07:15,051 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 128 selfloop transitions, 23 changer transitions 0/154 dead transitions. [2024-06-20 19:07:15,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 154 transitions, 1521 flow [2024-06-20 19:07:15,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:07:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:07:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-20 19:07:15,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.432258064516129 [2024-06-20 19:07:15,053 INFO L175 Difference]: Start difference. First operand has 165 places, 133 transitions, 1013 flow. Second operand 10 states and 134 transitions. [2024-06-20 19:07:15,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 154 transitions, 1521 flow [2024-06-20 19:07:15,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 154 transitions, 1426 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-20 19:07:15,107 INFO L231 Difference]: Finished difference. Result has 167 places, 139 transitions, 1044 flow [2024-06-20 19:07:15,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1044, PETRI_PLACES=167, PETRI_TRANSITIONS=139} [2024-06-20 19:07:15,108 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2024-06-20 19:07:15,108 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 139 transitions, 1044 flow [2024-06-20 19:07:15,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:15,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:15,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:15,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 19:07:15,109 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:07:15,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1624883066, now seen corresponding path program 6 times [2024-06-20 19:07:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:15,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334131760] [2024-06-20 19:07:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:15,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:07:20,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:20,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334131760] [2024-06-20 19:07:20,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334131760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:20,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:20,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:07:20,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624508989] [2024-06-20 19:07:20,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:20,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:07:20,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:20,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:07:20,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:07:20,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:07:20,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 139 transitions, 1044 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:20,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:20,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:07:20,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:21,157 INFO L124 PetriNetUnfolderBase]: 325/622 cut-off events. [2024-06-20 19:07:21,158 INFO L125 PetriNetUnfolderBase]: For 25606/25606 co-relation queries the response was YES. [2024-06-20 19:07:21,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3421 conditions, 622 events. 325/622 cut-off events. For 25606/25606 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2944 event pairs, 45 based on Foata normal form. 2/623 useless extension candidates. Maximal degree in co-relation 3341. Up to 542 conditions per place. [2024-06-20 19:07:21,164 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 127 selfloop transitions, 22 changer transitions 0/152 dead transitions. [2024-06-20 19:07:21,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 152 transitions, 1374 flow [2024-06-20 19:07:21,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:07:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:07:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-20 19:07:21,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42258064516129035 [2024-06-20 19:07:21,165 INFO L175 Difference]: Start difference. First operand has 167 places, 139 transitions, 1044 flow. Second operand 10 states and 131 transitions. [2024-06-20 19:07:21,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 152 transitions, 1374 flow [2024-06-20 19:07:21,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 152 transitions, 1326 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-20 19:07:21,218 INFO L231 Difference]: Finished difference. Result has 174 places, 139 transitions, 1044 flow [2024-06-20 19:07:21,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1044, PETRI_PLACES=174, PETRI_TRANSITIONS=139} [2024-06-20 19:07:21,218 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 144 predicate places. [2024-06-20 19:07:21,218 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 139 transitions, 1044 flow [2024-06-20 19:07:21,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:21,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:21,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:21,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 19:07:21,219 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:07:21,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:21,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1394047104, now seen corresponding path program 7 times [2024-06-20 19:07:21,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:21,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238810586] [2024-06-20 19:07:21,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:21,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:07:27,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:27,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238810586] [2024-06-20 19:07:27,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238810586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:27,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:27,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:07:27,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649418800] [2024-06-20 19:07:27,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:27,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:07:27,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:27,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:07:27,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:07:27,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:07:27,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 139 transitions, 1044 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:27,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:27,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:07:27,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:27,450 INFO L124 PetriNetUnfolderBase]: 336/643 cut-off events. [2024-06-20 19:07:27,450 INFO L125 PetriNetUnfolderBase]: For 29204/29204 co-relation queries the response was YES. [2024-06-20 19:07:27,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 643 events. 336/643 cut-off events. For 29204/29204 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3091 event pairs, 42 based on Foata normal form. 2/644 useless extension candidates. Maximal degree in co-relation 3538. Up to 508 conditions per place. [2024-06-20 19:07:27,455 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 129 selfloop transitions, 25 changer transitions 0/157 dead transitions. [2024-06-20 19:07:27,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 157 transitions, 1526 flow [2024-06-20 19:07:27,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:07:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:07:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-20 19:07:27,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:07:27,456 INFO L175 Difference]: Start difference. First operand has 174 places, 139 transitions, 1044 flow. Second operand 10 states and 124 transitions. [2024-06-20 19:07:27,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 157 transitions, 1526 flow [2024-06-20 19:07:27,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 157 transitions, 1479 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-20 19:07:27,523 INFO L231 Difference]: Finished difference. Result has 175 places, 141 transitions, 1081 flow [2024-06-20 19:07:27,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1081, PETRI_PLACES=175, PETRI_TRANSITIONS=141} [2024-06-20 19:07:27,524 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 145 predicate places. [2024-06-20 19:07:27,524 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 141 transitions, 1081 flow [2024-06-20 19:07:27,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:27,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:27,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:27,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 19:07:27,524 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:07:27,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:27,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1999421120, now seen corresponding path program 8 times [2024-06-20 19:07:27,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:27,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965807586] [2024-06-20 19:07:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:27,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:07:32,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:32,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965807586] [2024-06-20 19:07:32,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965807586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:32,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:32,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:07:32,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579206780] [2024-06-20 19:07:32,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:32,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:07:32,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:32,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:07:32,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:07:32,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:07:32,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 141 transitions, 1081 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:32,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:32,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:07:32,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:33,041 INFO L124 PetriNetUnfolderBase]: 343/658 cut-off events. [2024-06-20 19:07:33,042 INFO L125 PetriNetUnfolderBase]: For 30380/30380 co-relation queries the response was YES. [2024-06-20 19:07:33,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3740 conditions, 658 events. 343/658 cut-off events. For 30380/30380 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3196 event pairs, 48 based on Foata normal form. 2/659 useless extension candidates. Maximal degree in co-relation 3657. Up to 575 conditions per place. [2024-06-20 19:07:33,047 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 130 selfloop transitions, 24 changer transitions 0/157 dead transitions. [2024-06-20 19:07:33,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 157 transitions, 1458 flow [2024-06-20 19:07:33,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:07:33,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:07:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-20 19:07:33,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2024-06-20 19:07:33,048 INFO L175 Difference]: Start difference. First operand has 175 places, 141 transitions, 1081 flow. Second operand 10 states and 121 transitions. [2024-06-20 19:07:33,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 157 transitions, 1458 flow [2024-06-20 19:07:33,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 157 transitions, 1406 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-20 19:07:33,113 INFO L231 Difference]: Finished difference. Result has 179 places, 144 transitions, 1120 flow [2024-06-20 19:07:33,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1120, PETRI_PLACES=179, PETRI_TRANSITIONS=144} [2024-06-20 19:07:33,114 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2024-06-20 19:07:33,114 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 144 transitions, 1120 flow [2024-06-20 19:07:33,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:33,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:33,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:33,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 19:07:33,115 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:07:33,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:33,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1791112196, now seen corresponding path program 9 times [2024-06-20 19:07:33,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:33,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089745125] [2024-06-20 19:07:33,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:33,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:07:38,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:38,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089745125] [2024-06-20 19:07:38,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089745125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:38,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:38,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:07:38,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285216527] [2024-06-20 19:07:38,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:38,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:07:38,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:38,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:07:38,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:07:38,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:07:38,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 144 transitions, 1120 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:38,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:38,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:07:38,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:38,363 INFO L124 PetriNetUnfolderBase]: 347/666 cut-off events. [2024-06-20 19:07:38,364 INFO L125 PetriNetUnfolderBase]: For 31305/31305 co-relation queries the response was YES. [2024-06-20 19:07:38,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3793 conditions, 666 events. 347/666 cut-off events. For 31305/31305 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3253 event pairs, 46 based on Foata normal form. 2/667 useless extension candidates. Maximal degree in co-relation 3708. Up to 560 conditions per place. [2024-06-20 19:07:38,369 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 131 selfloop transitions, 26 changer transitions 0/160 dead transitions. [2024-06-20 19:07:38,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 160 transitions, 1596 flow [2024-06-20 19:07:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:07:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:07:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-20 19:07:38,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290322580645161 [2024-06-20 19:07:38,371 INFO L175 Difference]: Start difference. First operand has 179 places, 144 transitions, 1120 flow. Second operand 10 states and 133 transitions. [2024-06-20 19:07:38,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 160 transitions, 1596 flow [2024-06-20 19:07:38,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 160 transitions, 1543 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-20 19:07:38,441 INFO L231 Difference]: Finished difference. Result has 182 places, 145 transitions, 1137 flow [2024-06-20 19:07:38,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1137, PETRI_PLACES=182, PETRI_TRANSITIONS=145} [2024-06-20 19:07:38,441 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2024-06-20 19:07:38,441 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 145 transitions, 1137 flow [2024-06-20 19:07:38,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:38,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:38,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:38,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 19:07:38,442 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:07:38,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:38,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1797545936, now seen corresponding path program 10 times [2024-06-20 19:07:38,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:38,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419974934] [2024-06-20 19:07:38,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:38,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:07:43,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:43,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419974934] [2024-06-20 19:07:43,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419974934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:43,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:43,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:07:43,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748823233] [2024-06-20 19:07:43,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:43,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:07:43,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:43,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:07:43,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:07:43,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:07:43,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 145 transitions, 1137 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:43,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:43,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:07:43,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:44,293 INFO L124 PetriNetUnfolderBase]: 344/661 cut-off events. [2024-06-20 19:07:44,294 INFO L125 PetriNetUnfolderBase]: For 29135/29135 co-relation queries the response was YES. [2024-06-20 19:07:44,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3672 conditions, 661 events. 344/661 cut-off events. For 29135/29135 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3213 event pairs, 47 based on Foata normal form. 2/662 useless extension candidates. Maximal degree in co-relation 3587. Up to 578 conditions per place. [2024-06-20 19:07:44,299 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 130 selfloop transitions, 25 changer transitions 0/158 dead transitions. [2024-06-20 19:07:44,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 158 transitions, 1479 flow [2024-06-20 19:07:44,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:07:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:07:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-20 19:07:44,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 19:07:44,300 INFO L175 Difference]: Start difference. First operand has 182 places, 145 transitions, 1137 flow. Second operand 10 states and 120 transitions. [2024-06-20 19:07:44,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 158 transitions, 1479 flow [2024-06-20 19:07:44,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 158 transitions, 1391 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-20 19:07:44,363 INFO L231 Difference]: Finished difference. Result has 183 places, 145 transitions, 1103 flow [2024-06-20 19:07:44,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1103, PETRI_PLACES=183, PETRI_TRANSITIONS=145} [2024-06-20 19:07:44,364 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 153 predicate places. [2024-06-20 19:07:44,364 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 145 transitions, 1103 flow [2024-06-20 19:07:44,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:44,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:44,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:44,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 19:07:44,365 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:07:44,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:44,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1797792200, now seen corresponding path program 1 times [2024-06-20 19:07:44,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:44,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188776961] [2024-06-20 19:07:44,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:44,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:07:50,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:50,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188776961] [2024-06-20 19:07:50,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188776961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:50,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:50,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:07:50,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331262991] [2024-06-20 19:07:50,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:50,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:07:50,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:50,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:07:50,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:07:50,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:07:50,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 145 transitions, 1103 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:50,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:50,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:07:50,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:51,016 INFO L124 PetriNetUnfolderBase]: 348/669 cut-off events. [2024-06-20 19:07:51,016 INFO L125 PetriNetUnfolderBase]: For 30146/30146 co-relation queries the response was YES. [2024-06-20 19:07:51,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3667 conditions, 669 events. 348/669 cut-off events. For 30146/30146 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3287 event pairs, 47 based on Foata normal form. 2/670 useless extension candidates. Maximal degree in co-relation 3582. Up to 598 conditions per place. [2024-06-20 19:07:51,021 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 141 selfloop transitions, 19 changer transitions 0/163 dead transitions. [2024-06-20 19:07:51,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 163 transitions, 1512 flow [2024-06-20 19:07:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:07:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:07:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-20 19:07:51,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-20 19:07:51,023 INFO L175 Difference]: Start difference. First operand has 183 places, 145 transitions, 1103 flow. Second operand 11 states and 127 transitions. [2024-06-20 19:07:51,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 163 transitions, 1512 flow [2024-06-20 19:07:51,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 163 transitions, 1450 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:07:51,089 INFO L231 Difference]: Finished difference. Result has 187 places, 149 transitions, 1150 flow [2024-06-20 19:07:51,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1150, PETRI_PLACES=187, PETRI_TRANSITIONS=149} [2024-06-20 19:07:51,090 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2024-06-20 19:07:51,090 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 149 transitions, 1150 flow [2024-06-20 19:07:51,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:51,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:51,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:51,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 19:07:51,091 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:07:51,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1797791890, now seen corresponding path program 2 times [2024-06-20 19:07:51,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:51,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159209491] [2024-06-20 19:07:51,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:07:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:56,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159209491] [2024-06-20 19:07:56,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159209491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:56,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:56,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:07:56,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879073531] [2024-06-20 19:07:56,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:56,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:07:56,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:56,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:07:56,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:07:57,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:07:57,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 149 transitions, 1150 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:57,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:57,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:07:57,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:57,369 INFO L124 PetriNetUnfolderBase]: 351/675 cut-off events. [2024-06-20 19:07:57,369 INFO L125 PetriNetUnfolderBase]: For 29863/29863 co-relation queries the response was YES. [2024-06-20 19:07:57,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3756 conditions, 675 events. 351/675 cut-off events. For 29863/29863 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3319 event pairs, 49 based on Foata normal form. 1/675 useless extension candidates. Maximal degree in co-relation 3668. Up to 539 conditions per place. [2024-06-20 19:07:57,375 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 114 selfloop transitions, 48 changer transitions 0/165 dead transitions. [2024-06-20 19:07:57,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 165 transitions, 1564 flow [2024-06-20 19:07:57,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:07:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:07:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-20 19:07:57,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-20 19:07:57,376 INFO L175 Difference]: Start difference. First operand has 187 places, 149 transitions, 1150 flow. Second operand 11 states and 133 transitions. [2024-06-20 19:07:57,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 165 transitions, 1564 flow [2024-06-20 19:07:57,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 165 transitions, 1468 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-06-20 19:07:57,452 INFO L231 Difference]: Finished difference. Result has 188 places, 151 transitions, 1213 flow [2024-06-20 19:07:57,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1213, PETRI_PLACES=188, PETRI_TRANSITIONS=151} [2024-06-20 19:07:57,453 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 158 predicate places. [2024-06-20 19:07:57,453 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 151 transitions, 1213 flow [2024-06-20 19:07:57,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:57,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:57,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:57,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 19:07:57,454 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:07:57,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:57,454 INFO L85 PathProgramCache]: Analyzing trace with hash -274925248, now seen corresponding path program 11 times [2024-06-20 19:07:57,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:57,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748405690] [2024-06-20 19:07:57,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:57,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:08:02,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:02,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748405690] [2024-06-20 19:08:02,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748405690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:02,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:02,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:02,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176849384] [2024-06-20 19:08:02,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:02,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:02,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:02,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:02,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:02,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:08:02,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 151 transitions, 1213 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:02,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:02,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:08:02,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:02,953 INFO L124 PetriNetUnfolderBase]: 358/692 cut-off events. [2024-06-20 19:08:02,953 INFO L125 PetriNetUnfolderBase]: For 32269/32271 co-relation queries the response was YES. [2024-06-20 19:08:02,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3842 conditions, 692 events. 358/692 cut-off events. For 32269/32271 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3452 event pairs, 48 based on Foata normal form. 4/695 useless extension candidates. Maximal degree in co-relation 3753. Up to 549 conditions per place. [2024-06-20 19:08:02,959 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 123 selfloop transitions, 43 changer transitions 0/169 dead transitions. [2024-06-20 19:08:02,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 169 transitions, 1656 flow [2024-06-20 19:08:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:02,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-20 19:08:02,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-20 19:08:02,960 INFO L175 Difference]: Start difference. First operand has 188 places, 151 transitions, 1213 flow. Second operand 10 states and 122 transitions. [2024-06-20 19:08:02,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 169 transitions, 1656 flow [2024-06-20 19:08:03,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 169 transitions, 1513 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-20 19:08:03,042 INFO L231 Difference]: Finished difference. Result has 190 places, 157 transitions, 1233 flow [2024-06-20 19:08:03,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1233, PETRI_PLACES=190, PETRI_TRANSITIONS=157} [2024-06-20 19:08:03,043 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 160 predicate places. [2024-06-20 19:08:03,043 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 157 transitions, 1233 flow [2024-06-20 19:08:03,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:03,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:03,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:03,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 19:08:03,043 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:08:03,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:03,044 INFO L85 PathProgramCache]: Analyzing trace with hash -275102878, now seen corresponding path program 12 times [2024-06-20 19:08:03,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:03,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589373047] [2024-06-20 19:08:03,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:08:07,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:07,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589373047] [2024-06-20 19:08:07,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589373047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:07,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:07,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:08:07,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452479428] [2024-06-20 19:08:07,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:07,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:08:07,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:07,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:08:07,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:08:08,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:08:08,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 157 transitions, 1233 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:08,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:08,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:08:08,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:08,281 INFO L124 PetriNetUnfolderBase]: 369/715 cut-off events. [2024-06-20 19:08:08,282 INFO L125 PetriNetUnfolderBase]: For 36997/36999 co-relation queries the response was YES. [2024-06-20 19:08:08,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4074 conditions, 715 events. 369/715 cut-off events. For 36997/36999 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3626 event pairs, 47 based on Foata normal form. 4/718 useless extension candidates. Maximal degree in co-relation 3983. Up to 545 conditions per place. [2024-06-20 19:08:08,289 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 125 selfloop transitions, 45 changer transitions 0/173 dead transitions. [2024-06-20 19:08:08,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 173 transitions, 1781 flow [2024-06-20 19:08:08,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-20 19:08:08,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.432258064516129 [2024-06-20 19:08:08,291 INFO L175 Difference]: Start difference. First operand has 190 places, 157 transitions, 1233 flow. Second operand 10 states and 134 transitions. [2024-06-20 19:08:08,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 173 transitions, 1781 flow [2024-06-20 19:08:08,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 173 transitions, 1684 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-20 19:08:08,378 INFO L231 Difference]: Finished difference. Result has 195 places, 159 transitions, 1264 flow [2024-06-20 19:08:08,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1264, PETRI_PLACES=195, PETRI_TRANSITIONS=159} [2024-06-20 19:08:08,378 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 165 predicate places. [2024-06-20 19:08:08,379 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 159 transitions, 1264 flow [2024-06-20 19:08:08,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:08,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:08,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:08,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 19:08:08,379 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:08:08,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:08,380 INFO L85 PathProgramCache]: Analyzing trace with hash -238342192, now seen corresponding path program 13 times [2024-06-20 19:08:08,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:08,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117065813] [2024-06-20 19:08:08,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:08,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:14,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-20 19:08:14,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:14,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117065813] [2024-06-20 19:08:14,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117065813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:14,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:14,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:14,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722194912] [2024-06-20 19:08:14,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:14,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:14,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:14,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:14,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:14,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:08:14,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 159 transitions, 1264 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:14,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:14,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:08:14,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:14,360 INFO L124 PetriNetUnfolderBase]: 376/728 cut-off events. [2024-06-20 19:08:14,361 INFO L125 PetriNetUnfolderBase]: For 38150/38152 co-relation queries the response was YES. [2024-06-20 19:08:14,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4142 conditions, 728 events. 376/728 cut-off events. For 38150/38152 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3696 event pairs, 49 based on Foata normal form. 4/731 useless extension candidates. Maximal degree in co-relation 4050. Up to 582 conditions per place. [2024-06-20 19:08:14,367 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 127 selfloop transitions, 44 changer transitions 0/174 dead transitions. [2024-06-20 19:08:14,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 174 transitions, 1691 flow [2024-06-20 19:08:14,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-20 19:08:14,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:08:14,368 INFO L175 Difference]: Start difference. First operand has 195 places, 159 transitions, 1264 flow. Second operand 10 states and 124 transitions. [2024-06-20 19:08:14,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 174 transitions, 1691 flow [2024-06-20 19:08:14,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 174 transitions, 1615 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-20 19:08:14,453 INFO L231 Difference]: Finished difference. Result has 200 places, 163 transitions, 1349 flow [2024-06-20 19:08:14,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1349, PETRI_PLACES=200, PETRI_TRANSITIONS=163} [2024-06-20 19:08:14,454 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 170 predicate places. [2024-06-20 19:08:14,454 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 163 transitions, 1349 flow [2024-06-20 19:08:14,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:14,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:14,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:14,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 19:08:14,455 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:08:14,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:14,455 INFO L85 PathProgramCache]: Analyzing trace with hash -244598302, now seen corresponding path program 14 times [2024-06-20 19:08:14,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:14,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219925415] [2024-06-20 19:08:14,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:14,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:08:19,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:19,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219925415] [2024-06-20 19:08:19,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219925415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:19,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:19,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:19,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380429045] [2024-06-20 19:08:19,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:19,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:19,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:19,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:19,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:19,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:08:19,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 163 transitions, 1349 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:19,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:19,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:08:19,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:20,072 INFO L124 PetriNetUnfolderBase]: 383/737 cut-off events. [2024-06-20 19:08:20,072 INFO L125 PetriNetUnfolderBase]: For 39362/39364 co-relation queries the response was YES. [2024-06-20 19:08:20,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 737 events. 383/737 cut-off events. For 39362/39364 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3752 event pairs, 51 based on Foata normal form. 4/740 useless extension candidates. Maximal degree in co-relation 4199. Up to 594 conditions per place. [2024-06-20 19:08:20,078 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 129 selfloop transitions, 45 changer transitions 0/177 dead transitions. [2024-06-20 19:08:20,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 177 transitions, 1764 flow [2024-06-20 19:08:20,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:20,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-20 19:08:20,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-20 19:08:20,080 INFO L175 Difference]: Start difference. First operand has 200 places, 163 transitions, 1349 flow. Second operand 10 states and 125 transitions. [2024-06-20 19:08:20,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 177 transitions, 1764 flow [2024-06-20 19:08:20,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 177 transitions, 1638 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-20 19:08:20,173 INFO L231 Difference]: Finished difference. Result has 203 places, 166 transitions, 1360 flow [2024-06-20 19:08:20,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1360, PETRI_PLACES=203, PETRI_TRANSITIONS=166} [2024-06-20 19:08:20,173 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2024-06-20 19:08:20,173 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 166 transitions, 1360 flow [2024-06-20 19:08:20,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:20,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:20,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:20,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 19:08:20,174 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:08:20,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:20,175 INFO L85 PathProgramCache]: Analyzing trace with hash -907087920, now seen corresponding path program 15 times [2024-06-20 19:08:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:20,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79777190] [2024-06-20 19:08:20,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:20,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:08:25,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:25,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79777190] [2024-06-20 19:08:25,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79777190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:25,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:25,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:25,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832933015] [2024-06-20 19:08:25,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:25,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:25,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:25,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:25,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:25,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:08:25,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 166 transitions, 1360 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:25,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:25,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:08:25,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:26,237 INFO L124 PetriNetUnfolderBase]: 387/749 cut-off events. [2024-06-20 19:08:26,237 INFO L125 PetriNetUnfolderBase]: For 40453/40455 co-relation queries the response was YES. [2024-06-20 19:08:26,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4310 conditions, 749 events. 387/749 cut-off events. For 40453/40455 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3845 event pairs, 51 based on Foata normal form. 4/752 useless extension candidates. Maximal degree in co-relation 4214. Up to 602 conditions per place. [2024-06-20 19:08:26,243 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 123 selfloop transitions, 53 changer transitions 0/179 dead transitions. [2024-06-20 19:08:26,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 179 transitions, 1757 flow [2024-06-20 19:08:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-20 19:08:26,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2024-06-20 19:08:26,246 INFO L175 Difference]: Start difference. First operand has 203 places, 166 transitions, 1360 flow. Second operand 10 states and 121 transitions. [2024-06-20 19:08:26,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 179 transitions, 1757 flow [2024-06-20 19:08:26,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 179 transitions, 1661 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-20 19:08:26,339 INFO L231 Difference]: Finished difference. Result has 208 places, 168 transitions, 1400 flow [2024-06-20 19:08:26,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1400, PETRI_PLACES=208, PETRI_TRANSITIONS=168} [2024-06-20 19:08:26,339 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-20 19:08:26,340 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 168 transitions, 1400 flow [2024-06-20 19:08:26,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:26,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:26,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:26,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 19:08:26,344 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:08:26,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash 587166558, now seen corresponding path program 16 times [2024-06-20 19:08:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:26,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470205622] [2024-06-20 19:08:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:08:31,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:31,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470205622] [2024-06-20 19:08:31,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470205622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:31,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:31,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:08:31,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262662782] [2024-06-20 19:08:31,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:31,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:08:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:31,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:08:31,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:08:31,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:08:31,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 168 transitions, 1400 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:31,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:31,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:08:31,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:31,616 INFO L124 PetriNetUnfolderBase]: 391/757 cut-off events. [2024-06-20 19:08:31,616 INFO L125 PetriNetUnfolderBase]: For 41628/41630 co-relation queries the response was YES. [2024-06-20 19:08:31,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4389 conditions, 757 events. 391/757 cut-off events. For 41628/41630 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3916 event pairs, 51 based on Foata normal form. 4/760 useless extension candidates. Maximal degree in co-relation 4291. Up to 590 conditions per place. [2024-06-20 19:08:31,622 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 131 selfloop transitions, 47 changer transitions 0/181 dead transitions. [2024-06-20 19:08:31,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 181 transitions, 1806 flow [2024-06-20 19:08:31,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-20 19:08:31,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43870967741935485 [2024-06-20 19:08:31,626 INFO L175 Difference]: Start difference. First operand has 208 places, 168 transitions, 1400 flow. Second operand 10 states and 136 transitions. [2024-06-20 19:08:31,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 181 transitions, 1806 flow [2024-06-20 19:08:31,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 181 transitions, 1694 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-20 19:08:31,719 INFO L231 Difference]: Finished difference. Result has 211 places, 169 transitions, 1410 flow [2024-06-20 19:08:31,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1410, PETRI_PLACES=211, PETRI_TRANSITIONS=169} [2024-06-20 19:08:31,720 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-20 19:08:31,720 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 169 transitions, 1410 flow [2024-06-20 19:08:31,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:31,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:31,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:31,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-20 19:08:31,721 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:08:31,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:31,721 INFO L85 PathProgramCache]: Analyzing trace with hash 420932778, now seen corresponding path program 17 times [2024-06-20 19:08:31,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:31,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742881301] [2024-06-20 19:08:31,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:08:36,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:36,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742881301] [2024-06-20 19:08:36,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742881301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:36,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:36,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:08:36,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789030762] [2024-06-20 19:08:36,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:36,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:08:36,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:36,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:08:36,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:08:36,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:08:36,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 169 transitions, 1410 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:36,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:36,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:08:36,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:36,396 INFO L124 PetriNetUnfolderBase]: 402/776 cut-off events. [2024-06-20 19:08:36,397 INFO L125 PetriNetUnfolderBase]: For 47708/47710 co-relation queries the response was YES. [2024-06-20 19:08:36,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4679 conditions, 776 events. 402/776 cut-off events. For 47708/47710 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4009 event pairs, 54 based on Foata normal form. 4/779 useless extension candidates. Maximal degree in co-relation 4580. Up to 614 conditions per place. [2024-06-20 19:08:36,403 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 132 selfloop transitions, 50 changer transitions 0/185 dead transitions. [2024-06-20 19:08:36,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 185 transitions, 1996 flow [2024-06-20 19:08:36,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-20 19:08:36,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43870967741935485 [2024-06-20 19:08:36,404 INFO L175 Difference]: Start difference. First operand has 211 places, 169 transitions, 1410 flow. Second operand 10 states and 136 transitions. [2024-06-20 19:08:36,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 185 transitions, 1996 flow [2024-06-20 19:08:36,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 185 transitions, 1882 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-20 19:08:36,514 INFO L231 Difference]: Finished difference. Result has 213 places, 172 transitions, 1462 flow [2024-06-20 19:08:36,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1462, PETRI_PLACES=213, PETRI_TRANSITIONS=172} [2024-06-20 19:08:36,514 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 183 predicate places. [2024-06-20 19:08:36,514 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 172 transitions, 1462 flow [2024-06-20 19:08:36,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:36,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:36,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:36,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-20 19:08:36,515 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:08:36,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1478812222, now seen corresponding path program 18 times [2024-06-20 19:08:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:36,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572303273] [2024-06-20 19:08:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:08:41,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:41,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572303273] [2024-06-20 19:08:41,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572303273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:41,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:41,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:41,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719815847] [2024-06-20 19:08:41,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:41,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:41,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:41,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:41,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:42,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:08:42,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 172 transitions, 1462 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:42,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:42,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:08:42,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:42,293 INFO L124 PetriNetUnfolderBase]: 399/775 cut-off events. [2024-06-20 19:08:42,293 INFO L125 PetriNetUnfolderBase]: For 44564/44566 co-relation queries the response was YES. [2024-06-20 19:08:42,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4525 conditions, 775 events. 399/775 cut-off events. For 44564/44566 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4047 event pairs, 55 based on Foata normal form. 4/778 useless extension candidates. Maximal degree in co-relation 4425. Up to 626 conditions per place. [2024-06-20 19:08:42,300 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 132 selfloop transitions, 48 changer transitions 0/183 dead transitions. [2024-06-20 19:08:42,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 183 transitions, 1848 flow [2024-06-20 19:08:42,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-20 19:08:42,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967741935483871 [2024-06-20 19:08:42,301 INFO L175 Difference]: Start difference. First operand has 213 places, 172 transitions, 1462 flow. Second operand 10 states and 123 transitions. [2024-06-20 19:08:42,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 183 transitions, 1848 flow [2024-06-20 19:08:42,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 183 transitions, 1767 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-20 19:08:42,410 INFO L231 Difference]: Finished difference. Result has 219 places, 172 transitions, 1481 flow [2024-06-20 19:08:42,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1481, PETRI_PLACES=219, PETRI_TRANSITIONS=172} [2024-06-20 19:08:42,411 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 189 predicate places. [2024-06-20 19:08:42,411 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 172 transitions, 1481 flow [2024-06-20 19:08:42,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:42,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:42,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:42,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-20 19:08:42,411 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:08:42,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:42,412 INFO L85 PathProgramCache]: Analyzing trace with hash -410832082, now seen corresponding path program 19 times [2024-06-20 19:08:42,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:42,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108292358] [2024-06-20 19:08:42,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:42,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:08:47,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:47,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108292358] [2024-06-20 19:08:47,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108292358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:47,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:47,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:47,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849182626] [2024-06-20 19:08:47,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:47,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:47,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:47,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:47,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:48,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:08:48,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 172 transitions, 1481 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:48,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:48,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:08:48,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:48,248 INFO L124 PetriNetUnfolderBase]: 396/768 cut-off events. [2024-06-20 19:08:48,248 INFO L125 PetriNetUnfolderBase]: For 40807/40809 co-relation queries the response was YES. [2024-06-20 19:08:48,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4384 conditions, 768 events. 396/768 cut-off events. For 40807/40809 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3999 event pairs, 54 based on Foata normal form. 4/771 useless extension candidates. Maximal degree in co-relation 4282. Up to 621 conditions per place. [2024-06-20 19:08:48,255 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 131 selfloop transitions, 49 changer transitions 0/183 dead transitions. [2024-06-20 19:08:48,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 183 transitions, 1867 flow [2024-06-20 19:08:48,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-20 19:08:48,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967741935483871 [2024-06-20 19:08:48,256 INFO L175 Difference]: Start difference. First operand has 219 places, 172 transitions, 1481 flow. Second operand 10 states and 123 transitions. [2024-06-20 19:08:48,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 183 transitions, 1867 flow [2024-06-20 19:08:48,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 183 transitions, 1733 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-20 19:08:48,368 INFO L231 Difference]: Finished difference. Result has 219 places, 172 transitions, 1449 flow [2024-06-20 19:08:48,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1449, PETRI_PLACES=219, PETRI_TRANSITIONS=172} [2024-06-20 19:08:48,368 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 189 predicate places. [2024-06-20 19:08:48,369 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 172 transitions, 1449 flow [2024-06-20 19:08:48,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:48,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:48,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:48,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-20 19:08:48,369 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:08:48,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1132112452, now seen corresponding path program 20 times [2024-06-20 19:08:48,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:48,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30536581] [2024-06-20 19:08:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:48,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:53,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:08:53,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:53,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30536581] [2024-06-20 19:08:53,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30536581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:53,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:53,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:53,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694933295] [2024-06-20 19:08:53,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:53,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:53,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:53,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:53,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:54,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:08:54,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 172 transitions, 1449 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:54,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:54,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:08:54,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:54,282 INFO L124 PetriNetUnfolderBase]: 393/763 cut-off events. [2024-06-20 19:08:54,282 INFO L125 PetriNetUnfolderBase]: For 36975/36977 co-relation queries the response was YES. [2024-06-20 19:08:54,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4179 conditions, 763 events. 393/763 cut-off events. For 36975/36977 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3962 event pairs, 49 based on Foata normal form. 4/766 useless extension candidates. Maximal degree in co-relation 4077. Up to 522 conditions per place. [2024-06-20 19:08:54,289 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 124 selfloop transitions, 58 changer transitions 0/185 dead transitions. [2024-06-20 19:08:54,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 185 transitions, 1843 flow [2024-06-20 19:08:54,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-20 19:08:54,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-20 19:08:54,290 INFO L175 Difference]: Start difference. First operand has 219 places, 172 transitions, 1449 flow. Second operand 10 states and 125 transitions. [2024-06-20 19:08:54,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 185 transitions, 1843 flow [2024-06-20 19:08:54,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 185 transitions, 1742 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-20 19:08:54,388 INFO L231 Difference]: Finished difference. Result has 220 places, 172 transitions, 1468 flow [2024-06-20 19:08:54,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1468, PETRI_PLACES=220, PETRI_TRANSITIONS=172} [2024-06-20 19:08:54,389 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 190 predicate places. [2024-06-20 19:08:54,389 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 172 transitions, 1468 flow [2024-06-20 19:08:54,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:54,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:54,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:54,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-20 19:08:54,389 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:08:54,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:54,390 INFO L85 PathProgramCache]: Analyzing trace with hash 563519616, now seen corresponding path program 2 times [2024-06-20 19:08:54,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:54,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267057600] [2024-06-20 19:08:54,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:54,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:09:00,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:00,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267057600] [2024-06-20 19:09:00,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267057600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:00,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:00,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:09:00,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498796633] [2024-06-20 19:09:00,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:00,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:09:00,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:00,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:09:00,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:09:00,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:09:00,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 172 transitions, 1468 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:00,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:00,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:09:00,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:01,302 INFO L124 PetriNetUnfolderBase]: 397/771 cut-off events. [2024-06-20 19:09:01,302 INFO L125 PetriNetUnfolderBase]: For 38376/38378 co-relation queries the response was YES. [2024-06-20 19:09:01,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4299 conditions, 771 events. 397/771 cut-off events. For 38376/38378 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4028 event pairs, 53 based on Foata normal form. 4/774 useless extension candidates. Maximal degree in co-relation 4196. Up to 651 conditions per place. [2024-06-20 19:09:01,308 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 151 selfloop transitions, 38 changer transitions 0/192 dead transitions. [2024-06-20 19:09:01,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 192 transitions, 2003 flow [2024-06-20 19:09:01,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:09:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:09:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-20 19:09:01,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3841642228739003 [2024-06-20 19:09:01,310 INFO L175 Difference]: Start difference. First operand has 220 places, 172 transitions, 1468 flow. Second operand 11 states and 131 transitions. [2024-06-20 19:09:01,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 192 transitions, 2003 flow [2024-06-20 19:09:01,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 192 transitions, 1719 flow, removed 12 selfloop flow, removed 13 redundant places. [2024-06-20 19:09:01,409 INFO L231 Difference]: Finished difference. Result has 222 places, 180 transitions, 1434 flow [2024-06-20 19:09:01,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1434, PETRI_PLACES=222, PETRI_TRANSITIONS=180} [2024-06-20 19:09:01,409 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 192 predicate places. [2024-06-20 19:09:01,410 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 180 transitions, 1434 flow [2024-06-20 19:09:01,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:01,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:01,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:01,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-20 19:09:01,410 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:09:01,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:01,411 INFO L85 PathProgramCache]: Analyzing trace with hash -74899476, now seen corresponding path program 3 times [2024-06-20 19:09:01,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:01,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923994626] [2024-06-20 19:09:01,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:09:07,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:07,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923994626] [2024-06-20 19:09:07,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923994626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:07,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:07,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:09:07,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352472637] [2024-06-20 19:09:07,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:07,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:09:07,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:07,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:09:07,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:09:07,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:09:07,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 180 transitions, 1434 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:07,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:07,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:09:07,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:08,261 INFO L124 PetriNetUnfolderBase]: 400/778 cut-off events. [2024-06-20 19:09:08,261 INFO L125 PetriNetUnfolderBase]: For 37022/37022 co-relation queries the response was YES. [2024-06-20 19:09:08,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4057 conditions, 778 events. 400/778 cut-off events. For 37022/37022 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4093 event pairs, 59 based on Foata normal form. 1/777 useless extension candidates. Maximal degree in co-relation 3953. Up to 541 conditions per place. [2024-06-20 19:09:08,268 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 115 selfloop transitions, 75 changer transitions 0/193 dead transitions. [2024-06-20 19:09:08,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 193 transitions, 1898 flow [2024-06-20 19:09:08,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:09:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:09:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-20 19:09:08,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40175953079178883 [2024-06-20 19:09:08,270 INFO L175 Difference]: Start difference. First operand has 222 places, 180 transitions, 1434 flow. Second operand 11 states and 137 transitions. [2024-06-20 19:09:08,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 193 transitions, 1898 flow [2024-06-20 19:09:08,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 193 transitions, 1748 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-06-20 19:09:08,375 INFO L231 Difference]: Finished difference. Result has 227 places, 182 transitions, 1501 flow [2024-06-20 19:09:08,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1501, PETRI_PLACES=227, PETRI_TRANSITIONS=182} [2024-06-20 19:09:08,376 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 197 predicate places. [2024-06-20 19:09:08,376 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 182 transitions, 1501 flow [2024-06-20 19:09:08,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:08,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:08,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:08,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-20 19:09:08,377 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:09:08,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:08,377 INFO L85 PathProgramCache]: Analyzing trace with hash -238096238, now seen corresponding path program 4 times [2024-06-20 19:09:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:08,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272206088] [2024-06-20 19:09:08,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:08,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:09:14,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:14,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272206088] [2024-06-20 19:09:14,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272206088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:14,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:14,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:09:14,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162706530] [2024-06-20 19:09:14,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:14,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:09:14,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:14,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:09:14,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:09:14,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:09:14,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 182 transitions, 1501 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:14,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:14,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:09:14,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:14,927 INFO L124 PetriNetUnfolderBase]: 403/781 cut-off events. [2024-06-20 19:09:14,927 INFO L125 PetriNetUnfolderBase]: For 37660/37660 co-relation queries the response was YES. [2024-06-20 19:09:14,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4100 conditions, 781 events. 403/781 cut-off events. For 37660/37660 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4089 event pairs, 59 based on Foata normal form. 1/780 useless extension candidates. Maximal degree in co-relation 3995. Up to 546 conditions per place. [2024-06-20 19:09:14,935 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 126 selfloop transitions, 66 changer transitions 0/195 dead transitions. [2024-06-20 19:09:14,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 195 transitions, 1971 flow [2024-06-20 19:09:14,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:09:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:09:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-20 19:09:14,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507 [2024-06-20 19:09:14,937 INFO L175 Difference]: Start difference. First operand has 227 places, 182 transitions, 1501 flow. Second operand 11 states and 139 transitions. [2024-06-20 19:09:14,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 195 transitions, 1971 flow [2024-06-20 19:09:15,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 195 transitions, 1772 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-06-20 19:09:15,069 INFO L231 Difference]: Finished difference. Result has 229 places, 184 transitions, 1503 flow [2024-06-20 19:09:15,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1503, PETRI_PLACES=229, PETRI_TRANSITIONS=184} [2024-06-20 19:09:15,070 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-20 19:09:15,070 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 184 transitions, 1503 flow [2024-06-20 19:09:15,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:15,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:15,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:15,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-20 19:09:15,071 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:09:15,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:15,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1309610206, now seen corresponding path program 3 times [2024-06-20 19:09:15,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:15,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372095460] [2024-06-20 19:09:15,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:15,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:09:21,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:21,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372095460] [2024-06-20 19:09:21,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372095460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:21,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:21,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:09:21,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74043176] [2024-06-20 19:09:21,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:21,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:09:21,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:21,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:09:21,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:09:21,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:09:21,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 184 transitions, 1503 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:21,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:21,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:09:21,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:21,508 INFO L124 PetriNetUnfolderBase]: 407/791 cut-off events. [2024-06-20 19:09:21,508 INFO L125 PetriNetUnfolderBase]: For 41299/41301 co-relation queries the response was YES. [2024-06-20 19:09:21,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4130 conditions, 791 events. 407/791 cut-off events. For 41299/41301 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4151 event pairs, 53 based on Foata normal form. 4/794 useless extension candidates. Maximal degree in co-relation 4024. Up to 669 conditions per place. [2024-06-20 19:09:21,515 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 158 selfloop transitions, 37 changer transitions 0/198 dead transitions. [2024-06-20 19:09:21,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 198 transitions, 1951 flow [2024-06-20 19:09:21,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:09:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:09:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-20 19:09:21,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 19:09:21,517 INFO L175 Difference]: Start difference. First operand has 229 places, 184 transitions, 1503 flow. Second operand 11 states and 132 transitions. [2024-06-20 19:09:21,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 198 transitions, 1951 flow [2024-06-20 19:09:21,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 198 transitions, 1764 flow, removed 28 selfloop flow, removed 9 redundant places. [2024-06-20 19:09:21,658 INFO L231 Difference]: Finished difference. Result has 232 places, 186 transitions, 1431 flow [2024-06-20 19:09:21,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1431, PETRI_PLACES=232, PETRI_TRANSITIONS=186} [2024-06-20 19:09:21,665 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 202 predicate places. [2024-06-20 19:09:21,665 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 186 transitions, 1431 flow [2024-06-20 19:09:21,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:21,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:21,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:21,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-20 19:09:21,666 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:09:21,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash -906841656, now seen corresponding path program 4 times [2024-06-20 19:09:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:21,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293110992] [2024-06-20 19:09:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:21,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:09:28,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:28,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293110992] [2024-06-20 19:09:28,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293110992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:28,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:28,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:09:28,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204855370] [2024-06-20 19:09:28,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:28,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:09:28,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:28,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:09:28,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:09:28,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:09:28,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 186 transitions, 1431 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:28,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:28,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:09:28,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:28,519 INFO L124 PetriNetUnfolderBase]: 411/799 cut-off events. [2024-06-20 19:09:28,519 INFO L125 PetriNetUnfolderBase]: For 42116/42118 co-relation queries the response was YES. [2024-06-20 19:09:28,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4113 conditions, 799 events. 411/799 cut-off events. For 42116/42118 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4234 event pairs, 53 based on Foata normal form. 4/802 useless extension candidates. Maximal degree in co-relation 4005. Up to 677 conditions per place. [2024-06-20 19:09:28,525 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 157 selfloop transitions, 40 changer transitions 0/200 dead transitions. [2024-06-20 19:09:28,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 200 transitions, 1883 flow [2024-06-20 19:09:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:09:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:09:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-20 19:09:28,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-20 19:09:28,527 INFO L175 Difference]: Start difference. First operand has 232 places, 186 transitions, 1431 flow. Second operand 11 states and 130 transitions. [2024-06-20 19:09:28,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 200 transitions, 1883 flow [2024-06-20 19:09:28,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 200 transitions, 1734 flow, removed 16 selfloop flow, removed 11 redundant places. [2024-06-20 19:09:28,648 INFO L231 Difference]: Finished difference. Result has 233 places, 188 transitions, 1403 flow [2024-06-20 19:09:28,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1403, PETRI_PLACES=233, PETRI_TRANSITIONS=188} [2024-06-20 19:09:28,649 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2024-06-20 19:09:28,649 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 188 transitions, 1403 flow [2024-06-20 19:09:28,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:28,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:28,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:28,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-20 19:09:28,650 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:09:28,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash -621750466, now seen corresponding path program 5 times [2024-06-20 19:09:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:28,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041249078] [2024-06-20 19:09:28,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:28,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:09:36,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:36,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041249078] [2024-06-20 19:09:36,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041249078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:36,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:36,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:09:36,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346842864] [2024-06-20 19:09:36,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:36,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:09:36,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:36,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:09:36,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:09:36,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:09:36,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 188 transitions, 1403 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:36,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:36,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:09:36,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:36,676 INFO L124 PetriNetUnfolderBase]: 414/804 cut-off events. [2024-06-20 19:09:36,676 INFO L125 PetriNetUnfolderBase]: For 40508/40508 co-relation queries the response was YES. [2024-06-20 19:09:36,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4146 conditions, 804 events. 414/804 cut-off events. For 40508/40508 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4250 event pairs, 54 based on Foata normal form. 1/804 useless extension candidates. Maximal degree in co-relation 4036. Up to 737 conditions per place. [2024-06-20 19:09:36,683 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 180 selfloop transitions, 18 changer transitions 0/201 dead transitions. [2024-06-20 19:09:36,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 201 transitions, 1889 flow [2024-06-20 19:09:36,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:09:36,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:09:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-20 19:09:36,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-20 19:09:36,684 INFO L175 Difference]: Start difference. First operand has 233 places, 188 transitions, 1403 flow. Second operand 11 states and 124 transitions. [2024-06-20 19:09:36,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 201 transitions, 1889 flow [2024-06-20 19:09:36,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 201 transitions, 1763 flow, removed 15 selfloop flow, removed 10 redundant places. [2024-06-20 19:09:36,812 INFO L231 Difference]: Finished difference. Result has 234 places, 190 transitions, 1386 flow [2024-06-20 19:09:36,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1386, PETRI_PLACES=234, PETRI_TRANSITIONS=190} [2024-06-20 19:09:36,813 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2024-06-20 19:09:36,813 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 190 transitions, 1386 flow [2024-06-20 19:09:36,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:36,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:36,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:36,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-20 19:09:36,814 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:09:36,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash -514603170, now seen corresponding path program 6 times [2024-06-20 19:09:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:36,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444481917] [2024-06-20 19:09:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:36,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:09:42,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:42,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444481917] [2024-06-20 19:09:42,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444481917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:42,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:42,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:09:42,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152890405] [2024-06-20 19:09:42,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:42,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:09:42,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:42,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:09:42,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:09:42,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:09:42,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 190 transitions, 1386 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:42,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:42,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:09:42,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:42,844 INFO L124 PetriNetUnfolderBase]: 417/811 cut-off events. [2024-06-20 19:09:42,844 INFO L125 PetriNetUnfolderBase]: For 41771/41771 co-relation queries the response was YES. [2024-06-20 19:09:42,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 811 events. 417/811 cut-off events. For 41771/41771 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4320 event pairs, 59 based on Foata normal form. 1/810 useless extension candidates. Maximal degree in co-relation 4026. Up to 572 conditions per place. [2024-06-20 19:09:42,851 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 131 selfloop transitions, 69 changer transitions 0/203 dead transitions. [2024-06-20 19:09:42,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 203 transitions, 1880 flow [2024-06-20 19:09:42,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:09:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:09:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-20 19:09:42,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2024-06-20 19:09:42,852 INFO L175 Difference]: Start difference. First operand has 234 places, 190 transitions, 1386 flow. Second operand 11 states and 138 transitions. [2024-06-20 19:09:42,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 203 transitions, 1880 flow [2024-06-20 19:09:42,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 203 transitions, 1781 flow, removed 31 selfloop flow, removed 10 redundant places. [2024-06-20 19:09:43,002 INFO L231 Difference]: Finished difference. Result has 235 places, 192 transitions, 1502 flow [2024-06-20 19:09:43,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1502, PETRI_PLACES=235, PETRI_TRANSITIONS=192} [2024-06-20 19:09:43,003 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 205 predicate places. [2024-06-20 19:09:43,003 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 192 transitions, 1502 flow [2024-06-20 19:09:43,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:43,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:43,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:43,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-20 19:09:43,003 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:09:43,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash -611622766, now seen corresponding path program 7 times [2024-06-20 19:09:43,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:43,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770684150] [2024-06-20 19:09:43,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:43,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:48,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-20 19:09:48,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:48,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770684150] [2024-06-20 19:09:48,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770684150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:48,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:48,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:09:48,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075439530] [2024-06-20 19:09:48,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:48,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:09:48,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:48,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:09:48,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:09:48,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:09:48,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 192 transitions, 1502 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:48,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:48,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:09:48,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:49,270 INFO L124 PetriNetUnfolderBase]: 420/818 cut-off events. [2024-06-20 19:09:49,270 INFO L125 PetriNetUnfolderBase]: For 43248/43248 co-relation queries the response was YES. [2024-06-20 19:09:49,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4289 conditions, 818 events. 420/818 cut-off events. For 43248/43248 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4385 event pairs, 54 based on Foata normal form. 1/818 useless extension candidates. Maximal degree in co-relation 4180. Up to 731 conditions per place. [2024-06-20 19:09:49,276 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 180 selfloop transitions, 26 changer transitions 0/209 dead transitions. [2024-06-20 19:09:49,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 209 transitions, 2242 flow [2024-06-20 19:09:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:09:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:09:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2024-06-20 19:09:49,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-20 19:09:49,277 INFO L175 Difference]: Start difference. First operand has 235 places, 192 transitions, 1502 flow. Second operand 12 states and 138 transitions. [2024-06-20 19:09:49,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 209 transitions, 2242 flow [2024-06-20 19:09:49,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 209 transitions, 2043 flow, removed 32 selfloop flow, removed 9 redundant places. [2024-06-20 19:09:49,412 INFO L231 Difference]: Finished difference. Result has 238 places, 196 transitions, 1508 flow [2024-06-20 19:09:49,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1508, PETRI_PLACES=238, PETRI_TRANSITIONS=196} [2024-06-20 19:09:49,413 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2024-06-20 19:09:49,413 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 196 transitions, 1508 flow [2024-06-20 19:09:49,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:49,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:49,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:49,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-20 19:09:49,414 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:09:49,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:49,414 INFO L85 PathProgramCache]: Analyzing trace with hash 210200704, now seen corresponding path program 5 times [2024-06-20 19:09:49,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:49,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640630141] [2024-06-20 19:09:49,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:49,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:09:56,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:56,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640630141] [2024-06-20 19:09:56,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640630141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:56,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:56,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:09:56,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579837098] [2024-06-20 19:09:56,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:56,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:09:56,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:56,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:09:56,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:09:57,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:09:57,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 196 transitions, 1508 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:57,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:57,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:09:57,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:57,510 INFO L124 PetriNetUnfolderBase]: 436/854 cut-off events. [2024-06-20 19:09:57,510 INFO L125 PetriNetUnfolderBase]: For 70257/70257 co-relation queries the response was YES. [2024-06-20 19:09:57,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4440 conditions, 854 events. 436/854 cut-off events. For 70257/70257 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4598 event pairs, 58 based on Foata normal form. 10/863 useless extension candidates. Maximal degree in co-relation 4330. Up to 742 conditions per place. [2024-06-20 19:09:57,516 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 186 selfloop transitions, 17 changer transitions 6/212 dead transitions. [2024-06-20 19:09:57,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 212 transitions, 2060 flow [2024-06-20 19:09:57,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:09:57,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:09:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-20 19:09:57,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-20 19:09:57,517 INFO L175 Difference]: Start difference. First operand has 238 places, 196 transitions, 1508 flow. Second operand 11 states and 129 transitions. [2024-06-20 19:09:57,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 212 transitions, 2060 flow [2024-06-20 19:09:57,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 212 transitions, 1966 flow, removed 35 selfloop flow, removed 8 redundant places. [2024-06-20 19:09:57,664 INFO L231 Difference]: Finished difference. Result has 241 places, 194 transitions, 1462 flow [2024-06-20 19:09:57,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1462, PETRI_PLACES=241, PETRI_TRANSITIONS=194} [2024-06-20 19:09:57,664 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2024-06-20 19:09:57,664 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 194 transitions, 1462 flow [2024-06-20 19:09:57,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:57,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:57,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:57,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-20 19:09:57,665 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:09:57,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:57,665 INFO L85 PathProgramCache]: Analyzing trace with hash -66855906, now seen corresponding path program 8 times [2024-06-20 19:09:57,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:57,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051564702] [2024-06-20 19:09:57,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:57,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:10:03,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:03,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051564702] [2024-06-20 19:10:03,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051564702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:03,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:03,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:10:03,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616443647] [2024-06-20 19:10:03,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:03,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:10:03,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:03,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:10:03,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:10:03,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:10:03,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 194 transitions, 1462 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:03,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:03,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:10:03,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:03,699 INFO L124 PetriNetUnfolderBase]: 417/816 cut-off events. [2024-06-20 19:10:03,700 INFO L125 PetriNetUnfolderBase]: For 41487/41487 co-relation queries the response was YES. [2024-06-20 19:10:03,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4067 conditions, 816 events. 417/816 cut-off events. For 41487/41487 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4390 event pairs, 54 based on Foata normal form. 1/816 useless extension candidates. Maximal degree in co-relation 3955. Up to 742 conditions per place. [2024-06-20 19:10:03,708 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 184 selfloop transitions, 18 changer transitions 0/205 dead transitions. [2024-06-20 19:10:03,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 205 transitions, 1892 flow [2024-06-20 19:10:03,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:10:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:10:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-20 19:10:03,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36656891495601174 [2024-06-20 19:10:03,709 INFO L175 Difference]: Start difference. First operand has 241 places, 194 transitions, 1462 flow. Second operand 11 states and 125 transitions. [2024-06-20 19:10:03,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 205 transitions, 1892 flow [2024-06-20 19:10:03,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 205 transitions, 1766 flow, removed 47 selfloop flow, removed 10 redundant places. [2024-06-20 19:10:03,836 INFO L231 Difference]: Finished difference. Result has 241 places, 194 transitions, 1377 flow [2024-06-20 19:10:03,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1377, PETRI_PLACES=241, PETRI_TRANSITIONS=194} [2024-06-20 19:10:03,837 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2024-06-20 19:10:03,837 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 194 transitions, 1377 flow [2024-06-20 19:10:03,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:03,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:03,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:03,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-20 19:10:03,838 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:10:03,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:03,838 INFO L85 PathProgramCache]: Analyzing trace with hash 220320034, now seen corresponding path program 6 times [2024-06-20 19:10:03,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:03,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455835318] [2024-06-20 19:10:03,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:03,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:10:10,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:10,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455835318] [2024-06-20 19:10:10,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455835318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:10,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:10,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:10:10,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008674385] [2024-06-20 19:10:10,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:10,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:10:10,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:10,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:10:10,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:10:10,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:10:10,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 194 transitions, 1377 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:10,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:10,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:10:10,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:11,127 INFO L124 PetriNetUnfolderBase]: 421/824 cut-off events. [2024-06-20 19:10:11,127 INFO L125 PetriNetUnfolderBase]: For 43934/43934 co-relation queries the response was YES. [2024-06-20 19:10:11,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4019 conditions, 824 events. 421/824 cut-off events. For 43934/43934 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4434 event pairs, 56 based on Foata normal form. 2/825 useless extension candidates. Maximal degree in co-relation 3907. Up to 744 conditions per place. [2024-06-20 19:10:11,135 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 184 selfloop transitions, 21 changer transitions 0/208 dead transitions. [2024-06-20 19:10:11,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 208 transitions, 1847 flow [2024-06-20 19:10:11,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:10:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:10:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2024-06-20 19:10:11,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-20 19:10:11,136 INFO L175 Difference]: Start difference. First operand has 241 places, 194 transitions, 1377 flow. Second operand 12 states and 135 transitions. [2024-06-20 19:10:11,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 208 transitions, 1847 flow [2024-06-20 19:10:11,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 208 transitions, 1803 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-20 19:10:11,272 INFO L231 Difference]: Finished difference. Result has 243 places, 195 transitions, 1411 flow [2024-06-20 19:10:11,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1333, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1411, PETRI_PLACES=243, PETRI_TRANSITIONS=195} [2024-06-20 19:10:11,273 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 213 predicate places. [2024-06-20 19:10:11,273 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 195 transitions, 1411 flow [2024-06-20 19:10:11,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:11,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:11,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:11,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-20 19:10:11,274 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:10:11,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:11,274 INFO L85 PathProgramCache]: Analyzing trace with hash 220330264, now seen corresponding path program 7 times [2024-06-20 19:10:11,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:11,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31353137] [2024-06-20 19:10:11,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:11,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:18,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-20 19:10:18,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:18,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31353137] [2024-06-20 19:10:18,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31353137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:18,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:18,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:10:18,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926516581] [2024-06-20 19:10:18,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:18,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:10:18,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:18,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:10:18,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:10:18,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:10:18,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 195 transitions, 1411 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:18,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:18,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:10:18,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:18,699 INFO L124 PetriNetUnfolderBase]: 418/819 cut-off events. [2024-06-20 19:10:18,700 INFO L125 PetriNetUnfolderBase]: For 38662/38662 co-relation queries the response was YES. [2024-06-20 19:10:18,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3844 conditions, 819 events. 418/819 cut-off events. For 38662/38662 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4409 event pairs, 53 based on Foata normal form. 2/820 useless extension candidates. Maximal degree in co-relation 3731. Up to 719 conditions per place. [2024-06-20 19:10:18,707 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 183 selfloop transitions, 23 changer transitions 0/209 dead transitions. [2024-06-20 19:10:18,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 209 transitions, 1855 flow [2024-06-20 19:10:18,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:10:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:10:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2024-06-20 19:10:18,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-20 19:10:18,709 INFO L175 Difference]: Start difference. First operand has 243 places, 195 transitions, 1411 flow. Second operand 12 states and 135 transitions. [2024-06-20 19:10:18,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 209 transitions, 1855 flow [2024-06-20 19:10:18,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 209 transitions, 1787 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-20 19:10:18,829 INFO L231 Difference]: Finished difference. Result has 245 places, 195 transitions, 1393 flow [2024-06-20 19:10:18,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1393, PETRI_PLACES=245, PETRI_TRANSITIONS=195} [2024-06-20 19:10:18,829 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2024-06-20 19:10:18,829 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 195 transitions, 1393 flow [2024-06-20 19:10:18,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:18,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:18,830 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-20 19:10:18,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-20 19:10:18,830 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:10:18,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash -198566448, now seen corresponding path program 1 times [2024-06-20 19:10:18,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:18,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539569014] [2024-06-20 19:10:18,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:18,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:10:24,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:24,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539569014] [2024-06-20 19:10:24,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539569014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:24,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:24,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:10:24,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900854066] [2024-06-20 19:10:24,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:24,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:10:24,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:24,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:10:24,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:10:25,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:10:25,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 195 transitions, 1393 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:25,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:25,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:10:25,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:25,454 INFO L124 PetriNetUnfolderBase]: 422/828 cut-off events. [2024-06-20 19:10:25,455 INFO L125 PetriNetUnfolderBase]: For 39222/39222 co-relation queries the response was YES. [2024-06-20 19:10:25,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3848 conditions, 828 events. 422/828 cut-off events. For 39222/39222 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4493 event pairs, 34 based on Foata normal form. 2/829 useless extension candidates. Maximal degree in co-relation 3734. Up to 699 conditions per place. [2024-06-20 19:10:25,461 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 197 selfloop transitions, 17 changer transitions 0/217 dead transitions. [2024-06-20 19:10:25,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 217 transitions, 1883 flow [2024-06-20 19:10:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:10:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:10:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-20 19:10:25,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-20 19:10:25,463 INFO L175 Difference]: Start difference. First operand has 245 places, 195 transitions, 1393 flow. Second operand 11 states and 129 transitions. [2024-06-20 19:10:25,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 217 transitions, 1883 flow [2024-06-20 19:10:25,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 217 transitions, 1715 flow, removed 15 selfloop flow, removed 16 redundant places. [2024-06-20 19:10:25,595 INFO L231 Difference]: Finished difference. Result has 240 places, 196 transitions, 1275 flow [2024-06-20 19:10:25,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1275, PETRI_PLACES=240, PETRI_TRANSITIONS=196} [2024-06-20 19:10:25,596 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 210 predicate places. [2024-06-20 19:10:25,596 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 196 transitions, 1275 flow [2024-06-20 19:10:25,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:25,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:25,596 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-20 19:10:25,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-20 19:10:25,597 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:10:25,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:25,597 INFO L85 PathProgramCache]: Analyzing trace with hash 24112468, now seen corresponding path program 2 times [2024-06-20 19:10:25,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:25,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608125853] [2024-06-20 19:10:25,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:25,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:10:31,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:31,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608125853] [2024-06-20 19:10:31,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608125853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:31,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:31,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:10:31,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613928202] [2024-06-20 19:10:31,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:31,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:10:31,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:31,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:10:31,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:10:32,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:10:32,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 196 transitions, 1275 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:32,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:32,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:10:32,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:32,562 INFO L124 PetriNetUnfolderBase]: 433/847 cut-off events. [2024-06-20 19:10:32,563 INFO L125 PetriNetUnfolderBase]: For 46317/46317 co-relation queries the response was YES. [2024-06-20 19:10:32,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3926 conditions, 847 events. 433/847 cut-off events. For 46317/46317 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4583 event pairs, 50 based on Foata normal form. 2/848 useless extension candidates. Maximal degree in co-relation 3816. Up to 682 conditions per place. [2024-06-20 19:10:32,568 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 192 selfloop transitions, 24 changer transitions 0/219 dead transitions. [2024-06-20 19:10:32,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 219 transitions, 1947 flow [2024-06-20 19:10:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:10:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:10:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-20 19:10:32,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36950146627565983 [2024-06-20 19:10:32,570 INFO L175 Difference]: Start difference. First operand has 240 places, 196 transitions, 1275 flow. Second operand 11 states and 126 transitions. [2024-06-20 19:10:32,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 219 transitions, 1947 flow [2024-06-20 19:10:32,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 219 transitions, 1907 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-20 19:10:32,693 INFO L231 Difference]: Finished difference. Result has 242 places, 198 transitions, 1313 flow [2024-06-20 19:10:32,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1313, PETRI_PLACES=242, PETRI_TRANSITIONS=198} [2024-06-20 19:10:32,693 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places. [2024-06-20 19:10:32,693 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 198 transitions, 1313 flow [2024-06-20 19:10:32,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:32,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:32,694 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-20 19:10:32,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-20 19:10:32,694 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:10:32,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1742482528, now seen corresponding path program 3 times [2024-06-20 19:10:32,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:32,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67070865] [2024-06-20 19:10:32,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:10:38,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:38,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67070865] [2024-06-20 19:10:38,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67070865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:38,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:38,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:10:38,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81383566] [2024-06-20 19:10:38,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:38,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:10:38,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:38,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:10:38,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:10:38,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-20 19:10:38,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 198 transitions, 1313 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:38,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:38,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-20 19:10:38,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:38,661 INFO L124 PetriNetUnfolderBase]: 437/855 cut-off events. [2024-06-20 19:10:38,661 INFO L125 PetriNetUnfolderBase]: For 48111/48111 co-relation queries the response was YES. [2024-06-20 19:10:38,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 855 events. 437/855 cut-off events. For 48111/48111 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4628 event pairs, 52 based on Foata normal form. 2/856 useless extension candidates. Maximal degree in co-relation 3882. Up to 718 conditions per place. [2024-06-20 19:10:38,668 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 191 selfloop transitions, 24 changer transitions 0/219 dead transitions. [2024-06-20 19:10:38,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 219 transitions, 1973 flow [2024-06-20 19:10:38,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2024-06-20 19:10:38,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47419354838709676 [2024-06-20 19:10:38,670 INFO L175 Difference]: Start difference. First operand has 242 places, 198 transitions, 1313 flow. Second operand 10 states and 147 transitions. [2024-06-20 19:10:38,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 219 transitions, 1973 flow [2024-06-20 19:10:38,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 219 transitions, 1930 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-20 19:10:38,800 INFO L231 Difference]: Finished difference. Result has 245 places, 199 transitions, 1336 flow [2024-06-20 19:10:38,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1336, PETRI_PLACES=245, PETRI_TRANSITIONS=199} [2024-06-20 19:10:38,801 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2024-06-20 19:10:38,801 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 199 transitions, 1336 flow [2024-06-20 19:10:38,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:38,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:38,801 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-20 19:10:38,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-20 19:10:38,801 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:10:38,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1748196448, now seen corresponding path program 4 times [2024-06-20 19:10:38,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:38,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557313315] [2024-06-20 19:10:38,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:38,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:45,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-20 19:10:45,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:45,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557313315] [2024-06-20 19:10:45,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557313315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:45,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:45,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:10:45,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576042449] [2024-06-20 19:10:45,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:45,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:10:45,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:45,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:10:45,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:10:45,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:10:45,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 199 transitions, 1336 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:45,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:45,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:10:45,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:45,836 INFO L124 PetriNetUnfolderBase]: 441/863 cut-off events. [2024-06-20 19:10:45,837 INFO L125 PetriNetUnfolderBase]: For 49241/49241 co-relation queries the response was YES. [2024-06-20 19:10:45,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4062 conditions, 863 events. 441/863 cut-off events. For 49241/49241 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4681 event pairs, 58 based on Foata normal form. 2/864 useless extension candidates. Maximal degree in co-relation 3950. Up to 763 conditions per place. [2024-06-20 19:10:45,844 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 189 selfloop transitions, 25 changer transitions 0/217 dead transitions. [2024-06-20 19:10:45,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 217 transitions, 1822 flow [2024-06-20 19:10:45,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:10:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:10:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-20 19:10:45,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-20 19:10:45,845 INFO L175 Difference]: Start difference. First operand has 245 places, 199 transitions, 1336 flow. Second operand 11 states and 130 transitions. [2024-06-20 19:10:45,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 217 transitions, 1822 flow [2024-06-20 19:10:45,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 217 transitions, 1763 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 19:10:45,990 INFO L231 Difference]: Finished difference. Result has 248 places, 200 transitions, 1347 flow [2024-06-20 19:10:45,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1347, PETRI_PLACES=248, PETRI_TRANSITIONS=200} [2024-06-20 19:10:45,990 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2024-06-20 19:10:45,990 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 200 transitions, 1347 flow [2024-06-20 19:10:45,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:45,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:45,991 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-20 19:10:45,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-20 19:10:45,991 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:10:45,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:45,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1742626678, now seen corresponding path program 5 times [2024-06-20 19:10:45,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:45,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057090433] [2024-06-20 19:10:45,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:45,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:10:53,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:53,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057090433] [2024-06-20 19:10:53,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057090433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:53,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:53,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:10:53,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091243436] [2024-06-20 19:10:53,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:53,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:10:53,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:53,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:10:53,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:10:53,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:10:53,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 200 transitions, 1347 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:53,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:53,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:10:53,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:53,870 INFO L124 PetriNetUnfolderBase]: 438/858 cut-off events. [2024-06-20 19:10:53,871 INFO L125 PetriNetUnfolderBase]: For 43118/43118 co-relation queries the response was YES. [2024-06-20 19:10:53,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3866 conditions, 858 events. 438/858 cut-off events. For 43118/43118 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4679 event pairs, 55 based on Foata normal form. 2/859 useless extension candidates. Maximal degree in co-relation 3752. Up to 744 conditions per place. [2024-06-20 19:10:53,878 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 189 selfloop transitions, 26 changer transitions 0/218 dead transitions. [2024-06-20 19:10:53,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 218 transitions, 1823 flow [2024-06-20 19:10:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:10:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:10:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-20 19:10:53,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 19:10:53,880 INFO L175 Difference]: Start difference. First operand has 248 places, 200 transitions, 1347 flow. Second operand 11 states and 132 transitions. [2024-06-20 19:10:53,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 218 transitions, 1823 flow [2024-06-20 19:10:54,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 218 transitions, 1759 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-20 19:10:54,003 INFO L231 Difference]: Finished difference. Result has 250 places, 200 transitions, 1339 flow [2024-06-20 19:10:54,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1339, PETRI_PLACES=250, PETRI_TRANSITIONS=200} [2024-06-20 19:10:54,004 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 220 predicate places. [2024-06-20 19:10:54,004 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 200 transitions, 1339 flow [2024-06-20 19:10:54,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:54,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:54,004 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-20 19:10:54,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-20 19:10:54,005 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:10:54,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:54,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1748204384, now seen corresponding path program 1 times [2024-06-20 19:10:54,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:54,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792906173] [2024-06-20 19:10:54,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:54,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:10:59,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:59,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792906173] [2024-06-20 19:10:59,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792906173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:59,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:59,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:10:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310371788] [2024-06-20 19:10:59,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:59,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:10:59,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:59,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:10:59,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:10:59,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:10:59,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 200 transitions, 1339 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:59,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:59,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:10:59,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:59,970 INFO L124 PetriNetUnfolderBase]: 450/886 cut-off events. [2024-06-20 19:10:59,971 INFO L125 PetriNetUnfolderBase]: For 65767/65767 co-relation queries the response was YES. [2024-06-20 19:10:59,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4049 conditions, 886 events. 450/886 cut-off events. For 65767/65767 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4868 event pairs, 61 based on Foata normal form. 8/893 useless extension candidates. Maximal degree in co-relation 3934. Up to 757 conditions per place. [2024-06-20 19:10:59,978 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 186 selfloop transitions, 23 changer transitions 9/221 dead transitions. [2024-06-20 19:10:59,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 221 transitions, 1895 flow [2024-06-20 19:10:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:10:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:10:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2024-06-20 19:10:59,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2024-06-20 19:10:59,980 INFO L175 Difference]: Start difference. First operand has 250 places, 200 transitions, 1339 flow. Second operand 12 states and 142 transitions. [2024-06-20 19:10:59,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 221 transitions, 1895 flow [2024-06-20 19:11:00,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 221 transitions, 1836 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-20 19:11:00,140 INFO L231 Difference]: Finished difference. Result has 252 places, 197 transitions, 1313 flow [2024-06-20 19:11:00,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1313, PETRI_PLACES=252, PETRI_TRANSITIONS=197} [2024-06-20 19:11:00,141 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2024-06-20 19:11:00,141 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 197 transitions, 1313 flow [2024-06-20 19:11:00,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:00,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:00,142 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-20 19:11:00,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-20 19:11:00,142 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-20 19:11:00,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1852511712, now seen corresponding path program 6 times [2024-06-20 19:11:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:00,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103891399] [2024-06-20 19:11:00,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:00,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:05,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:05,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103891399] [2024-06-20 19:11:05,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103891399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:05,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:05,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:11:05,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902459043] [2024-06-20 19:11:05,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:05,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:11:05,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:05,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:11:05,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:11:05,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:11:05,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 197 transitions, 1313 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:05,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:05,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:11:05,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:05,958 INFO L124 PetriNetUnfolderBase]: 450/884 cut-off events. [2024-06-20 19:11:05,959 INFO L125 PetriNetUnfolderBase]: For 52725/52725 co-relation queries the response was YES. [2024-06-20 19:11:05,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4146 conditions, 884 events. 450/884 cut-off events. For 52725/52725 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4848 event pairs, 58 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 4030. Up to 756 conditions per place. [2024-06-20 19:11:05,967 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 186 selfloop transitions, 30 changer transitions 0/219 dead transitions. [2024-06-20 19:11:05,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 219 transitions, 2013 flow [2024-06-20 19:11:05,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:11:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:11:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-20 19:11:05,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-20 19:11:05,969 INFO L175 Difference]: Start difference. First operand has 252 places, 197 transitions, 1313 flow. Second operand 11 states and 136 transitions. [2024-06-20 19:11:05,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 219 transitions, 2013 flow [2024-06-20 19:11:06,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 219 transitions, 1955 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-20 19:11:06,163 INFO L231 Difference]: Finished difference. Result has 249 places, 203 transitions, 1381 flow [2024-06-20 19:11:06,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1381, PETRI_PLACES=249, PETRI_TRANSITIONS=203} [2024-06-20 19:11:06,163 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 219 predicate places. [2024-06-20 19:11:06,163 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 203 transitions, 1381 flow [2024-06-20 19:11:06,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:06,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:06,164 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-20 19:11:06,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-20 19:11:06,164 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-20 19:11:06,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:06,165 INFO L85 PathProgramCache]: Analyzing trace with hash -304381988, now seen corresponding path program 7 times [2024-06-20 19:11:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:06,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445112164] [2024-06-20 19:11:06,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:06,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445112164] [2024-06-20 19:11:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445112164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:11,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:11,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:11:11,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050619848] [2024-06-20 19:11:11,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:11,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:11:11,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:11,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:11:11,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:11:12,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:11:12,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 203 transitions, 1381 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:12,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:12,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:11:12,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:12,598 INFO L124 PetriNetUnfolderBase]: 447/878 cut-off events. [2024-06-20 19:11:12,599 INFO L125 PetriNetUnfolderBase]: For 44312/44312 co-relation queries the response was YES. [2024-06-20 19:11:12,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3952 conditions, 878 events. 447/878 cut-off events. For 44312/44312 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4822 event pairs, 61 based on Foata normal form. 2/879 useless extension candidates. Maximal degree in co-relation 3837. Up to 734 conditions per place. [2024-06-20 19:11:12,607 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 176 selfloop transitions, 39 changer transitions 0/218 dead transitions. [2024-06-20 19:11:12,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 218 transitions, 1849 flow [2024-06-20 19:11:12,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:11:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:11:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-20 19:11:12,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-20 19:11:12,608 INFO L175 Difference]: Start difference. First operand has 249 places, 203 transitions, 1381 flow. Second operand 11 states and 134 transitions. [2024-06-20 19:11:12,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 218 transitions, 1849 flow [2024-06-20 19:11:12,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 218 transitions, 1806 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-20 19:11:12,747 INFO L231 Difference]: Finished difference. Result has 256 places, 203 transitions, 1420 flow [2024-06-20 19:11:12,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1420, PETRI_PLACES=256, PETRI_TRANSITIONS=203} [2024-06-20 19:11:12,748 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2024-06-20 19:11:12,748 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 203 transitions, 1420 flow [2024-06-20 19:11:12,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:12,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:12,748 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-20 19:11:12,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-20 19:11:12,749 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-20 19:11:12,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash -851249690, now seen corresponding path program 8 times [2024-06-20 19:11:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:12,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243246385] [2024-06-20 19:11:12,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:12,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:19,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:19,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243246385] [2024-06-20 19:11:19,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243246385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:19,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:19,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:11:19,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989355760] [2024-06-20 19:11:19,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:19,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:11:19,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:19,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:11:19,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:11:19,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:11:19,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 203 transitions, 1420 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:19,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:19,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:11:19,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:20,173 INFO L124 PetriNetUnfolderBase]: 458/897 cut-off events. [2024-06-20 19:11:20,173 INFO L125 PetriNetUnfolderBase]: For 52861/52861 co-relation queries the response was YES. [2024-06-20 19:11:20,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 897 events. 458/897 cut-off events. For 52861/52861 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4942 event pairs, 62 based on Foata normal form. 2/898 useless extension candidates. Maximal degree in co-relation 4157. Up to 720 conditions per place. [2024-06-20 19:11:20,179 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 182 selfloop transitions, 38 changer transitions 0/223 dead transitions. [2024-06-20 19:11:20,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 223 transitions, 2110 flow [2024-06-20 19:11:20,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:11:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:11:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-20 19:11:20,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41055718475073316 [2024-06-20 19:11:20,181 INFO L175 Difference]: Start difference. First operand has 256 places, 203 transitions, 1420 flow. Second operand 11 states and 140 transitions. [2024-06-20 19:11:20,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 223 transitions, 2110 flow [2024-06-20 19:11:20,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 223 transitions, 2029 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-20 19:11:20,345 INFO L231 Difference]: Finished difference. Result has 257 places, 205 transitions, 1453 flow [2024-06-20 19:11:20,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1453, PETRI_PLACES=257, PETRI_TRANSITIONS=205} [2024-06-20 19:11:20,346 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 227 predicate places. [2024-06-20 19:11:20,346 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 205 transitions, 1453 flow [2024-06-20 19:11:20,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:20,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:20,346 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-20 19:11:20,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-20 19:11:20,347 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-20 19:11:20,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:20,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1837604828, now seen corresponding path program 9 times [2024-06-20 19:11:20,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:20,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98003604] [2024-06-20 19:11:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:20,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:25,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:25,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98003604] [2024-06-20 19:11:25,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98003604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:25,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:25,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:11:25,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074792405] [2024-06-20 19:11:25,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:25,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:11:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:25,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:11:25,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:11:25,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:11:25,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 205 transitions, 1453 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:25,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:25,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:11:25,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:26,349 INFO L124 PetriNetUnfolderBase]: 469/919 cut-off events. [2024-06-20 19:11:26,350 INFO L125 PetriNetUnfolderBase]: For 62101/62101 co-relation queries the response was YES. [2024-06-20 19:11:26,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4600 conditions, 919 events. 469/919 cut-off events. For 62101/62101 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5082 event pairs, 63 based on Foata normal form. 2/920 useless extension candidates. Maximal degree in co-relation 4482. Up to 755 conditions per place. [2024-06-20 19:11:26,360 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 189 selfloop transitions, 32 changer transitions 0/224 dead transitions. [2024-06-20 19:11:26,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 224 transitions, 2147 flow [2024-06-20 19:11:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:11:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:11:26,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-20 19:11:26,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-20 19:11:26,363 INFO L175 Difference]: Start difference. First operand has 257 places, 205 transitions, 1453 flow. Second operand 11 states and 136 transitions. [2024-06-20 19:11:26,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 224 transitions, 2147 flow [2024-06-20 19:11:26,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 224 transitions, 2070 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-20 19:11:26,615 INFO L231 Difference]: Finished difference. Result has 260 places, 207 transitions, 1482 flow [2024-06-20 19:11:26,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1482, PETRI_PLACES=260, PETRI_TRANSITIONS=207} [2024-06-20 19:11:26,616 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 230 predicate places. [2024-06-20 19:11:26,616 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 207 transitions, 1482 flow [2024-06-20 19:11:26,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:26,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:26,616 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-20 19:11:26,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-20 19:11:26,616 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-20 19:11:26,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash 413397728, now seen corresponding path program 10 times [2024-06-20 19:11:26,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:26,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398910012] [2024-06-20 19:11:26,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:26,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:32,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:32,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398910012] [2024-06-20 19:11:32,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398910012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:32,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:32,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:11:32,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729731502] [2024-06-20 19:11:32,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:32,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:11:32,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:32,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:11:32,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:11:32,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:11:32,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 207 transitions, 1482 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:32,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:32,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:11:32,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:33,603 INFO L124 PetriNetUnfolderBase]: 473/929 cut-off events. [2024-06-20 19:11:33,603 INFO L125 PetriNetUnfolderBase]: For 63464/63464 co-relation queries the response was YES. [2024-06-20 19:11:33,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4663 conditions, 929 events. 473/929 cut-off events. For 63464/63464 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5189 event pairs, 65 based on Foata normal form. 2/930 useless extension candidates. Maximal degree in co-relation 4544. Up to 801 conditions per place. [2024-06-20 19:11:33,610 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 191 selfloop transitions, 30 changer transitions 0/224 dead transitions. [2024-06-20 19:11:33,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 224 transitions, 2152 flow [2024-06-20 19:11:33,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:11:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:11:33,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-20 19:11:33,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-20 19:11:33,613 INFO L175 Difference]: Start difference. First operand has 260 places, 207 transitions, 1482 flow. Second operand 11 states and 136 transitions. [2024-06-20 19:11:33,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 224 transitions, 2152 flow [2024-06-20 19:11:33,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 224 transitions, 2091 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-20 19:11:33,798 INFO L231 Difference]: Finished difference. Result has 264 places, 208 transitions, 1497 flow [2024-06-20 19:11:33,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1497, PETRI_PLACES=264, PETRI_TRANSITIONS=208} [2024-06-20 19:11:33,799 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 234 predicate places. [2024-06-20 19:11:33,799 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 208 transitions, 1497 flow [2024-06-20 19:11:33,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:33,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:33,799 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-20 19:11:33,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-20 19:11:33,800 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-20 19:11:33,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1162661872, now seen corresponding path program 11 times [2024-06-20 19:11:33,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:33,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678461985] [2024-06-20 19:11:33,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:33,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:39,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:39,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678461985] [2024-06-20 19:11:39,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678461985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:39,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:39,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:11:39,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615892891] [2024-06-20 19:11:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:39,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:11:39,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:39,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:11:39,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:11:40,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:11:40,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 208 transitions, 1497 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:40,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:40,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:11:40,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:40,394 INFO L124 PetriNetUnfolderBase]: 470/924 cut-off events. [2024-06-20 19:11:40,394 INFO L125 PetriNetUnfolderBase]: For 56637/56637 co-relation queries the response was YES. [2024-06-20 19:11:40,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4473 conditions, 924 events. 470/924 cut-off events. For 56637/56637 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5160 event pairs, 66 based on Foata normal form. 2/925 useless extension candidates. Maximal degree in co-relation 4352. Up to 813 conditions per place. [2024-06-20 19:11:40,403 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 190 selfloop transitions, 29 changer transitions 0/222 dead transitions. [2024-06-20 19:11:40,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 222 transitions, 1969 flow [2024-06-20 19:11:40,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:11:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:11:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-20 19:11:40,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-20 19:11:40,405 INFO L175 Difference]: Start difference. First operand has 264 places, 208 transitions, 1497 flow. Second operand 11 states and 133 transitions. [2024-06-20 19:11:40,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 222 transitions, 1969 flow [2024-06-20 19:11:40,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 222 transitions, 1892 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-20 19:11:40,599 INFO L231 Difference]: Finished difference. Result has 266 places, 208 transitions, 1482 flow [2024-06-20 19:11:40,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1482, PETRI_PLACES=266, PETRI_TRANSITIONS=208} [2024-06-20 19:11:40,600 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 236 predicate places. [2024-06-20 19:11:40,600 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 208 transitions, 1482 flow [2024-06-20 19:11:40,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:40,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:40,600 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-20 19:11:40,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-20 19:11:40,601 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-20 19:11:40,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:40,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1310478862, now seen corresponding path program 12 times [2024-06-20 19:11:40,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:40,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380077155] [2024-06-20 19:11:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:46,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:46,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380077155] [2024-06-20 19:11:46,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380077155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:46,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:46,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:11:46,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266351179] [2024-06-20 19:11:46,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:46,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:11:46,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:46,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:11:46,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:11:46,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:11:46,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 208 transitions, 1482 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-20 19:11:46,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:46,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:11:46,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:46,686 INFO L124 PetriNetUnfolderBase]: 474/932 cut-off events. [2024-06-20 19:11:46,687 INFO L125 PetriNetUnfolderBase]: For 57803/57803 co-relation queries the response was YES. [2024-06-20 19:11:46,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4502 conditions, 932 events. 474/932 cut-off events. For 57803/57803 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5204 event pairs, 62 based on Foata normal form. 2/933 useless extension candidates. Maximal degree in co-relation 4380. Up to 694 conditions per place. [2024-06-20 19:11:46,698 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 188 selfloop transitions, 36 changer transitions 0/227 dead transitions. [2024-06-20 19:11:46,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 227 transitions, 2172 flow [2024-06-20 19:11:46,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:11:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:11:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-20 19:11:46,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4340175953079179 [2024-06-20 19:11:46,699 INFO L175 Difference]: Start difference. First operand has 266 places, 208 transitions, 1482 flow. Second operand 11 states and 148 transitions. [2024-06-20 19:11:46,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 227 transitions, 2172 flow [2024-06-20 19:11:46,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 227 transitions, 2111 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-20 19:11:46,922 INFO L231 Difference]: Finished difference. Result has 267 places, 209 transitions, 1517 flow [2024-06-20 19:11:46,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1517, PETRI_PLACES=267, PETRI_TRANSITIONS=209} [2024-06-20 19:11:46,923 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 237 predicate places. [2024-06-20 19:11:46,923 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 209 transitions, 1517 flow [2024-06-20 19:11:46,923 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-20 19:11:46,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:46,924 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-20 19:11:46,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-20 19:11:46,924 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-20 19:11:46,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:46,924 INFO L85 PathProgramCache]: Analyzing trace with hash -103292738, now seen corresponding path program 13 times [2024-06-20 19:11:46,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:46,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797573484] [2024-06-20 19:11:46,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:51,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-20 19:11:51,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:51,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797573484] [2024-06-20 19:11:51,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797573484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:51,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:51,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:11:51,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495374051] [2024-06-20 19:11:51,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:51,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:11:51,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:51,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:11:51,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:11:52,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:11:52,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 209 transitions, 1517 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:52,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:52,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:11:52,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:52,430 INFO L124 PetriNetUnfolderBase]: 481/945 cut-off events. [2024-06-20 19:11:52,430 INFO L125 PetriNetUnfolderBase]: For 59303/59303 co-relation queries the response was YES. [2024-06-20 19:11:52,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4639 conditions, 945 events. 481/945 cut-off events. For 59303/59303 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5302 event pairs, 68 based on Foata normal form. 2/946 useless extension candidates. Maximal degree in co-relation 4516. Up to 833 conditions per place. [2024-06-20 19:11:52,440 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 189 selfloop transitions, 34 changer transitions 0/226 dead transitions. [2024-06-20 19:11:52,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 226 transitions, 2037 flow [2024-06-20 19:11:52,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:11:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:11:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-20 19:11:52,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3841642228739003 [2024-06-20 19:11:52,442 INFO L175 Difference]: Start difference. First operand has 267 places, 209 transitions, 1517 flow. Second operand 11 states and 131 transitions. [2024-06-20 19:11:52,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 226 transitions, 2037 flow [2024-06-20 19:11:52,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 226 transitions, 1945 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-20 19:11:52,651 INFO L231 Difference]: Finished difference. Result has 269 places, 212 transitions, 1539 flow [2024-06-20 19:11:52,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1431, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1539, PETRI_PLACES=269, PETRI_TRANSITIONS=212} [2024-06-20 19:11:52,651 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 239 predicate places. [2024-06-20 19:11:52,652 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 212 transitions, 1539 flow [2024-06-20 19:11:52,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:52,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:52,652 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-20 19:11:52,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-20 19:11:52,652 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-20 19:11:52,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash -110442578, now seen corresponding path program 14 times [2024-06-20 19:11:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:52,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86146832] [2024-06-20 19:11:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:58,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:58,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86146832] [2024-06-20 19:11:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86146832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:58,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:58,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:11:58,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7348707] [2024-06-20 19:11:58,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:58,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:11:58,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:58,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:11:58,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:11:58,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:58,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 212 transitions, 1539 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:58,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:58,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:58,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:59,098 INFO L124 PetriNetUnfolderBase]: 485/953 cut-off events. [2024-06-20 19:11:59,099 INFO L125 PetriNetUnfolderBase]: For 60417/60417 co-relation queries the response was YES. [2024-06-20 19:11:59,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4644 conditions, 953 events. 485/953 cut-off events. For 60417/60417 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5357 event pairs, 70 based on Foata normal form. 2/954 useless extension candidates. Maximal degree in co-relation 4520. Up to 841 conditions per place. [2024-06-20 19:11:59,108 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 192 selfloop transitions, 32 changer transitions 0/227 dead transitions. [2024-06-20 19:11:59,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 227 transitions, 2037 flow [2024-06-20 19:11:59,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:11:59,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:11:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-20 19:11:59,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:11:59,109 INFO L175 Difference]: Start difference. First operand has 269 places, 212 transitions, 1539 flow. Second operand 11 states and 121 transitions. [2024-06-20 19:11:59,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 227 transitions, 2037 flow [2024-06-20 19:11:59,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 227 transitions, 1963 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-20 19:11:59,322 INFO L231 Difference]: Finished difference. Result has 272 places, 213 transitions, 1551 flow [2024-06-20 19:11:59,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1551, PETRI_PLACES=272, PETRI_TRANSITIONS=213} [2024-06-20 19:11:59,322 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 242 predicate places. [2024-06-20 19:11:59,322 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 213 transitions, 1551 flow [2024-06-20 19:11:59,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:59,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:59,323 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-20 19:11:59,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-20 19:11:59,323 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-20 19:11:59,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:59,323 INFO L85 PathProgramCache]: Analyzing trace with hash -110649968, now seen corresponding path program 15 times [2024-06-20 19:11:59,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:59,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148311322] [2024-06-20 19:11:59,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:59,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:04,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-20 19:12:04,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:04,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148311322] [2024-06-20 19:12:04,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148311322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:04,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:04,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:12:04,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084704011] [2024-06-20 19:12:04,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:04,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:12:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:04,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:12:04,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:12:04,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:12:04,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 213 transitions, 1551 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:04,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:04,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:12:04,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:05,160 INFO L124 PetriNetUnfolderBase]: 482/952 cut-off events. [2024-06-20 19:12:05,160 INFO L125 PetriNetUnfolderBase]: For 52803/52803 co-relation queries the response was YES. [2024-06-20 19:12:05,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4437 conditions, 952 events. 482/952 cut-off events. For 52803/52803 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5361 event pairs, 69 based on Foata normal form. 2/953 useless extension candidates. Maximal degree in co-relation 4312. Up to 816 conditions per place. [2024-06-20 19:12:05,170 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 191 selfloop transitions, 34 changer transitions 0/228 dead transitions. [2024-06-20 19:12:05,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 228 transitions, 2037 flow [2024-06-20 19:12:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:12:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:12:05,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-20 19:12:05,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-20 19:12:05,171 INFO L175 Difference]: Start difference. First operand has 272 places, 213 transitions, 1551 flow. Second operand 11 states and 133 transitions. [2024-06-20 19:12:05,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 228 transitions, 2037 flow [2024-06-20 19:12:05,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 228 transitions, 1936 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-20 19:12:05,374 INFO L231 Difference]: Finished difference. Result has 273 places, 213 transitions, 1522 flow [2024-06-20 19:12:05,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1522, PETRI_PLACES=273, PETRI_TRANSITIONS=213} [2024-06-20 19:12:05,388 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 243 predicate places. [2024-06-20 19:12:05,389 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 213 transitions, 1522 flow [2024-06-20 19:12:05,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:05,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:05,389 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-20 19:12:05,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-20 19:12:05,389 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-20 19:12:05,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:05,390 INFO L85 PathProgramCache]: Analyzing trace with hash -103016032, now seen corresponding path program 2 times [2024-06-20 19:12:05,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:05,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511638428] [2024-06-20 19:12:05,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:05,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:12,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-20 19:12:12,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:12,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511638428] [2024-06-20 19:12:12,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511638428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:12,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:12,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:12:12,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293831754] [2024-06-20 19:12:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:12,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:12:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:12,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:12:12,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:12:12,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:12:12,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 213 transitions, 1522 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:12,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:12,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:12:12,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:12,783 INFO L124 PetriNetUnfolderBase]: 512/1017 cut-off events. [2024-06-20 19:12:12,783 INFO L125 PetriNetUnfolderBase]: For 104110/104110 co-relation queries the response was YES. [2024-06-20 19:12:12,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5575 conditions, 1017 events. 512/1017 cut-off events. For 104110/104110 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5790 event pairs, 83 based on Foata normal form. 6/1022 useless extension candidates. Maximal degree in co-relation 5449. Up to 775 conditions per place. [2024-06-20 19:12:12,793 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 178 selfloop transitions, 49 changer transitions 6/236 dead transitions. [2024-06-20 19:12:12,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 236 transitions, 2336 flow [2024-06-20 19:12:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:12:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:12:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2024-06-20 19:12:12,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-20 19:12:12,794 INFO L175 Difference]: Start difference. First operand has 273 places, 213 transitions, 1522 flow. Second operand 12 states and 148 transitions. [2024-06-20 19:12:12,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 236 transitions, 2336 flow [2024-06-20 19:12:13,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 236 transitions, 2233 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-20 19:12:13,184 INFO L231 Difference]: Finished difference. Result has 274 places, 211 transitions, 1508 flow [2024-06-20 19:12:13,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1508, PETRI_PLACES=274, PETRI_TRANSITIONS=211} [2024-06-20 19:12:13,184 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 244 predicate places. [2024-06-20 19:12:13,184 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 211 transitions, 1508 flow [2024-06-20 19:12:13,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:13,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:13,185 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-20 19:12:13,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-20 19:12:13,185 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-20 19:12:13,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:13,186 INFO L85 PathProgramCache]: Analyzing trace with hash 214100770, now seen corresponding path program 3 times [2024-06-20 19:12:13,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:13,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073027308] [2024-06-20 19:12:13,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:13,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:18,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:18,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073027308] [2024-06-20 19:12:18,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073027308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:18,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:18,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:12:18,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474724995] [2024-06-20 19:12:18,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:18,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:12:18,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:18,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:12:18,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:12:19,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:12:19,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 211 transitions, 1508 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:19,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:19,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:12:19,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:19,775 INFO L124 PetriNetUnfolderBase]: 510/1012 cut-off events. [2024-06-20 19:12:19,775 INFO L125 PetriNetUnfolderBase]: For 118480/118480 co-relation queries the response was YES. [2024-06-20 19:12:19,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5582 conditions, 1012 events. 510/1012 cut-off events. For 118480/118480 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5728 event pairs, 85 based on Foata normal form. 8/1019 useless extension candidates. Maximal degree in co-relation 5456. Up to 853 conditions per place. [2024-06-20 19:12:19,786 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 184 selfloop transitions, 35 changer transitions 8/230 dead transitions. [2024-06-20 19:12:19,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 230 transitions, 2070 flow [2024-06-20 19:12:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-20 19:12:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-20 19:12:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 155 transitions. [2024-06-20 19:12:19,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2024-06-20 19:12:19,787 INFO L175 Difference]: Start difference. First operand has 274 places, 211 transitions, 1508 flow. Second operand 13 states and 155 transitions. [2024-06-20 19:12:19,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 230 transitions, 2070 flow [2024-06-20 19:12:20,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 230 transitions, 1972 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-20 19:12:20,110 INFO L231 Difference]: Finished difference. Result has 274 places, 207 transitions, 1455 flow [2024-06-20 19:12:20,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1455, PETRI_PLACES=274, PETRI_TRANSITIONS=207} [2024-06-20 19:12:20,111 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 244 predicate places. [2024-06-20 19:12:20,111 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 207 transitions, 1455 flow [2024-06-20 19:12:20,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:20,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:20,111 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-20 19:12:20,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-20 19:12:20,112 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-20 19:12:20,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:20,112 INFO L85 PathProgramCache]: Analyzing trace with hash 206691460, now seen corresponding path program 4 times [2024-06-20 19:12:20,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:20,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741097952] [2024-06-20 19:12:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:20,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:25,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:25,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741097952] [2024-06-20 19:12:25,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741097952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:25,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:25,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:12:25,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184741946] [2024-06-20 19:12:25,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:25,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:12:25,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:25,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:12:25,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:12:25,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:12:25,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 207 transitions, 1455 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:25,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:25,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:12:25,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:26,246 INFO L124 PetriNetUnfolderBase]: 507/1005 cut-off events. [2024-06-20 19:12:26,247 INFO L125 PetriNetUnfolderBase]: For 114883/114883 co-relation queries the response was YES. [2024-06-20 19:12:26,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5523 conditions, 1005 events. 507/1005 cut-off events. For 114883/114883 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5705 event pairs, 85 based on Foata normal form. 8/1012 useless extension candidates. Maximal degree in co-relation 5398. Up to 866 conditions per place. [2024-06-20 19:12:26,256 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 186 selfloop transitions, 29 changer transitions 9/227 dead transitions. [2024-06-20 19:12:26,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 227 transitions, 2025 flow [2024-06-20 19:12:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:12:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:12:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2024-06-20 19:12:26,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 19:12:26,258 INFO L175 Difference]: Start difference. First operand has 274 places, 207 transitions, 1455 flow. Second operand 12 states and 144 transitions. [2024-06-20 19:12:26,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 227 transitions, 2025 flow [2024-06-20 19:12:26,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 227 transitions, 1933 flow, removed 8 selfloop flow, removed 14 redundant places. [2024-06-20 19:12:26,579 INFO L231 Difference]: Finished difference. Result has 270 places, 206 transitions, 1428 flow [2024-06-20 19:12:26,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1428, PETRI_PLACES=270, PETRI_TRANSITIONS=206} [2024-06-20 19:12:26,580 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 240 predicate places. [2024-06-20 19:12:26,580 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 206 transitions, 1428 flow [2024-06-20 19:12:26,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:26,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:26,580 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-20 19:12:26,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-20 19:12:26,581 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-20 19:12:26,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:26,581 INFO L85 PathProgramCache]: Analyzing trace with hash -103284802, now seen corresponding path program 5 times [2024-06-20 19:12:26,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:26,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976080287] [2024-06-20 19:12:26,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:26,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:32,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:32,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976080287] [2024-06-20 19:12:32,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976080287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:32,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:32,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:12:32,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10840129] [2024-06-20 19:12:32,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:32,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:12:32,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:32,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:12:32,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:12:32,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:12:32,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 206 transitions, 1428 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:32,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:32,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:12:32,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:33,414 INFO L124 PetriNetUnfolderBase]: 505/1003 cut-off events. [2024-06-20 19:12:33,415 INFO L125 PetriNetUnfolderBase]: For 113335/113335 co-relation queries the response was YES. [2024-06-20 19:12:33,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5440 conditions, 1003 events. 505/1003 cut-off events. For 113335/113335 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5687 event pairs, 85 based on Foata normal form. 8/1010 useless extension candidates. Maximal degree in co-relation 5316. Up to 864 conditions per place. [2024-06-20 19:12:33,425 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 184 selfloop transitions, 30 changer transitions 9/226 dead transitions. [2024-06-20 19:12:33,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 226 transitions, 1990 flow [2024-06-20 19:12:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:12:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:12:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-20 19:12:33,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3844086021505376 [2024-06-20 19:12:33,426 INFO L175 Difference]: Start difference. First operand has 270 places, 206 transitions, 1428 flow. Second operand 12 states and 143 transitions. [2024-06-20 19:12:33,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 226 transitions, 1990 flow [2024-06-20 19:12:33,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 226 transitions, 1922 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-20 19:12:33,738 INFO L231 Difference]: Finished difference. Result has 270 places, 205 transitions, 1421 flow [2024-06-20 19:12:33,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1421, PETRI_PLACES=270, PETRI_TRANSITIONS=205} [2024-06-20 19:12:33,738 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 240 predicate places. [2024-06-20 19:12:33,738 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 205 transitions, 1421 flow [2024-06-20 19:12:33,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:33,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:33,739 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-20 19:12:33,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-20 19:12:33,739 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-20 19:12:33,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash -304374052, now seen corresponding path program 6 times [2024-06-20 19:12:33,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:33,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598119852] [2024-06-20 19:12:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:39,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:39,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598119852] [2024-06-20 19:12:39,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598119852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:39,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:39,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:12:39,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885334166] [2024-06-20 19:12:39,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:39,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:12:39,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:39,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:12:39,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:12:40,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:12:40,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 205 transitions, 1421 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:40,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:40,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:12:40,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:40,471 INFO L124 PetriNetUnfolderBase]: 503/1001 cut-off events. [2024-06-20 19:12:40,472 INFO L125 PetriNetUnfolderBase]: For 113323/113323 co-relation queries the response was YES. [2024-06-20 19:12:40,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5428 conditions, 1001 events. 503/1001 cut-off events. For 113323/113323 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5713 event pairs, 85 based on Foata normal form. 8/1008 useless extension candidates. Maximal degree in co-relation 5304. Up to 862 conditions per place. [2024-06-20 19:12:40,481 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 187 selfloop transitions, 26 changer transitions 9/225 dead transitions. [2024-06-20 19:12:40,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 225 transitions, 1981 flow [2024-06-20 19:12:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:12:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:12:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2024-06-20 19:12:40,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 19:12:40,483 INFO L175 Difference]: Start difference. First operand has 270 places, 205 transitions, 1421 flow. Second operand 12 states and 144 transitions. [2024-06-20 19:12:40,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 225 transitions, 1981 flow [2024-06-20 19:12:40,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 225 transitions, 1911 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-20 19:12:40,796 INFO L231 Difference]: Finished difference. Result has 270 places, 204 transitions, 1404 flow [2024-06-20 19:12:40,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1404, PETRI_PLACES=270, PETRI_TRANSITIONS=204} [2024-06-20 19:12:40,798 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 240 predicate places. [2024-06-20 19:12:40,799 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 204 transitions, 1404 flow [2024-06-20 19:12:40,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:40,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:40,799 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-20 19:12:40,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-20 19:12:40,799 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-20 19:12:40,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1604804440, now seen corresponding path program 7 times [2024-06-20 19:12:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:40,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429387117] [2024-06-20 19:12:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:47,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:47,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429387117] [2024-06-20 19:12:47,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429387117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:47,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:47,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:12:47,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128811917] [2024-06-20 19:12:47,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:47,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:12:47,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:47,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:12:47,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:12:47,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:12:47,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 204 transitions, 1404 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:47,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:47,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:12:47,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:47,885 INFO L124 PetriNetUnfolderBase]: 476/948 cut-off events. [2024-06-20 19:12:47,885 INFO L125 PetriNetUnfolderBase]: For 77483/77483 co-relation queries the response was YES. [2024-06-20 19:12:47,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4360 conditions, 948 events. 476/948 cut-off events. For 77483/77483 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5350 event pairs, 73 based on Foata normal form. 8/955 useless extension candidates. Maximal degree in co-relation 4236. Up to 809 conditions per place. [2024-06-20 19:12:47,894 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 185 selfloop transitions, 25 changer transitions 9/222 dead transitions. [2024-06-20 19:12:47,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 222 transitions, 1944 flow [2024-06-20 19:12:47,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:12:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:12:47,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-20 19:12:47,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3844086021505376 [2024-06-20 19:12:47,896 INFO L175 Difference]: Start difference. First operand has 270 places, 204 transitions, 1404 flow. Second operand 12 states and 143 transitions. [2024-06-20 19:12:47,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 222 transitions, 1944 flow [2024-06-20 19:12:48,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 222 transitions, 1886 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-20 19:12:48,066 INFO L231 Difference]: Finished difference. Result has 269 places, 201 transitions, 1379 flow [2024-06-20 19:12:48,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1379, PETRI_PLACES=269, PETRI_TRANSITIONS=201} [2024-06-20 19:12:48,067 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 239 predicate places. [2024-06-20 19:12:48,067 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 201 transitions, 1379 flow [2024-06-20 19:12:48,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:48,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:48,068 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-20 19:12:48,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-20 19:12:48,068 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-20 19:12:48,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:48,068 INFO L85 PathProgramCache]: Analyzing trace with hash 5217680, now seen corresponding path program 16 times [2024-06-20 19:12:48,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:48,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774477858] [2024-06-20 19:12:48,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:54,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:54,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:54,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774477858] [2024-06-20 19:12:54,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774477858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:54,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:54,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:12:54,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557275971] [2024-06-20 19:12:54,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:54,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:12:54,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:54,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:12:54,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:12:54,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:12:54,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 201 transitions, 1379 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:54,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:54,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:12:54,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:54,507 INFO L124 PetriNetUnfolderBase]: 473/940 cut-off events. [2024-06-20 19:12:54,507 INFO L125 PetriNetUnfolderBase]: For 61833/61835 co-relation queries the response was YES. [2024-06-20 19:12:54,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4488 conditions, 940 events. 473/940 cut-off events. For 61833/61835 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5315 event pairs, 73 based on Foata normal form. 4/943 useless extension candidates. Maximal degree in co-relation 4365. Up to 715 conditions per place. [2024-06-20 19:12:54,516 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 156 selfloop transitions, 60 changer transitions 0/219 dead transitions. [2024-06-20 19:12:54,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 219 transitions, 2085 flow [2024-06-20 19:12:54,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:12:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:12:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-20 19:12:54,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507 [2024-06-20 19:12:54,517 INFO L175 Difference]: Start difference. First operand has 269 places, 201 transitions, 1379 flow. Second operand 11 states and 139 transitions. [2024-06-20 19:12:54,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 219 transitions, 2085 flow [2024-06-20 19:12:54,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 219 transitions, 2023 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-20 19:12:54,734 INFO L231 Difference]: Finished difference. Result has 265 places, 205 transitions, 1501 flow [2024-06-20 19:12:54,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1501, PETRI_PLACES=265, PETRI_TRANSITIONS=205} [2024-06-20 19:12:54,735 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 235 predicate places. [2024-06-20 19:12:54,735 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 205 transitions, 1501 flow [2024-06-20 19:12:54,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:54,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:54,735 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-20 19:12:54,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-20 19:12:54,736 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-20 19:12:54,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:54,736 INFO L85 PathProgramCache]: Analyzing trace with hash 149315600, now seen corresponding path program 17 times [2024-06-20 19:12:54,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:54,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647245735] [2024-06-20 19:12:54,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:01,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:01,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:01,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647245735] [2024-06-20 19:13:01,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647245735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:01,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:01,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:01,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961775673] [2024-06-20 19:13:01,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:01,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:01,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:01,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:01,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:01,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:13:01,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 205 transitions, 1501 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:01,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:01,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:13:01,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:01,747 INFO L124 PetriNetUnfolderBase]: 470/939 cut-off events. [2024-06-20 19:13:01,747 INFO L125 PetriNetUnfolderBase]: For 52202/52204 co-relation queries the response was YES. [2024-06-20 19:13:01,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4336 conditions, 939 events. 470/939 cut-off events. For 52202/52204 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5348 event pairs, 74 based on Foata normal form. 4/942 useless extension candidates. Maximal degree in co-relation 4214. Up to 727 conditions per place. [2024-06-20 19:13:01,756 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 155 selfloop transitions, 59 changer transitions 0/217 dead transitions. [2024-06-20 19:13:01,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 217 transitions, 1957 flow [2024-06-20 19:13:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-20 19:13:01,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-20 19:13:01,757 INFO L175 Difference]: Start difference. First operand has 265 places, 205 transitions, 1501 flow. Second operand 11 states and 136 transitions. [2024-06-20 19:13:01,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 217 transitions, 1957 flow [2024-06-20 19:13:01,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 217 transitions, 1839 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-20 19:13:01,946 INFO L231 Difference]: Finished difference. Result has 268 places, 205 transitions, 1505 flow [2024-06-20 19:13:01,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1505, PETRI_PLACES=268, PETRI_TRANSITIONS=205} [2024-06-20 19:13:01,947 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 238 predicate places. [2024-06-20 19:13:01,947 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 205 transitions, 1505 flow [2024-06-20 19:13:01,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:01,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:01,947 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-20 19:13:01,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-20 19:13:01,947 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-20 19:13:01,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:01,949 INFO L85 PathProgramCache]: Analyzing trace with hash 164015094, now seen corresponding path program 18 times [2024-06-20 19:13:01,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:01,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316333993] [2024-06-20 19:13:01,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:08,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:08,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316333993] [2024-06-20 19:13:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316333993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:08,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:08,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:08,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289937452] [2024-06-20 19:13:08,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:08,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:08,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:08,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:08,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:08,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:13:08,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 205 transitions, 1505 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:08,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:08,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:13:08,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:08,668 INFO L124 PetriNetUnfolderBase]: 474/945 cut-off events. [2024-06-20 19:13:08,669 INFO L125 PetriNetUnfolderBase]: For 53218/53220 co-relation queries the response was YES. [2024-06-20 19:13:08,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4387 conditions, 945 events. 474/945 cut-off events. For 53218/53220 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5385 event pairs, 70 based on Foata normal form. 4/948 useless extension candidates. Maximal degree in co-relation 4266. Up to 699 conditions per place. [2024-06-20 19:13:08,677 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 156 selfloop transitions, 61 changer transitions 0/220 dead transitions. [2024-06-20 19:13:08,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 220 transitions, 1993 flow [2024-06-20 19:13:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-20 19:13:08,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41055718475073316 [2024-06-20 19:13:08,678 INFO L175 Difference]: Start difference. First operand has 268 places, 205 transitions, 1505 flow. Second operand 11 states and 140 transitions. [2024-06-20 19:13:08,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 220 transitions, 1993 flow [2024-06-20 19:13:08,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 220 transitions, 1872 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-20 19:13:08,863 INFO L231 Difference]: Finished difference. Result has 269 places, 206 transitions, 1534 flow [2024-06-20 19:13:08,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1534, PETRI_PLACES=269, PETRI_TRANSITIONS=206} [2024-06-20 19:13:08,863 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 239 predicate places. [2024-06-20 19:13:08,863 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 206 transitions, 1534 flow [2024-06-20 19:13:08,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:08,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:08,864 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-20 19:13:08,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-20 19:13:08,864 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-20 19:13:08,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:08,864 INFO L85 PathProgramCache]: Analyzing trace with hash 87873572, now seen corresponding path program 19 times [2024-06-20 19:13:08,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:08,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723093315] [2024-06-20 19:13:08,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:08,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:14,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:14,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:14,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723093315] [2024-06-20 19:13:14,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723093315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:14,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:14,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:14,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714652051] [2024-06-20 19:13:14,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:14,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:14,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:14,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:14,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:15,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:13:15,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 206 transitions, 1534 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:15,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:15,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:13:15,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:15,626 INFO L124 PetriNetUnfolderBase]: 481/960 cut-off events. [2024-06-20 19:13:15,627 INFO L125 PetriNetUnfolderBase]: For 54616/54618 co-relation queries the response was YES. [2024-06-20 19:13:15,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4508 conditions, 960 events. 481/960 cut-off events. For 54616/54618 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5510 event pairs, 76 based on Foata normal form. 4/963 useless extension candidates. Maximal degree in co-relation 4386. Up to 747 conditions per place. [2024-06-20 19:13:15,635 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 158 selfloop transitions, 60 changer transitions 0/221 dead transitions. [2024-06-20 19:13:15,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 221 transitions, 2042 flow [2024-06-20 19:13:15,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-20 19:13:15,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265 [2024-06-20 19:13:15,638 INFO L175 Difference]: Start difference. First operand has 269 places, 206 transitions, 1534 flow. Second operand 11 states and 135 transitions. [2024-06-20 19:13:15,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 221 transitions, 2042 flow [2024-06-20 19:13:15,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 221 transitions, 1898 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-20 19:13:15,841 INFO L231 Difference]: Finished difference. Result has 271 places, 209 transitions, 1560 flow [2024-06-20 19:13:15,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1394, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1560, PETRI_PLACES=271, PETRI_TRANSITIONS=209} [2024-06-20 19:13:15,842 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 241 predicate places. [2024-06-20 19:13:15,842 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 209 transitions, 1560 flow [2024-06-20 19:13:15,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:15,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:15,842 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-20 19:13:15,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-20 19:13:15,843 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-20 19:13:15,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash 87666182, now seen corresponding path program 20 times [2024-06-20 19:13:15,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:15,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106498384] [2024-06-20 19:13:15,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:15,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:21,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:21,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106498384] [2024-06-20 19:13:21,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106498384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:21,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:21,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:21,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745621423] [2024-06-20 19:13:21,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:21,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:21,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:21,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:21,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:21,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:13:21,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 209 transitions, 1560 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:21,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:21,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:13:21,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:22,091 INFO L124 PetriNetUnfolderBase]: 485/968 cut-off events. [2024-06-20 19:13:22,091 INFO L125 PetriNetUnfolderBase]: For 55780/55782 co-relation queries the response was YES. [2024-06-20 19:13:22,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4543 conditions, 968 events. 485/968 cut-off events. For 55780/55782 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5575 event pairs, 76 based on Foata normal form. 4/971 useless extension candidates. Maximal degree in co-relation 4420. Up to 741 conditions per place. [2024-06-20 19:13:22,100 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 159 selfloop transitions, 61 changer transitions 0/223 dead transitions. [2024-06-20 19:13:22,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 223 transitions, 2056 flow [2024-06-20 19:13:22,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:22,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-20 19:13:22,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40175953079178883 [2024-06-20 19:13:22,103 INFO L175 Difference]: Start difference. First operand has 271 places, 209 transitions, 1560 flow. Second operand 11 states and 137 transitions. [2024-06-20 19:13:22,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 223 transitions, 2056 flow [2024-06-20 19:13:22,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 223 transitions, 1934 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 19:13:22,310 INFO L231 Difference]: Finished difference. Result has 275 places, 210 transitions, 1592 flow [2024-06-20 19:13:22,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1592, PETRI_PLACES=275, PETRI_TRANSITIONS=210} [2024-06-20 19:13:22,310 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 245 predicate places. [2024-06-20 19:13:22,310 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 210 transitions, 1592 flow [2024-06-20 19:13:22,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:22,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:22,311 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-20 19:13:22,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-20 19:13:22,311 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-20 19:13:22,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash 82159652, now seen corresponding path program 21 times [2024-06-20 19:13:22,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:22,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053680673] [2024-06-20 19:13:22,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:22,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:27,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:27,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053680673] [2024-06-20 19:13:27,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053680673] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:27,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:27,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:27,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973651553] [2024-06-20 19:13:27,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:27,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:27,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:27,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:27,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:27,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:13:27,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 210 transitions, 1592 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:27,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:27,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:13:27,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:28,209 INFO L124 PetriNetUnfolderBase]: 496/987 cut-off events. [2024-06-20 19:13:28,209 INFO L125 PetriNetUnfolderBase]: For 66860/66862 co-relation queries the response was YES. [2024-06-20 19:13:28,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4906 conditions, 987 events. 496/987 cut-off events. For 66860/66862 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5672 event pairs, 77 based on Foata normal form. 4/990 useless extension candidates. Maximal degree in co-relation 4782. Up to 707 conditions per place. [2024-06-20 19:13:28,218 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 161 selfloop transitions, 63 changer transitions 0/227 dead transitions. [2024-06-20 19:13:28,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 227 transitions, 2324 flow [2024-06-20 19:13:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-20 19:13:28,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2024-06-20 19:13:28,220 INFO L175 Difference]: Start difference. First operand has 275 places, 210 transitions, 1592 flow. Second operand 11 states and 138 transitions. [2024-06-20 19:13:28,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 227 transitions, 2324 flow [2024-06-20 19:13:28,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 227 transitions, 2180 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-20 19:13:28,457 INFO L231 Difference]: Finished difference. Result has 277 places, 212 transitions, 1636 flow [2024-06-20 19:13:28,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1636, PETRI_PLACES=277, PETRI_TRANSITIONS=212} [2024-06-20 19:13:28,458 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 247 predicate places. [2024-06-20 19:13:28,458 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 212 transitions, 1636 flow [2024-06-20 19:13:28,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:28,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:28,458 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-20 19:13:28,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-20 19:13:28,459 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-20 19:13:28,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:28,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1945253806, now seen corresponding path program 22 times [2024-06-20 19:13:28,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:28,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760242059] [2024-06-20 19:13:28,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:28,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:34,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:34,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760242059] [2024-06-20 19:13:34,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760242059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:34,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:34,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:34,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629007920] [2024-06-20 19:13:34,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:34,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:34,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:34,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:34,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:34,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:13:34,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 212 transitions, 1636 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:34,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:34,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:13:34,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:34,888 INFO L124 PetriNetUnfolderBase]: 503/1002 cut-off events. [2024-06-20 19:13:34,889 INFO L125 PetriNetUnfolderBase]: For 68442/68444 co-relation queries the response was YES. [2024-06-20 19:13:34,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4999 conditions, 1002 events. 503/1002 cut-off events. For 68442/68444 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5810 event pairs, 83 based on Foata normal form. 4/1005 useless extension candidates. Maximal degree in co-relation 4874. Up to 788 conditions per place. [2024-06-20 19:13:34,898 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 158 selfloop transitions, 66 changer transitions 0/227 dead transitions. [2024-06-20 19:13:34,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 227 transitions, 2164 flow [2024-06-20 19:13:34,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-20 19:13:34,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-20 19:13:34,899 INFO L175 Difference]: Start difference. First operand has 277 places, 212 transitions, 1636 flow. Second operand 11 states and 134 transitions. [2024-06-20 19:13:34,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 227 transitions, 2164 flow [2024-06-20 19:13:35,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 227 transitions, 2039 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-20 19:13:35,126 INFO L231 Difference]: Finished difference. Result has 281 places, 215 transitions, 1701 flow [2024-06-20 19:13:35,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1701, PETRI_PLACES=281, PETRI_TRANSITIONS=215} [2024-06-20 19:13:35,127 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 251 predicate places. [2024-06-20 19:13:35,127 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 215 transitions, 1701 flow [2024-06-20 19:13:35,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:35,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:35,127 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-20 19:13:35,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-20 19:13:35,127 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-20 19:13:35,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1945046416, now seen corresponding path program 23 times [2024-06-20 19:13:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:35,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605818436] [2024-06-20 19:13:35,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:41,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:41,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605818436] [2024-06-20 19:13:41,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605818436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:41,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:41,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:41,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850756298] [2024-06-20 19:13:41,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:41,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:41,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:41,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:41,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:41,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:13:41,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 215 transitions, 1701 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:41,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:41,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:13:41,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:41,715 INFO L124 PetriNetUnfolderBase]: 514/1023 cut-off events. [2024-06-20 19:13:41,716 INFO L125 PetriNetUnfolderBase]: For 79289/79291 co-relation queries the response was YES. [2024-06-20 19:13:41,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5357 conditions, 1023 events. 514/1023 cut-off events. For 79289/79291 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5962 event pairs, 82 based on Foata normal form. 4/1026 useless extension candidates. Maximal degree in co-relation 5230. Up to 784 conditions per place. [2024-06-20 19:13:41,726 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 160 selfloop transitions, 68 changer transitions 0/231 dead transitions. [2024-06-20 19:13:41,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 231 transitions, 2431 flow [2024-06-20 19:13:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-20 19:13:41,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-20 19:13:41,728 INFO L175 Difference]: Start difference. First operand has 281 places, 215 transitions, 1701 flow. Second operand 11 states and 136 transitions. [2024-06-20 19:13:41,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 231 transitions, 2431 flow [2024-06-20 19:13:42,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 231 transitions, 2296 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-20 19:13:42,020 INFO L231 Difference]: Finished difference. Result has 285 places, 217 transitions, 1752 flow [2024-06-20 19:13:42,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1566, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1752, PETRI_PLACES=285, PETRI_TRANSITIONS=217} [2024-06-20 19:13:42,021 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 255 predicate places. [2024-06-20 19:13:42,021 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 217 transitions, 1752 flow [2024-06-20 19:13:42,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:42,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:42,021 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-20 19:13:42,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-20 19:13:42,022 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-20 19:13:42,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:42,022 INFO L85 PathProgramCache]: Analyzing trace with hash -659853382, now seen corresponding path program 24 times [2024-06-20 19:13:42,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:42,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022248710] [2024-06-20 19:13:42,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:42,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:47,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-20 19:13:47,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:47,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022248710] [2024-06-20 19:13:47,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022248710] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:47,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:47,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:47,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105545929] [2024-06-20 19:13:47,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:47,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:47,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:47,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:47,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:48,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:13:48,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 217 transitions, 1752 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:48,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:48,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:13:48,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:48,465 INFO L124 PetriNetUnfolderBase]: 521/1036 cut-off events. [2024-06-20 19:13:48,465 INFO L125 PetriNetUnfolderBase]: For 81142/81144 co-relation queries the response was YES. [2024-06-20 19:13:48,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5464 conditions, 1036 events. 521/1036 cut-off events. For 81142/81144 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6058 event pairs, 84 based on Foata normal form. 4/1039 useless extension candidates. Maximal degree in co-relation 5336. Up to 821 conditions per place. [2024-06-20 19:13:48,475 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 167 selfloop transitions, 62 changer transitions 0/232 dead transitions. [2024-06-20 19:13:48,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 232 transitions, 2286 flow [2024-06-20 19:13:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-20 19:13:48,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-20 19:13:48,477 INFO L175 Difference]: Start difference. First operand has 285 places, 217 transitions, 1752 flow. Second operand 11 states and 136 transitions. [2024-06-20 19:13:48,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 232 transitions, 2286 flow [2024-06-20 19:13:48,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 232 transitions, 2179 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-20 19:13:48,765 INFO L231 Difference]: Finished difference. Result has 289 places, 220 transitions, 1823 flow [2024-06-20 19:13:48,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1823, PETRI_PLACES=289, PETRI_TRANSITIONS=220} [2024-06-20 19:13:48,765 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 259 predicate places. [2024-06-20 19:13:48,765 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 220 transitions, 1823 flow [2024-06-20 19:13:48,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:48,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:48,766 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-20 19:13:48,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-20 19:13:48,766 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-20 19:13:48,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:48,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1972817060, now seen corresponding path program 25 times [2024-06-20 19:13:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248077238] [2024-06-20 19:13:48,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:48,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:54,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:54,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248077238] [2024-06-20 19:13:54,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248077238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:54,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:54,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:54,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412129635] [2024-06-20 19:13:54,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:54,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:54,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:54,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:54,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:54,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:13:54,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 220 transitions, 1823 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:54,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:54,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:13:54,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:54,799 INFO L124 PetriNetUnfolderBase]: 525/1048 cut-off events. [2024-06-20 19:13:54,799 INFO L125 PetriNetUnfolderBase]: For 82779/82781 co-relation queries the response was YES. [2024-06-20 19:13:54,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5600 conditions, 1048 events. 525/1048 cut-off events. For 82779/82781 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6132 event pairs, 86 based on Foata normal form. 4/1051 useless extension candidates. Maximal degree in co-relation 5470. Up to 829 conditions per place. [2024-06-20 19:13:54,809 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 163 selfloop transitions, 67 changer transitions 0/233 dead transitions. [2024-06-20 19:13:54,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 233 transitions, 2335 flow [2024-06-20 19:13:54,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-20 19:13:54,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265 [2024-06-20 19:13:54,811 INFO L175 Difference]: Start difference. First operand has 289 places, 220 transitions, 1823 flow. Second operand 11 states and 135 transitions. [2024-06-20 19:13:54,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 233 transitions, 2335 flow [2024-06-20 19:13:55,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 233 transitions, 2195 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-20 19:13:55,075 INFO L231 Difference]: Finished difference. Result has 292 places, 221 transitions, 1847 flow [2024-06-20 19:13:55,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1683, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1847, PETRI_PLACES=292, PETRI_TRANSITIONS=221} [2024-06-20 19:13:55,075 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 262 predicate places. [2024-06-20 19:13:55,075 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 221 transitions, 1847 flow [2024-06-20 19:13:55,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:55,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:55,076 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-20 19:13:55,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-20 19:13:55,076 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-20 19:13:55,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:55,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1180624860, now seen corresponding path program 26 times [2024-06-20 19:13:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:55,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483500685] [2024-06-20 19:13:55,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:55,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:00,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:00,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483500685] [2024-06-20 19:14:00,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483500685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:00,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:00,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:14:00,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611272907] [2024-06-20 19:14:00,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:00,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:14:00,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:00,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:14:00,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:00,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:14:00,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 221 transitions, 1847 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:00,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:00,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:14:00,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:01,256 INFO L124 PetriNetUnfolderBase]: 522/1037 cut-off events. [2024-06-20 19:14:01,257 INFO L125 PetriNetUnfolderBase]: For 73858/73858 co-relation queries the response was YES. [2024-06-20 19:14:01,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5355 conditions, 1037 events. 522/1037 cut-off events. For 73858/73858 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6074 event pairs, 84 based on Foata normal form. 2/1038 useless extension candidates. Maximal degree in co-relation 5224. Up to 961 conditions per place. [2024-06-20 19:14:01,266 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 214 selfloop transitions, 16 changer transitions 0/233 dead transitions. [2024-06-20 19:14:01,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 233 transitions, 2335 flow [2024-06-20 19:14:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-20 19:14:01,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36070381231671556 [2024-06-20 19:14:01,268 INFO L175 Difference]: Start difference. First operand has 292 places, 221 transitions, 1847 flow. Second operand 11 states and 123 transitions. [2024-06-20 19:14:01,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 233 transitions, 2335 flow [2024-06-20 19:14:01,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 233 transitions, 2157 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-06-20 19:14:01,523 INFO L231 Difference]: Finished difference. Result has 293 places, 221 transitions, 1705 flow [2024-06-20 19:14:01,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1669, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1705, PETRI_PLACES=293, PETRI_TRANSITIONS=221} [2024-06-20 19:14:01,523 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 263 predicate places. [2024-06-20 19:14:01,523 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 221 transitions, 1705 flow [2024-06-20 19:14:01,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:01,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:01,524 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-20 19:14:01,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-20 19:14:01,524 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-20 19:14:01,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:01,525 INFO L85 PathProgramCache]: Analyzing trace with hash 281611172, now seen corresponding path program 27 times [2024-06-20 19:14:01,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:01,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169242548] [2024-06-20 19:14:01,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:01,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:07,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:07,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169242548] [2024-06-20 19:14:07,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169242548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:07,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:07,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:14:07,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419986755] [2024-06-20 19:14:07,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:07,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:14:07,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:07,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:14:07,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:07,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:14:07,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 221 transitions, 1705 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:07,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:07,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:14:07,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:07,770 INFO L124 PetriNetUnfolderBase]: 526/1047 cut-off events. [2024-06-20 19:14:07,771 INFO L125 PetriNetUnfolderBase]: For 74763/74765 co-relation queries the response was YES. [2024-06-20 19:14:07,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5261 conditions, 1047 events. 526/1047 cut-off events. For 74763/74765 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6138 event pairs, 85 based on Foata normal form. 4/1050 useless extension candidates. Maximal degree in co-relation 5129. Up to 832 conditions per place. [2024-06-20 19:14:07,780 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 170 selfloop transitions, 61 changer transitions 0/234 dead transitions. [2024-06-20 19:14:07,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 234 transitions, 2221 flow [2024-06-20 19:14:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-20 19:14:07,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40175953079178883 [2024-06-20 19:14:07,781 INFO L175 Difference]: Start difference. First operand has 293 places, 221 transitions, 1705 flow. Second operand 11 states and 137 transitions. [2024-06-20 19:14:07,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 234 transitions, 2221 flow [2024-06-20 19:14:08,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 234 transitions, 2179 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-20 19:14:08,061 INFO L231 Difference]: Finished difference. Result has 294 places, 222 transitions, 1817 flow [2024-06-20 19:14:08,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1817, PETRI_PLACES=294, PETRI_TRANSITIONS=222} [2024-06-20 19:14:08,062 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 264 predicate places. [2024-06-20 19:14:08,062 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 222 transitions, 1817 flow [2024-06-20 19:14:08,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:08,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:08,062 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-20 19:14:08,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-20 19:14:08,062 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-20 19:14:08,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:08,063 INFO L85 PathProgramCache]: Analyzing trace with hash 21912024, now seen corresponding path program 28 times [2024-06-20 19:14:08,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:08,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403511200] [2024-06-20 19:14:08,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:08,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:13,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:13,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403511200] [2024-06-20 19:14:13,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403511200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:13,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:13,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:14:13,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781646337] [2024-06-20 19:14:13,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:13,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:14:13,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:13,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:14:13,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:14:13,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:14:13,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 222 transitions, 1817 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-20 19:14:13,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:13,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:14:13,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:13,544 INFO L124 PetriNetUnfolderBase]: 530/1055 cut-off events. [2024-06-20 19:14:13,545 INFO L125 PetriNetUnfolderBase]: For 76696/76698 co-relation queries the response was YES. [2024-06-20 19:14:13,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5433 conditions, 1055 events. 530/1055 cut-off events. For 76696/76698 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6206 event pairs, 81 based on Foata normal form. 4/1058 useless extension candidates. Maximal degree in co-relation 5300. Up to 624 conditions per place. [2024-06-20 19:14:13,554 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 157 selfloop transitions, 79 changer transitions 0/239 dead transitions. [2024-06-20 19:14:13,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 239 transitions, 2563 flow [2024-06-20 19:14:13,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-20 19:14:13,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44281524926686217 [2024-06-20 19:14:13,555 INFO L175 Difference]: Start difference. First operand has 294 places, 222 transitions, 1817 flow. Second operand 11 states and 151 transitions. [2024-06-20 19:14:13,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 239 transitions, 2563 flow [2024-06-20 19:14:13,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 239 transitions, 2396 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-20 19:14:13,836 INFO L231 Difference]: Finished difference. Result has 295 places, 223 transitions, 1842 flow [2024-06-20 19:14:13,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1650, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1842, PETRI_PLACES=295, PETRI_TRANSITIONS=223} [2024-06-20 19:14:13,837 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 265 predicate places. [2024-06-20 19:14:13,837 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 223 transitions, 1842 flow [2024-06-20 19:14:13,837 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-20 19:14:13,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:13,837 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-20 19:14:13,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-20 19:14:13,838 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-20 19:14:13,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:13,838 INFO L85 PathProgramCache]: Analyzing trace with hash 281605592, now seen corresponding path program 29 times [2024-06-20 19:14:13,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:13,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362333312] [2024-06-20 19:14:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:13,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:20,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:20,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362333312] [2024-06-20 19:14:20,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362333312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:20,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:20,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:14:20,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768099824] [2024-06-20 19:14:20,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:20,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:14:20,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:20,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:14:20,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:20,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:14:20,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 223 transitions, 1842 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:20,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:20,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:14:20,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:20,929 INFO L124 PetriNetUnfolderBase]: 527/1050 cut-off events. [2024-06-20 19:14:20,930 INFO L125 PetriNetUnfolderBase]: For 67090/67092 co-relation queries the response was YES. [2024-06-20 19:14:20,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5218 conditions, 1050 events. 527/1050 cut-off events. For 67090/67092 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6167 event pairs, 82 based on Foata normal form. 4/1053 useless extension candidates. Maximal degree in co-relation 5084. Up to 815 conditions per place. [2024-06-20 19:14:20,940 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 170 selfloop transitions, 63 changer transitions 0/236 dead transitions. [2024-06-20 19:14:20,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 236 transitions, 2338 flow [2024-06-20 19:14:20,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-20 19:14:20,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2024-06-20 19:14:20,941 INFO L175 Difference]: Start difference. First operand has 295 places, 223 transitions, 1842 flow. Second operand 11 states and 138 transitions. [2024-06-20 19:14:20,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 236 transitions, 2338 flow [2024-06-20 19:14:21,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 236 transitions, 2123 flow, removed 24 selfloop flow, removed 11 redundant places. [2024-06-20 19:14:21,191 INFO L231 Difference]: Finished difference. Result has 295 places, 223 transitions, 1757 flow [2024-06-20 19:14:21,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1627, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1757, PETRI_PLACES=295, PETRI_TRANSITIONS=223} [2024-06-20 19:14:21,191 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 265 predicate places. [2024-06-20 19:14:21,192 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 223 transitions, 1757 flow [2024-06-20 19:14:21,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:21,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:21,208 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-20 19:14:21,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-20 19:14:21,208 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-20 19:14:21,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:21,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1221948308, now seen corresponding path program 30 times [2024-06-20 19:14:21,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:21,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775788078] [2024-06-20 19:14:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:21,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:26,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:26,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775788078] [2024-06-20 19:14:26,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775788078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:26,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:26,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:14:26,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178750528] [2024-06-20 19:14:26,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:26,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:14:26,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:26,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:14:26,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:26,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:14:26,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 223 transitions, 1757 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:26,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:26,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:14:26,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:27,439 INFO L124 PetriNetUnfolderBase]: 537/1070 cut-off events. [2024-06-20 19:14:27,439 INFO L125 PetriNetUnfolderBase]: For 67782/67784 co-relation queries the response was YES. [2024-06-20 19:14:27,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5118 conditions, 1070 events. 537/1070 cut-off events. For 67782/67784 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6320 event pairs, 86 based on Foata normal form. 4/1073 useless extension candidates. Maximal degree in co-relation 4986. Up to 851 conditions per place. [2024-06-20 19:14:27,449 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 173 selfloop transitions, 64 changer transitions 0/240 dead transitions. [2024-06-20 19:14:27,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 240 transitions, 2332 flow [2024-06-20 19:14:27,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-20 19:14:27,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2024-06-20 19:14:27,451 INFO L175 Difference]: Start difference. First operand has 295 places, 223 transitions, 1757 flow. Second operand 11 states and 138 transitions. [2024-06-20 19:14:27,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 240 transitions, 2332 flow [2024-06-20 19:14:27,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 240 transitions, 2121 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-20 19:14:27,722 INFO L231 Difference]: Finished difference. Result has 295 places, 228 transitions, 1753 flow [2024-06-20 19:14:27,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1753, PETRI_PLACES=295, PETRI_TRANSITIONS=228} [2024-06-20 19:14:27,722 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 265 predicate places. [2024-06-20 19:14:27,723 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 228 transitions, 1753 flow [2024-06-20 19:14:27,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:27,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:27,723 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-20 19:14:27,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-20 19:14:27,723 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-20 19:14:27,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:27,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1741637992, now seen corresponding path program 31 times [2024-06-20 19:14:27,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:27,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060431579] [2024-06-20 19:14:27,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:27,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:33,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-20 19:14:33,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:33,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060431579] [2024-06-20 19:14:33,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060431579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:33,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:33,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:14:33,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209448423] [2024-06-20 19:14:33,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:33,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:14:33,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:33,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:14:33,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:33,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:14:33,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 228 transitions, 1753 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:33,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:33,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:14:33,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:33,870 INFO L124 PetriNetUnfolderBase]: 548/1091 cut-off events. [2024-06-20 19:14:33,871 INFO L125 PetriNetUnfolderBase]: For 80788/80790 co-relation queries the response was YES. [2024-06-20 19:14:33,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5348 conditions, 1091 events. 548/1091 cut-off events. For 80788/80790 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6457 event pairs, 87 based on Foata normal form. 4/1094 useless extension candidates. Maximal degree in co-relation 5216. Up to 855 conditions per place. [2024-06-20 19:14:33,881 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 177 selfloop transitions, 64 changer transitions 0/244 dead transitions. [2024-06-20 19:14:33,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 244 transitions, 2531 flow [2024-06-20 19:14:33,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:33,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-20 19:14:33,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41642228739002934 [2024-06-20 19:14:33,882 INFO L175 Difference]: Start difference. First operand has 295 places, 228 transitions, 1753 flow. Second operand 11 states and 142 transitions. [2024-06-20 19:14:33,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 244 transitions, 2531 flow [2024-06-20 19:14:34,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 244 transitions, 2406 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-20 19:14:34,158 INFO L231 Difference]: Finished difference. Result has 300 places, 230 transitions, 1812 flow [2024-06-20 19:14:34,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1812, PETRI_PLACES=300, PETRI_TRANSITIONS=230} [2024-06-20 19:14:34,158 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 270 predicate places. [2024-06-20 19:14:34,158 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 230 transitions, 1812 flow [2024-06-20 19:14:34,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:34,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:34,159 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-20 19:14:34,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-20 19:14:34,159 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-20 19:14:34,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:34,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1028008898, now seen corresponding path program 32 times [2024-06-20 19:14:34,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:34,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902508943] [2024-06-20 19:14:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:34,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:40,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:40,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902508943] [2024-06-20 19:14:40,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902508943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:40,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:40,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:14:40,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669212904] [2024-06-20 19:14:40,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:40,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:14:40,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:40,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:14:40,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:40,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:14:40,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 230 transitions, 1812 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:40,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:40,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:14:40,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:41,022 INFO L124 PetriNetUnfolderBase]: 545/1086 cut-off events. [2024-06-20 19:14:41,022 INFO L125 PetriNetUnfolderBase]: For 70632/70634 co-relation queries the response was YES. [2024-06-20 19:14:41,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5101 conditions, 1086 events. 545/1086 cut-off events. For 70632/70634 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6421 event pairs, 88 based on Foata normal form. 4/1089 useless extension candidates. Maximal degree in co-relation 4968. Up to 867 conditions per place. [2024-06-20 19:14:41,047 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 176 selfloop transitions, 63 changer transitions 0/242 dead transitions. [2024-06-20 19:14:41,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 242 transitions, 2318 flow [2024-06-20 19:14:41,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-20 19:14:41,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507 [2024-06-20 19:14:41,055 INFO L175 Difference]: Start difference. First operand has 300 places, 230 transitions, 1812 flow. Second operand 11 states and 139 transitions. [2024-06-20 19:14:41,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 242 transitions, 2318 flow [2024-06-20 19:14:41,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 242 transitions, 2155 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-20 19:14:41,302 INFO L231 Difference]: Finished difference. Result has 303 places, 230 transitions, 1779 flow [2024-06-20 19:14:41,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1779, PETRI_PLACES=303, PETRI_TRANSITIONS=230} [2024-06-20 19:14:41,303 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 273 predicate places. [2024-06-20 19:14:41,303 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 230 transitions, 1779 flow [2024-06-20 19:14:41,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:41,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:41,303 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-20 19:14:41,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-20 19:14:41,303 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-20 19:14:41,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1022294978, now seen corresponding path program 33 times [2024-06-20 19:14:41,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:41,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839558996] [2024-06-20 19:14:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:41,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:46,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:46,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839558996] [2024-06-20 19:14:46,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839558996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:46,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:46,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:14:46,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525672584] [2024-06-20 19:14:46,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:46,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:14:46,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:46,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:14:46,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:46,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:14:46,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 230 transitions, 1779 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:46,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:46,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:14:46,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:47,198 INFO L124 PetriNetUnfolderBase]: 549/1094 cut-off events. [2024-06-20 19:14:47,198 INFO L125 PetriNetUnfolderBase]: For 71429/71431 co-relation queries the response was YES. [2024-06-20 19:14:47,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5171 conditions, 1094 events. 549/1094 cut-off events. For 71429/71431 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6500 event pairs, 86 based on Foata normal form. 4/1097 useless extension candidates. Maximal degree in co-relation 5036. Up to 814 conditions per place. [2024-06-20 19:14:47,208 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 176 selfloop transitions, 67 changer transitions 0/246 dead transitions. [2024-06-20 19:14:47,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 246 transitions, 2544 flow [2024-06-20 19:14:47,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-20 19:14:47,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41642228739002934 [2024-06-20 19:14:47,210 INFO L175 Difference]: Start difference. First operand has 303 places, 230 transitions, 1779 flow. Second operand 11 states and 142 transitions. [2024-06-20 19:14:47,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 246 transitions, 2544 flow [2024-06-20 19:14:47,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 246 transitions, 2415 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-20 19:14:47,524 INFO L231 Difference]: Finished difference. Result has 304 places, 231 transitions, 1815 flow [2024-06-20 19:14:47,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1650, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1815, PETRI_PLACES=304, PETRI_TRANSITIONS=231} [2024-06-20 19:14:47,524 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 274 predicate places. [2024-06-20 19:14:47,525 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 231 transitions, 1815 flow [2024-06-20 19:14:47,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:47,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:47,525 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-20 19:14:47,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-20 19:14:47,525 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-20 19:14:47,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:47,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1221740918, now seen corresponding path program 34 times [2024-06-20 19:14:47,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:47,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240123370] [2024-06-20 19:14:47,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:47,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:53,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:53,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240123370] [2024-06-20 19:14:53,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240123370] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:53,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:53,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:14:53,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866349372] [2024-06-20 19:14:53,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:53,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:14:53,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:53,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:14:53,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:54,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:14:54,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 231 transitions, 1815 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:54,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:54,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:14:54,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:54,572 INFO L124 PetriNetUnfolderBase]: 553/1102 cut-off events. [2024-06-20 19:14:54,572 INFO L125 PetriNetUnfolderBase]: For 73210/73212 co-relation queries the response was YES. [2024-06-20 19:14:54,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5274 conditions, 1102 events. 553/1102 cut-off events. For 73210/73212 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6557 event pairs, 88 based on Foata normal form. 4/1105 useless extension candidates. Maximal degree in co-relation 5138. Up to 860 conditions per place. [2024-06-20 19:14:54,582 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 177 selfloop transitions, 66 changer transitions 0/246 dead transitions. [2024-06-20 19:14:54,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 246 transitions, 2582 flow [2024-06-20 19:14:54,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:54,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-20 19:14:54,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41055718475073316 [2024-06-20 19:14:54,584 INFO L175 Difference]: Start difference. First operand has 304 places, 231 transitions, 1815 flow. Second operand 11 states and 140 transitions. [2024-06-20 19:14:54,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 246 transitions, 2582 flow [2024-06-20 19:14:54,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 246 transitions, 2294 flow, removed 16 selfloop flow, removed 11 redundant places. [2024-06-20 19:14:54,894 INFO L231 Difference]: Finished difference. Result has 304 places, 232 transitions, 1692 flow [2024-06-20 19:14:54,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1533, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1692, PETRI_PLACES=304, PETRI_TRANSITIONS=232} [2024-06-20 19:14:54,894 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 274 predicate places. [2024-06-20 19:14:54,894 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 232 transitions, 1692 flow [2024-06-20 19:14:54,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:54,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:54,895 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-20 19:14:54,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-20 19:14:54,895 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-20 19:14:54,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:54,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1229098148, now seen corresponding path program 35 times [2024-06-20 19:14:54,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:54,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008913591] [2024-06-20 19:14:54,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:54,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:00,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:00,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008913591] [2024-06-20 19:15:00,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008913591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:00,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:00,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:15:00,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690068067] [2024-06-20 19:15:00,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:00,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:15:00,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:00,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:15:00,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:15:00,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:15:00,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 232 transitions, 1692 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:00,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:00,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:15:00,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:00,957 INFO L124 PetriNetUnfolderBase]: 550/1097 cut-off events. [2024-06-20 19:15:00,957 INFO L125 PetriNetUnfolderBase]: For 61726/61728 co-relation queries the response was YES. [2024-06-20 19:15:00,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4713 conditions, 1097 events. 550/1097 cut-off events. For 61726/61728 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6547 event pairs, 89 based on Foata normal form. 4/1100 useless extension candidates. Maximal degree in co-relation 4578. Up to 878 conditions per place. [2024-06-20 19:15:00,967 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 175 selfloop transitions, 66 changer transitions 0/244 dead transitions. [2024-06-20 19:15:00,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 244 transitions, 2202 flow [2024-06-20 19:15:00,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:15:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:15:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-20 19:15:00,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40175953079178883 [2024-06-20 19:15:00,968 INFO L175 Difference]: Start difference. First operand has 304 places, 232 transitions, 1692 flow. Second operand 11 states and 137 transitions. [2024-06-20 19:15:00,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 244 transitions, 2202 flow [2024-06-20 19:15:01,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 244 transitions, 1981 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-06-20 19:15:01,234 INFO L231 Difference]: Finished difference. Result has 305 places, 232 transitions, 1607 flow [2024-06-20 19:15:01,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1607, PETRI_PLACES=305, PETRI_TRANSITIONS=232} [2024-06-20 19:15:01,234 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 275 predicate places. [2024-06-20 19:15:01,235 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 232 transitions, 1607 flow [2024-06-20 19:15:01,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:01,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:01,235 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-20 19:15:01,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-20 19:15:01,235 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-20 19:15:01,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1574771180, now seen corresponding path program 8 times [2024-06-20 19:15:01,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:01,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783739723] [2024-06-20 19:15:01,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:01,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:07,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-20 19:15:07,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:07,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783739723] [2024-06-20 19:15:07,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783739723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:07,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:07,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:15:07,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349688818] [2024-06-20 19:15:07,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:07,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:15:07,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:07,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:15:07,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:15:07,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:15:07,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 232 transitions, 1607 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:07,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:07,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:15:07,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:07,900 INFO L124 PetriNetUnfolderBase]: 565/1128 cut-off events. [2024-06-20 19:15:07,900 INFO L125 PetriNetUnfolderBase]: For 100081/100081 co-relation queries the response was YES. [2024-06-20 19:15:07,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 1128 events. 565/1128 cut-off events. For 100081/100081 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6740 event pairs, 99 based on Foata normal form. 8/1134 useless extension candidates. Maximal degree in co-relation 4588. Up to 848 conditions per place. [2024-06-20 19:15:07,911 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 162 selfloop transitions, 76 changer transitions 9/250 dead transitions. [2024-06-20 19:15:07,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 250 transitions, 2203 flow [2024-06-20 19:15:07,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:15:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:15:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2024-06-20 19:15:07,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-20 19:15:07,912 INFO L175 Difference]: Start difference. First operand has 305 places, 232 transitions, 1607 flow. Second operand 12 states and 148 transitions. [2024-06-20 19:15:07,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 250 transitions, 2203 flow [2024-06-20 19:15:08,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 250 transitions, 1965 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-20 19:15:08,136 INFO L231 Difference]: Finished difference. Result has 306 places, 231 transitions, 1521 flow [2024-06-20 19:15:08,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1521, PETRI_PLACES=306, PETRI_TRANSITIONS=231} [2024-06-20 19:15:08,137 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 276 predicate places. [2024-06-20 19:15:08,137 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 231 transitions, 1521 flow [2024-06-20 19:15:08,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:08,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:08,137 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-20 19:15:08,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-20 19:15:08,138 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-20 19:15:08,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:08,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1909033658, now seen corresponding path program 9 times [2024-06-20 19:15:08,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:08,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152175158] [2024-06-20 19:15:08,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:08,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:13,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:13,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:13,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152175158] [2024-06-20 19:15:13,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152175158] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:13,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:13,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:15:13,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318572098] [2024-06-20 19:15:13,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:13,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:15:13,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:13,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:15:13,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:15:14,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:15:14,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 231 transitions, 1521 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:14,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:14,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:15:14,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:14,676 INFO L124 PetriNetUnfolderBase]: 563/1128 cut-off events. [2024-06-20 19:15:14,676 INFO L125 PetriNetUnfolderBase]: For 99428/99430 co-relation queries the response was YES. [2024-06-20 19:15:14,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4619 conditions, 1128 events. 563/1128 cut-off events. For 99428/99430 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6784 event pairs, 93 based on Foata normal form. 10/1137 useless extension candidates. Maximal degree in co-relation 4482. Up to 880 conditions per place. [2024-06-20 19:15:14,687 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 168 selfloop transitions, 69 changer transitions 9/249 dead transitions. [2024-06-20 19:15:14,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 249 transitions, 2115 flow [2024-06-20 19:15:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:15:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:15:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 146 transitions. [2024-06-20 19:15:14,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3924731182795699 [2024-06-20 19:15:14,689 INFO L175 Difference]: Start difference. First operand has 306 places, 231 transitions, 1521 flow. Second operand 12 states and 146 transitions. [2024-06-20 19:15:14,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 249 transitions, 2115 flow [2024-06-20 19:15:14,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 249 transitions, 1957 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-20 19:15:14,950 INFO L231 Difference]: Finished difference. Result has 306 places, 230 transitions, 1501 flow [2024-06-20 19:15:14,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1501, PETRI_PLACES=306, PETRI_TRANSITIONS=230} [2024-06-20 19:15:14,951 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 276 predicate places. [2024-06-20 19:15:14,951 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 230 transitions, 1501 flow [2024-06-20 19:15:14,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:14,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:14,952 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-20 19:15:14,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-20 19:15:14,954 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-20 19:15:14,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:14,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1429708124, now seen corresponding path program 10 times [2024-06-20 19:15:14,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:14,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618482964] [2024-06-20 19:15:14,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:14,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:20,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:20,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618482964] [2024-06-20 19:15:20,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618482964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:20,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:20,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:15:20,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049888522] [2024-06-20 19:15:20,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:20,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:15:20,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:20,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:15:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:15:20,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:15:20,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 230 transitions, 1501 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:20,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:20,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:15:20,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:21,261 INFO L124 PetriNetUnfolderBase]: 558/1125 cut-off events. [2024-06-20 19:15:21,262 INFO L125 PetriNetUnfolderBase]: For 99302/99304 co-relation queries the response was YES. [2024-06-20 19:15:21,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4583 conditions, 1125 events. 558/1125 cut-off events. For 99302/99304 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6743 event pairs, 95 based on Foata normal form. 10/1134 useless extension candidates. Maximal degree in co-relation 4446. Up to 861 conditions per place. [2024-06-20 19:15:21,272 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 165 selfloop transitions, 72 changer transitions 7/247 dead transitions. [2024-06-20 19:15:21,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 247 transitions, 2083 flow [2024-06-20 19:15:21,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-20 19:15:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-20 19:15:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 159 transitions. [2024-06-20 19:15:21,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3945409429280397 [2024-06-20 19:15:21,274 INFO L175 Difference]: Start difference. First operand has 306 places, 230 transitions, 1501 flow. Second operand 13 states and 159 transitions. [2024-06-20 19:15:21,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 247 transitions, 2083 flow [2024-06-20 19:15:21,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 247 transitions, 1939 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-20 19:15:21,642 INFO L231 Difference]: Finished difference. Result has 306 places, 227 transitions, 1490 flow [2024-06-20 19:15:21,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1490, PETRI_PLACES=306, PETRI_TRANSITIONS=227} [2024-06-20 19:15:21,642 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 276 predicate places. [2024-06-20 19:15:21,643 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 227 transitions, 1490 flow [2024-06-20 19:15:21,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:21,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:21,643 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-20 19:15:21,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-20 19:15:21,644 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-20 19:15:21,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:21,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1916452268, now seen corresponding path program 11 times [2024-06-20 19:15:21,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:21,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128909250] [2024-06-20 19:15:21,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:21,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:27,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:27,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128909250] [2024-06-20 19:15:27,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128909250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:27,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:27,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:15:27,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135885799] [2024-06-20 19:15:27,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:27,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:15:27,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:27,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:15:27,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:15:28,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:15:28,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 227 transitions, 1490 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:28,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:28,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:15:28,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:28,719 INFO L124 PetriNetUnfolderBase]: 571/1158 cut-off events. [2024-06-20 19:15:28,719 INFO L125 PetriNetUnfolderBase]: For 136321/136323 co-relation queries the response was YES. [2024-06-20 19:15:28,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5676 conditions, 1158 events. 571/1158 cut-off events. For 136321/136323 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6981 event pairs, 105 based on Foata normal form. 8/1165 useless extension candidates. Maximal degree in co-relation 5540. Up to 833 conditions per place. [2024-06-20 19:15:28,730 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 169 selfloop transitions, 68 changer transitions 7/247 dead transitions. [2024-06-20 19:15:28,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 247 transitions, 2340 flow [2024-06-20 19:15:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:15:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:15:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 151 transitions. [2024-06-20 19:15:28,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40591397849462363 [2024-06-20 19:15:28,732 INFO L175 Difference]: Start difference. First operand has 306 places, 227 transitions, 1490 flow. Second operand 12 states and 151 transitions. [2024-06-20 19:15:28,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 247 transitions, 2340 flow [2024-06-20 19:15:29,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 247 transitions, 2176 flow, removed 9 selfloop flow, removed 13 redundant places. [2024-06-20 19:15:29,135 INFO L231 Difference]: Finished difference. Result has 303 places, 224 transitions, 1455 flow [2024-06-20 19:15:29,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1455, PETRI_PLACES=303, PETRI_TRANSITIONS=224} [2024-06-20 19:15:29,136 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 273 predicate places. [2024-06-20 19:15:29,136 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 224 transitions, 1455 flow [2024-06-20 19:15:29,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:29,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:29,136 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-20 19:15:29,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-20 19:15:29,137 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-20 19:15:29,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1916183498, now seen corresponding path program 12 times [2024-06-20 19:15:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:29,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433922293] [2024-06-20 19:15:29,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:36,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:36,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433922293] [2024-06-20 19:15:36,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433922293] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:36,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:36,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:15:36,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234720311] [2024-06-20 19:15:36,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:36,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:15:36,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:36,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:15:36,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:15:36,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:15:36,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 224 transitions, 1455 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:36,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:36,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:15:36,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:37,014 INFO L124 PetriNetUnfolderBase]: 561/1136 cut-off events. [2024-06-20 19:15:37,015 INFO L125 PetriNetUnfolderBase]: For 135296/135298 co-relation queries the response was YES. [2024-06-20 19:15:37,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5269 conditions, 1136 events. 561/1136 cut-off events. For 135296/135298 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6804 event pairs, 108 based on Foata normal form. 10/1145 useless extension candidates. Maximal degree in co-relation 5134. Up to 876 conditions per place. [2024-06-20 19:15:37,026 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 160 selfloop transitions, 63 changer transitions 14/240 dead transitions. [2024-06-20 19:15:37,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 240 transitions, 2017 flow [2024-06-20 19:15:37,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:15:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:15:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 147 transitions. [2024-06-20 19:15:37,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951612903225806 [2024-06-20 19:15:37,027 INFO L175 Difference]: Start difference. First operand has 303 places, 224 transitions, 1455 flow. Second operand 12 states and 147 transitions. [2024-06-20 19:15:37,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 240 transitions, 2017 flow [2024-06-20 19:15:37,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 240 transitions, 1879 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-20 19:15:37,384 INFO L231 Difference]: Finished difference. Result has 300 places, 217 transitions, 1411 flow [2024-06-20 19:15:37,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1411, PETRI_PLACES=300, PETRI_TRANSITIONS=217} [2024-06-20 19:15:37,385 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 270 predicate places. [2024-06-20 19:15:37,385 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 217 transitions, 1411 flow [2024-06-20 19:15:37,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:37,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:37,385 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-20 19:15:37,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-20 19:15:37,385 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-20 19:15:37,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:37,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1760012922, now seen corresponding path program 13 times [2024-06-20 19:15:37,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:37,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967616056] [2024-06-20 19:15:37,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:37,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:43,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:43,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967616056] [2024-06-20 19:15:43,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967616056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:43,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:43,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:15:43,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029574513] [2024-06-20 19:15:43,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:43,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:15:43,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:43,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:15:43,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:15:43,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:15:43,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 217 transitions, 1411 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:43,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:43,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:15:43,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:44,397 INFO L124 PetriNetUnfolderBase]: 566/1151 cut-off events. [2024-06-20 19:15:44,397 INFO L125 PetriNetUnfolderBase]: For 166084/166084 co-relation queries the response was YES. [2024-06-20 19:15:44,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6257 conditions, 1151 events. 566/1151 cut-off events. For 166084/166084 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6838 event pairs, 117 based on Foata normal form. 6/1156 useless extension candidates. Maximal degree in co-relation 6124. Up to 980 conditions per place. [2024-06-20 19:15:44,409 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 208 selfloop transitions, 21 changer transitions 6/238 dead transitions. [2024-06-20 19:15:44,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 238 transitions, 2235 flow [2024-06-20 19:15:44,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-20 19:15:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-20 19:15:44,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 153 transitions. [2024-06-20 19:15:44,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37965260545905705 [2024-06-20 19:15:44,410 INFO L175 Difference]: Start difference. First operand has 300 places, 217 transitions, 1411 flow. Second operand 13 states and 153 transitions. [2024-06-20 19:15:44,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 238 transitions, 2235 flow [2024-06-20 19:15:44,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 238 transitions, 2087 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-20 19:15:44,981 INFO L231 Difference]: Finished difference. Result has 295 places, 215 transitions, 1309 flow [2024-06-20 19:15:44,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1309, PETRI_PLACES=295, PETRI_TRANSITIONS=215} [2024-06-20 19:15:44,981 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 265 predicate places. [2024-06-20 19:15:44,981 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 215 transitions, 1309 flow [2024-06-20 19:15:44,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:44,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:44,982 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-20 19:15:44,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-20 19:15:44,982 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-20 19:15:44,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:44,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1180348154, now seen corresponding path program 14 times [2024-06-20 19:15:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:44,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950691191] [2024-06-20 19:15:44,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:44,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:51,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-20 19:15:51,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:51,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950691191] [2024-06-20 19:15:51,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950691191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:51,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:51,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:15:51,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387476606] [2024-06-20 19:15:51,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:51,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:15:51,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:51,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:15:51,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:15:51,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:15:51,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 215 transitions, 1309 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:51,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:51,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:15:51,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:51,969 INFO L124 PetriNetUnfolderBase]: 582/1183 cut-off events. [2024-06-20 19:15:51,969 INFO L125 PetriNetUnfolderBase]: For 206036/206036 co-relation queries the response was YES. [2024-06-20 19:15:51,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7166 conditions, 1183 events. 582/1183 cut-off events. For 206036/206036 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 7114 event pairs, 127 based on Foata normal form. 6/1188 useless extension candidates. Maximal degree in co-relation 7035. Up to 1025 conditions per place. [2024-06-20 19:15:51,981 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 210 selfloop transitions, 16 changer transitions 6/235 dead transitions. [2024-06-20 19:15:51,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 235 transitions, 2115 flow [2024-06-20 19:15:51,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:15:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:15:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-20 19:15:51,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-20 19:15:51,982 INFO L175 Difference]: Start difference. First operand has 295 places, 215 transitions, 1309 flow. Second operand 12 states and 141 transitions. [2024-06-20 19:15:51,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 235 transitions, 2115 flow [2024-06-20 19:15:52,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 235 transitions, 2067 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-20 19:15:52,625 INFO L231 Difference]: Finished difference. Result has 293 places, 213 transitions, 1289 flow [2024-06-20 19:15:52,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1265, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1289, PETRI_PLACES=293, PETRI_TRANSITIONS=213} [2024-06-20 19:15:52,626 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 263 predicate places. [2024-06-20 19:15:52,626 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 213 transitions, 1289 flow [2024-06-20 19:15:52,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:52,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:52,626 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-20 19:15:52,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-20 19:15:52,627 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-20 19:15:52,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash 149323536, now seen corresponding path program 15 times [2024-06-20 19:15:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081147981] [2024-06-20 19:15:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:52,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:58,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:58,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081147981] [2024-06-20 19:15:58,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081147981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:58,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:58,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:15:58,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124107562] [2024-06-20 19:15:58,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:58,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:15:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:58,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:15:58,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:15:59,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:15:59,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 213 transitions, 1289 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:59,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:59,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:15:59,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:59,627 INFO L124 PetriNetUnfolderBase]: 583/1182 cut-off events. [2024-06-20 19:15:59,628 INFO L125 PetriNetUnfolderBase]: For 215440/215440 co-relation queries the response was YES. [2024-06-20 19:15:59,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7159 conditions, 1182 events. 583/1182 cut-off events. For 215440/215440 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 7126 event pairs, 136 based on Foata normal form. 8/1188 useless extension candidates. Maximal degree in co-relation 7029. Up to 912 conditions per place. [2024-06-20 19:15:59,640 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 150 selfloop transitions, 69 changer transitions 9/231 dead transitions. [2024-06-20 19:15:59,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 231 transitions, 1839 flow [2024-06-20 19:15:59,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:15:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:15:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2024-06-20 19:15:59,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40053763440860213 [2024-06-20 19:15:59,641 INFO L175 Difference]: Start difference. First operand has 293 places, 213 transitions, 1289 flow. Second operand 12 states and 149 transitions. [2024-06-20 19:15:59,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 231 transitions, 1839 flow [2024-06-20 19:16:00,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 231 transitions, 1805 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-20 19:16:00,468 INFO L231 Difference]: Finished difference. Result has 293 places, 212 transitions, 1393 flow [2024-06-20 19:16:00,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1393, PETRI_PLACES=293, PETRI_TRANSITIONS=212} [2024-06-20 19:16:00,469 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 263 predicate places. [2024-06-20 19:16:00,469 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 212 transitions, 1393 flow [2024-06-20 19:16:00,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:00,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:00,469 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-20 19:16:00,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-20 19:16:00,470 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-20 19:16:00,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:00,471 INFO L85 PathProgramCache]: Analyzing trace with hash -659585976, now seen corresponding path program 16 times [2024-06-20 19:16:00,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:00,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904531368] [2024-06-20 19:16:00,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:00,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904531368] [2024-06-20 19:16:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904531368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:06,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:06,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:16:06,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696492304] [2024-06-20 19:16:06,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:06,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:16:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:16:06,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:16:06,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:16:06,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 212 transitions, 1393 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:06,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:06,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:16:06,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:06,922 INFO L124 PetriNetUnfolderBase]: 578/1175 cut-off events. [2024-06-20 19:16:06,923 INFO L125 PetriNetUnfolderBase]: For 210294/210294 co-relation queries the response was YES. [2024-06-20 19:16:06,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7218 conditions, 1175 events. 578/1175 cut-off events. For 210294/210294 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 7081 event pairs, 136 based on Foata normal form. 8/1181 useless extension candidates. Maximal degree in co-relation 7088. Up to 897 conditions per place. [2024-06-20 19:16:06,935 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 145 selfloop transitions, 71 changer transitions 9/228 dead transitions. [2024-06-20 19:16:06,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 228 transitions, 1927 flow [2024-06-20 19:16:06,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:16:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:16:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 150 transitions. [2024-06-20 19:16:06,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-20 19:16:06,936 INFO L175 Difference]: Start difference. First operand has 293 places, 212 transitions, 1393 flow. Second operand 12 states and 150 transitions. [2024-06-20 19:16:06,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 228 transitions, 1927 flow [2024-06-20 19:16:07,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 228 transitions, 1783 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-20 19:16:07,656 INFO L231 Difference]: Finished difference. Result has 292 places, 209 transitions, 1378 flow [2024-06-20 19:16:07,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1249, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1378, PETRI_PLACES=292, PETRI_TRANSITIONS=209} [2024-06-20 19:16:07,656 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 262 predicate places. [2024-06-20 19:16:07,657 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 209 transitions, 1378 flow [2024-06-20 19:16:07,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:07,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:07,657 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-20 19:16:07,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-20 19:16:07,657 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-20 19:16:07,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash 261407504, now seen corresponding path program 17 times [2024-06-20 19:16:07,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:07,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108044320] [2024-06-20 19:16:07,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:07,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:13,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:13,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108044320] [2024-06-20 19:16:13,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108044320] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:13,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:13,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:16:13,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191574144] [2024-06-20 19:16:13,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:13,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:16:13,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:13,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:16:13,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:16:13,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:16:13,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 209 transitions, 1378 flow. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:13,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:13,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:16:13,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:13,790 INFO L124 PetriNetUnfolderBase]: 576/1177 cut-off events. [2024-06-20 19:16:13,791 INFO L125 PetriNetUnfolderBase]: For 210195/210197 co-relation queries the response was YES. [2024-06-20 19:16:13,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7217 conditions, 1177 events. 576/1177 cut-off events. For 210195/210197 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 7066 event pairs, 132 based on Foata normal form. 10/1186 useless extension candidates. Maximal degree in co-relation 7088. Up to 937 conditions per place. [2024-06-20 19:16:13,799 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 158 selfloop transitions, 57 changer transitions 9/227 dead transitions. [2024-06-20 19:16:13,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 227 transitions, 1924 flow [2024-06-20 19:16:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:16:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:16:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2024-06-20 19:16:13,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40053763440860213 [2024-06-20 19:16:13,801 INFO L175 Difference]: Start difference. First operand has 292 places, 209 transitions, 1378 flow. Second operand 12 states and 149 transitions. [2024-06-20 19:16:13,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 227 transitions, 1924 flow [2024-06-20 19:16:14,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 227 transitions, 1766 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-20 19:16:14,558 INFO L231 Difference]: Finished difference. Result has 291 places, 208 transitions, 1342 flow [2024-06-20 19:16:14,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1342, PETRI_PLACES=291, PETRI_TRANSITIONS=208} [2024-06-20 19:16:14,559 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 261 predicate places. [2024-06-20 19:16:14,559 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 208 transitions, 1342 flow [2024-06-20 19:16:14,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:14,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:14,559 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-20 19:16:14,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-20 19:16:14,560 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-20 19:16:14,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:14,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2073721452, now seen corresponding path program 18 times [2024-06-20 19:16:14,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:14,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437652875] [2024-06-20 19:16:14,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:14,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15