./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix000.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/mix000.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix000.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 21:04:20,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 21:04:20,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 21:04:20,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 21:04:20,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 21:04:20,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 21:04:20,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 21:04:20,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 21:04:20,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 21:04:20,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 21:04:20,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 21:04:20,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 21:04:20,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 21:04:20,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 21:04:20,973 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 21:04:20,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 21:04:20,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 21:04:20,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 21:04:20,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 21:04:20,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 21:04:20,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 21:04:20,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 21:04:20,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 21:04:20,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 21:04:20,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 21:04:20,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 21:04:20,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 21:04:20,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 21:04:20,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 21:04:20,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 21:04:20,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 21:04:20,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 21:04:20,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:04:20,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 21:04:20,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 21:04:20,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 21:04:20,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 21:04:20,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 21:04:20,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 21:04:20,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 21:04:20,981 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 21:04:20,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 21:04:20,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 21:04:20,981 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 21:04:21,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 21:04:21,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 21:04:21,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 21:04:21,231 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 21:04:21,232 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 21:04:21,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2024-06-03 21:04:22,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 21:04:22,449 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 21:04:22,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2024-06-03 21:04:22,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18ff5e0b8/f3b44667eecf470c8bc18e3f02780ad6/FLAG07139eb77 [2024-06-03 21:04:22,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18ff5e0b8/f3b44667eecf470c8bc18e3f02780ad6 [2024-06-03 21:04:22,491 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 21:04:22,492 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 21:04:22,492 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/mix000.opt.yml/witness.yml [2024-06-03 21:04:22,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 21:04:22,653 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 21:04:22,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 21:04:22,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 21:04:22,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 21:04:22,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:04:22" (1/2) ... [2024-06-03 21:04:22,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ea137b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:04:22, skipping insertion in model container [2024-06-03 21:04:22,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:04:22" (1/2) ... [2024-06-03 21:04:22,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2f3d946a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:04:22, skipping insertion in model container [2024-06-03 21:04:22,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:04:22" (2/2) ... [2024-06-03 21:04:22,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ea137b1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:22, skipping insertion in model container [2024-06-03 21:04:22,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:04:22" (2/2) ... [2024-06-03 21:04:22,663 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 21:04:22,742 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 21:04:22,743 INFO L97 edCorrectnessWitness]: Location invariant before [L830-L830] (((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_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_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_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$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$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 )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )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_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )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_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )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_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (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_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$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_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$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_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (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$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$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$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_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )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_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )y >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (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 )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) [2024-06-03 21:04:22,744 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] (((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_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_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_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$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$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 )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )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_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )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_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )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_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (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_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$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_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$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_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (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$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$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$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_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )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_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )y >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (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 )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) [2024-06-03 21:04:22,744 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 21:04:22,745 INFO L106 edCorrectnessWitness]: ghost_update [L827-L827] multithreaded = 1; [2024-06-03 21:04:22,785 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 21:04:23,060 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:04:23,071 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 21:04:23,316 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:04:23,343 INFO L206 MainTranslator]: Completed translation [2024-06-03 21:04:23,344 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23 WrapperNode [2024-06-03 21:04:23,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 21:04:23,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 21:04:23,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 21:04:23,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 21:04:23,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23" (1/1) ... [2024-06-03 21:04:23,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23" (1/1) ... [2024-06-03 21:04:23,439 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-06-03 21:04:23,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 21:04:23,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 21:04:23,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 21:04:23,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 21:04:23,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23" (1/1) ... [2024-06-03 21:04:23,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23" (1/1) ... [2024-06-03 21:04:23,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23" (1/1) ... [2024-06-03 21:04:23,500 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-03 21:04:23,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23" (1/1) ... [2024-06-03 21:04:23,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23" (1/1) ... [2024-06-03 21:04:23,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23" (1/1) ... [2024-06-03 21:04:23,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23" (1/1) ... [2024-06-03 21:04:23,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23" (1/1) ... [2024-06-03 21:04:23,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23" (1/1) ... [2024-06-03 21:04:23,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 21:04:23,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 21:04:23,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 21:04:23,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 21:04:23,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23" (1/1) ... [2024-06-03 21:04:23,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:04:23,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:04:23,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-03 21:04:23,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-03 21:04:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 21:04:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 21:04:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 21:04:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 21:04:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 21:04:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 21:04:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 21:04:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 21:04:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 21:04:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 21:04:23,622 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 21:04:23,743 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 21:04:23,745 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 21:04:24,583 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 21:04:24,584 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 21:04:24,792 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 21:04:24,792 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 21:04:24,798 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:04:24 BoogieIcfgContainer [2024-06-03 21:04:24,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 21:04:24,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 21:04:24,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 21:04:24,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 21:04:24,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:04:22" (1/4) ... [2024-06-03 21:04:24,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdb4e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:04:24, skipping insertion in model container [2024-06-03 21:04:24,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:04:22" (2/4) ... [2024-06-03 21:04:24,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdb4e88 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:04:24, skipping insertion in model container [2024-06-03 21:04:24,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23" (3/4) ... [2024-06-03 21:04:24,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdb4e88 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:04:24, skipping insertion in model container [2024-06-03 21:04:24,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:04:24" (4/4) ... [2024-06-03 21:04:24,807 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2024-06-03 21:04:24,820 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 21:04:24,821 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 21:04:24,821 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 21:04:24,895 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 21:04:24,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-03 21:04:24,973 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-03 21:04:24,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:04:24,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 21:04:24,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-03 21:04:24,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-03 21:04:25,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 21:04:25,015 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;@7cd45671, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 21:04:25,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 21:04:25,026 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 21:04:25,026 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-03 21:04:25,026 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:04:25,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:04:25,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 21:04:25,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:04:25,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:04:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1642904383, now seen corresponding path program 1 times [2024-06-03 21:04:25,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:04:25,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40908625] [2024-06-03 21:04:25,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:04:25,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:04:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:04:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:04:29,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:04:29,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40908625] [2024-06-03 21:04:29,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40908625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:04:29,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:04:29,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 21:04:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509582808] [2024-06-03 21:04:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:04:29,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 21:04:29,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:04:29,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 21:04:29,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 21:04:30,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-03 21:04:30,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:04:30,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:04:30,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-03 21:04:30,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:04:30,227 INFO L124 PetriNetUnfolderBase]: 131/262 cut-off events. [2024-06-03 21:04:30,227 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-03 21:04:30,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 262 events. 131/262 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1025 event pairs, 75 based on Foata normal form. 1/252 useless extension candidates. Maximal degree in co-relation 506. Up to 235 conditions per place. [2024-06-03 21:04:30,231 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 22 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-03 21:04:30,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 119 flow [2024-06-03 21:04:30,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 21:04:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 21:04:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-06-03 21:04:30,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-06-03 21:04:30,241 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 57 transitions. [2024-06-03 21:04:30,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 119 flow [2024-06-03 21:04:30,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 21:04:30,245 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-03 21:04:30,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-03 21:04:30,249 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-03 21:04:30,249 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-03 21:04:30,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:04:30,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:04:30,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:04:30,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 21:04:30,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-03 21:04:30,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:04:30,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1717139950, now seen corresponding path program 1 times [2024-06-03 21:04:30,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:04:30,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978033685] [2024-06-03 21:04:30,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:04:30,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:04:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:04:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:04:33,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:04:33,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978033685] [2024-06-03 21:04:33,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978033685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:04:33,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:04:33,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 21:04:33,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880026623] [2024-06-03 21:04:33,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:04:33,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 21:04:33,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:04:33,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 21:04:33,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 21:04:33,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 21:04:33,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:04:33,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:04:33,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 21:04:33,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:04:34,106 INFO L124 PetriNetUnfolderBase]: 186/342 cut-off events. [2024-06-03 21:04:34,107 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-06-03 21:04:34,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 342 events. 186/342 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1273 event pairs, 94 based on Foata normal form. 2/341 useless extension candidates. Maximal degree in co-relation 771. Up to 319 conditions per place. [2024-06-03 21:04:34,112 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 28 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-03 21:04:34,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 165 flow [2024-06-03 21:04:34,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 21:04:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 21:04:34,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-03 21:04:34,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2024-06-03 21:04:34,116 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 67 transitions. [2024-06-03 21:04:34,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 165 flow [2024-06-03 21:04:34,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 21:04:34,119 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-03 21:04:34,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-03 21:04:34,120 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-03 21:04:34,121 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-03 21:04:34,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:04:34,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:04:34,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:04:34,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 21:04:34,122 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:04:34,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:04:34,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1683688252, now seen corresponding path program 1 times [2024-06-03 21:04:34,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:04:34,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249283854] [2024-06-03 21:04:34,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:04:34,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:04:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:04:37,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-03 21:04:37,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:04:37,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249283854] [2024-06-03 21:04:37,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249283854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:04:37,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:04:37,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 21:04:37,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539629720] [2024-06-03 21:04:37,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:04:37,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 21:04:37,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:04:37,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 21:04:37,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-03 21:04:37,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 21:04:37,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:04:37,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:04:37,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 21:04:37,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:04:37,925 INFO L124 PetriNetUnfolderBase]: 183/337 cut-off events. [2024-06-03 21:04:37,925 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-06-03 21:04:37,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 337 events. 183/337 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1246 event pairs, 73 based on Foata normal form. 2/337 useless extension candidates. Maximal degree in co-relation 843. Up to 305 conditions per place. [2024-06-03 21:04:37,927 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 32 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-03 21:04:37,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 213 flow [2024-06-03 21:04:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:04:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:04:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-06-03 21:04:37,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50625 [2024-06-03 21:04:37,931 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 81 transitions. [2024-06-03 21:04:37,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 213 flow [2024-06-03 21:04:37,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 204 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 21:04:37,934 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-03 21:04:37,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-03 21:04:37,936 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-03 21:04:37,936 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-03 21:04:37,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:04:37,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:04:37,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:04:37,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 21:04:37,937 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:04:37,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:04:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash 654729215, now seen corresponding path program 1 times [2024-06-03 21:04:37,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:04:37,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274628610] [2024-06-03 21:04:37,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:04:37,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:04:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:04:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:04:41,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:04:41,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274628610] [2024-06-03 21:04:41,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274628610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:04:41,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:04:41,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:04:41,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324352325] [2024-06-03 21:04:41,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:04:41,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:04:41,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:04:41,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:04:41,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:04:42,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 21:04:42,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:04:42,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:04:42,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 21:04:42,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:04:42,327 INFO L124 PetriNetUnfolderBase]: 180/332 cut-off events. [2024-06-03 21:04:42,327 INFO L125 PetriNetUnfolderBase]: For 332/332 co-relation queries the response was YES. [2024-06-03 21:04:42,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 332 events. 180/332 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1216 event pairs, 52 based on Foata normal form. 2/332 useless extension candidates. Maximal degree in co-relation 910. Up to 291 conditions per place. [2024-06-03 21:04:42,330 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 9 changer transitions 0/48 dead transitions. [2024-06-03 21:04:42,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 261 flow [2024-06-03 21:04:42,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:04:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:04:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-03 21:04:42,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-06-03 21:04:42,334 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 6 states and 95 transitions. [2024-06-03 21:04:42,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 261 flow [2024-06-03 21:04:42,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 246 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 21:04:42,337 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 145 flow [2024-06-03 21:04:42,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2024-06-03 21:04:42,338 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-03 21:04:42,339 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 145 flow [2024-06-03 21:04:42,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:04:42,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:04:42,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:04:42,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 21:04:42,339 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-03 21:04:42,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:04:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1621724491, now seen corresponding path program 1 times [2024-06-03 21:04:42,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:04:42,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573902053] [2024-06-03 21:04:42,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:04:42,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:04:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:04:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:04:47,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:04:47,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573902053] [2024-06-03 21:04:47,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573902053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:04:47,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:04:47,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:04:47,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379163621] [2024-06-03 21:04:47,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:04:47,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:04:47,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:04:47,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:04:47,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:04:48,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-03 21:04:48,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:04:48,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:04:48,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-03 21:04:48,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:04:48,239 INFO L124 PetriNetUnfolderBase]: 137/284 cut-off events. [2024-06-03 21:04:48,240 INFO L125 PetriNetUnfolderBase]: For 406/406 co-relation queries the response was YES. [2024-06-03 21:04:48,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 284 events. 137/284 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1111 event pairs, 42 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 816. Up to 243 conditions per place. [2024-06-03 21:04:48,241 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 27 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2024-06-03 21:04:48,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 229 flow [2024-06-03 21:04:48,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:04:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:04:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-06-03 21:04:48,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-06-03 21:04:48,243 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 145 flow. Second operand 5 states and 74 transitions. [2024-06-03 21:04:48,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 229 flow [2024-06-03 21:04:48,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 208 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 21:04:48,248 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 151 flow [2024-06-03 21:04:48,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2024-06-03 21:04:48,253 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2024-06-03 21:04:48,253 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 151 flow [2024-06-03 21:04:48,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:04:48,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:04:48,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:04:48,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 21:04:48,255 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:04:48,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:04:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2129581982, now seen corresponding path program 1 times [2024-06-03 21:04:48,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:04:48,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121443598] [2024-06-03 21:04:48,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:04:48,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:04:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:04:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:04:52,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:04:52,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121443598] [2024-06-03 21:04:52,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121443598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:04:52,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:04:52,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:04:52,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008372657] [2024-06-03 21:04:52,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:04:52,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:04:52,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:04:52,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:04:52,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:04:52,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 21:04:52,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 151 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-03 21:04:52,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:04:52,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 21:04:52,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:04:53,001 INFO L124 PetriNetUnfolderBase]: 174/321 cut-off events. [2024-06-03 21:04:53,001 INFO L125 PetriNetUnfolderBase]: For 646/646 co-relation queries the response was YES. [2024-06-03 21:04:53,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 321 events. 174/321 cut-off events. For 646/646 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1150 event pairs, 29 based on Foata normal form. 4/323 useless extension candidates. Maximal degree in co-relation 989. Up to 262 conditions per place. [2024-06-03 21:04:53,003 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 38 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2024-06-03 21:04:53,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 281 flow [2024-06-03 21:04:53,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:04:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:04:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-03 21:04:53,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-03 21:04:53,005 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 151 flow. Second operand 7 states and 104 transitions. [2024-06-03 21:04:53,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 281 flow [2024-06-03 21:04:53,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 270 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 21:04:53,006 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 154 flow [2024-06-03 21:04:53,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2024-06-03 21:04:53,007 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2024-06-03 21:04:53,007 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 154 flow [2024-06-03 21:04:53,007 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-03 21:04:53,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:04:53,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:04:53,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 21:04:53,008 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:04:53,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:04:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1276874622, now seen corresponding path program 1 times [2024-06-03 21:04:53,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:04:53,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757761953] [2024-06-03 21:04:53,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:04:53,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:04:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:05:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:05:00,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:05:00,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757761953] [2024-06-03 21:05:00,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757761953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:05:00,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:05:00,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:05:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303759973] [2024-06-03 21:05:00,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:05:00,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:05:00,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:05:00,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:05:00,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:05:00,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-03 21:05:00,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:00,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:05:00,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-03 21:05:00,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:05:00,524 INFO L124 PetriNetUnfolderBase]: 131/271 cut-off events. [2024-06-03 21:05:00,524 INFO L125 PetriNetUnfolderBase]: For 682/682 co-relation queries the response was YES. [2024-06-03 21:05:00,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 271 events. 131/271 cut-off events. For 682/682 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1023 event pairs, 37 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 856. Up to 229 conditions per place. [2024-06-03 21:05:00,526 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 27 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2024-06-03 21:05:00,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 246 flow [2024-06-03 21:05:00,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:05:00,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:05:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-03 21:05:00,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2024-06-03 21:05:00,528 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 154 flow. Second operand 6 states and 85 transitions. [2024-06-03 21:05:00,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 246 flow [2024-06-03 21:05:00,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 220 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 21:05:00,530 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 161 flow [2024-06-03 21:05:00,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-06-03 21:05:00,530 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-03 21:05:00,531 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 161 flow [2024-06-03 21:05:00,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:00,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:05:00,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:05:00,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 21:05:00,531 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:05:00,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:05:00,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2075778054, now seen corresponding path program 1 times [2024-06-03 21:05:00,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:05:00,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997438270] [2024-06-03 21:05:00,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:05:00,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:05:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:05:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:05:06,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:05:06,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997438270] [2024-06-03 21:05:06,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997438270] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:05:06,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:05:06,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:05:06,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904280536] [2024-06-03 21:05:06,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:05:06,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:05:06,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:05:06,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:05:06,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:05:06,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:05:06,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 161 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:06,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:05:06,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:05:06,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:05:06,750 INFO L124 PetriNetUnfolderBase]: 173/320 cut-off events. [2024-06-03 21:05:06,751 INFO L125 PetriNetUnfolderBase]: For 987/987 co-relation queries the response was YES. [2024-06-03 21:05:06,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 320 events. 173/320 cut-off events. For 987/987 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1135 event pairs, 44 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 1072. Up to 294 conditions per place. [2024-06-03 21:05:06,753 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 35 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-03 21:05:06,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 277 flow [2024-06-03 21:05:06,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:05:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:05:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-06-03 21:05:06,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-03 21:05:06,754 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 161 flow. Second operand 6 states and 78 transitions. [2024-06-03 21:05:06,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 277 flow [2024-06-03 21:05:06,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 260 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 21:05:06,756 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 177 flow [2024-06-03 21:05:06,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-06-03 21:05:06,758 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-03 21:05:06,758 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 177 flow [2024-06-03 21:05:06,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:06,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:05:06,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:05:06,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 21:05:06,759 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:05:06,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:05:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash 595932692, now seen corresponding path program 2 times [2024-06-03 21:05:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:05:06,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642717205] [2024-06-03 21:05:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:05:06,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:05:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:05:11,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-03 21:05:11,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:05:11,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642717205] [2024-06-03 21:05:11,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642717205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:05:11,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:05:11,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:05:11,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055923315] [2024-06-03 21:05:11,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:05:11,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:05:11,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:05:11,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:05:11,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:05:12,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:05:12,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 177 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:12,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:05:12,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:05:12,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:05:12,296 INFO L124 PetriNetUnfolderBase]: 171/318 cut-off events. [2024-06-03 21:05:12,296 INFO L125 PetriNetUnfolderBase]: For 1231/1231 co-relation queries the response was YES. [2024-06-03 21:05:12,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 318 events. 171/318 cut-off events. For 1231/1231 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1147 event pairs, 45 based on Foata normal form. 1/316 useless extension candidates. Maximal degree in co-relation 1120. Up to 285 conditions per place. [2024-06-03 21:05:12,298 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 31 selfloop transitions, 13 changer transitions 0/47 dead transitions. [2024-06-03 21:05:12,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 307 flow [2024-06-03 21:05:12,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:05:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:05:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-03 21:05:12,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2024-06-03 21:05:12,299 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 177 flow. Second operand 7 states and 86 transitions. [2024-06-03 21:05:12,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 307 flow [2024-06-03 21:05:12,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 47 transitions, 286 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 21:05:12,301 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 220 flow [2024-06-03 21:05:12,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-06-03 21:05:12,302 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2024-06-03 21:05:12,302 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 220 flow [2024-06-03 21:05:12,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:12,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:05:12,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:05:12,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 21:05:12,302 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:05:12,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:05:12,303 INFO L85 PathProgramCache]: Analyzing trace with hash -103213844, now seen corresponding path program 1 times [2024-06-03 21:05:12,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:05:12,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212676980] [2024-06-03 21:05:12,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:05:12,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:05:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:05:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:05:17,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:05:17,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212676980] [2024-06-03 21:05:17,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212676980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:05:17,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:05:17,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:05:17,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012237278] [2024-06-03 21:05:17,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:05:17,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:05:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:05:17,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:05:17,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:05:17,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:05:17,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 220 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:17,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:05:17,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:05:17,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:05:18,199 INFO L124 PetriNetUnfolderBase]: 186/345 cut-off events. [2024-06-03 21:05:18,199 INFO L125 PetriNetUnfolderBase]: For 1550/1550 co-relation queries the response was YES. [2024-06-03 21:05:18,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 345 events. 186/345 cut-off events. For 1550/1550 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1258 event pairs, 44 based on Foata normal form. 1/344 useless extension candidates. Maximal degree in co-relation 1292. Up to 299 conditions per place. [2024-06-03 21:05:18,201 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 42 selfloop transitions, 17 changer transitions 0/62 dead transitions. [2024-06-03 21:05:18,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 425 flow [2024-06-03 21:05:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:05:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:05:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-03 21:05:18,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-03 21:05:18,203 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 220 flow. Second operand 8 states and 102 transitions. [2024-06-03 21:05:18,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 425 flow [2024-06-03 21:05:18,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 399 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-03 21:05:18,205 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 312 flow [2024-06-03 21:05:18,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=312, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2024-06-03 21:05:18,206 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2024-06-03 21:05:18,206 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 312 flow [2024-06-03 21:05:18,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:18,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:05:18,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:05:18,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 21:05:18,206 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:05:18,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:05:18,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1087242412, now seen corresponding path program 2 times [2024-06-03 21:05:18,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:05:18,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534721668] [2024-06-03 21:05:18,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:05:18,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:05:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:05:24,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-03 21:05:24,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:05:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534721668] [2024-06-03 21:05:24,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534721668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:05:24,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:05:24,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:05:24,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992214864] [2024-06-03 21:05:24,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:05:24,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:05:24,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:05:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:05:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:05:24,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:05:24,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 312 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:24,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:05:24,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:05:24,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:05:24,592 INFO L124 PetriNetUnfolderBase]: 192/357 cut-off events. [2024-06-03 21:05:24,592 INFO L125 PetriNetUnfolderBase]: For 2026/2026 co-relation queries the response was YES. [2024-06-03 21:05:24,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 357 events. 192/357 cut-off events. For 2026/2026 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1326 event pairs, 43 based on Foata normal form. 2/357 useless extension candidates. Maximal degree in co-relation 1435. Up to 299 conditions per place. [2024-06-03 21:05:24,595 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 43 selfloop transitions, 18 changer transitions 0/64 dead transitions. [2024-06-03 21:05:24,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 480 flow [2024-06-03 21:05:24,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:05:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:05:24,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-03 21:05:24,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-03 21:05:24,597 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 312 flow. Second operand 7 states and 92 transitions. [2024-06-03 21:05:24,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 480 flow [2024-06-03 21:05:24,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 456 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-03 21:05:24,600 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 350 flow [2024-06-03 21:05:24,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=350, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-06-03 21:05:24,600 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 32 predicate places. [2024-06-03 21:05:24,601 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 350 flow [2024-06-03 21:05:24,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:24,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:05:24,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:05:24,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 21:05:24,601 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:05:24,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:05:24,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1153185446, now seen corresponding path program 3 times [2024-06-03 21:05:24,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:05:24,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899923114] [2024-06-03 21:05:24,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:05:24,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:05:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:05:30,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-03 21:05:30,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:05:30,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899923114] [2024-06-03 21:05:30,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899923114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:05:30,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:05:30,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:05:30,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343809301] [2024-06-03 21:05:30,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:05:30,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:05:30,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:05:30,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:05:30,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:05:30,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:05:30,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 350 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:30,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:05:30,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:05:30,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:05:30,655 INFO L124 PetriNetUnfolderBase]: 195/362 cut-off events. [2024-06-03 21:05:30,656 INFO L125 PetriNetUnfolderBase]: For 2459/2459 co-relation queries the response was YES. [2024-06-03 21:05:30,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 362 events. 195/362 cut-off events. For 2459/2459 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1345 event pairs, 45 based on Foata normal form. 1/361 useless extension candidates. Maximal degree in co-relation 1540. Up to 301 conditions per place. [2024-06-03 21:05:30,658 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 42 selfloop transitions, 20 changer transitions 0/65 dead transitions. [2024-06-03 21:05:30,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 531 flow [2024-06-03 21:05:30,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:05:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:05:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-03 21:05:30,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2024-06-03 21:05:30,659 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 350 flow. Second operand 7 states and 90 transitions. [2024-06-03 21:05:30,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 531 flow [2024-06-03 21:05:30,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 65 transitions, 486 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-03 21:05:30,662 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 404 flow [2024-06-03 21:05:30,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=404, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-06-03 21:05:30,663 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-03 21:05:30,663 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 404 flow [2024-06-03 21:05:30,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:30,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:05:30,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:05:30,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 21:05:30,664 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:05:30,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:05:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash 75391297, now seen corresponding path program 1 times [2024-06-03 21:05:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:05:30,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052250614] [2024-06-03 21:05:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:05:30,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:05:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:05:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:05:37,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:05:37,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052250614] [2024-06-03 21:05:37,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052250614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:05:37,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:05:37,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:05:37,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152338741] [2024-06-03 21:05:37,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:05:37,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:05:37,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:05:37,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:05:37,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:05:37,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:05:37,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 404 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:37,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:05:37,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:05:37,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:05:37,851 INFO L124 PetriNetUnfolderBase]: 198/367 cut-off events. [2024-06-03 21:05:37,851 INFO L125 PetriNetUnfolderBase]: For 2889/2889 co-relation queries the response was YES. [2024-06-03 21:05:37,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 367 events. 198/367 cut-off events. For 2889/2889 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1364 event pairs, 42 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 1628. Up to 330 conditions per place. [2024-06-03 21:05:37,854 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 51 selfloop transitions, 13 changer transitions 0/67 dead transitions. [2024-06-03 21:05:37,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 562 flow [2024-06-03 21:05:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:05:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:05:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2024-06-03 21:05:37,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2024-06-03 21:05:37,856 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 404 flow. Second operand 7 states and 88 transitions. [2024-06-03 21:05:37,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 562 flow [2024-06-03 21:05:37,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 532 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-03 21:05:37,859 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 419 flow [2024-06-03 21:05:37,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=419, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2024-06-03 21:05:37,859 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2024-06-03 21:05:37,860 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 419 flow [2024-06-03 21:05:37,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:37,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:05:37,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:05:37,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 21:05:37,860 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:05:37,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:05:37,861 INFO L85 PathProgramCache]: Analyzing trace with hash 80955270, now seen corresponding path program 4 times [2024-06-03 21:05:37,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:05:37,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115307968] [2024-06-03 21:05:37,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:05:37,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:05:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:05:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:05:44,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:05:44,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115307968] [2024-06-03 21:05:44,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115307968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:05:44,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:05:44,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:05:44,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976130953] [2024-06-03 21:05:44,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:05:44,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:05:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:05:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:05:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:05:44,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:05:44,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 419 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:44,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:05:44,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:05:44,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:05:44,631 INFO L124 PetriNetUnfolderBase]: 204/382 cut-off events. [2024-06-03 21:05:44,632 INFO L125 PetriNetUnfolderBase]: For 3396/3396 co-relation queries the response was YES. [2024-06-03 21:05:44,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 382 events. 204/382 cut-off events. For 3396/3396 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1475 event pairs, 50 based on Foata normal form. 2/379 useless extension candidates. Maximal degree in co-relation 1758. Up to 295 conditions per place. [2024-06-03 21:05:44,634 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 43 selfloop transitions, 25 changer transitions 0/71 dead transitions. [2024-06-03 21:05:44,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 645 flow [2024-06-03 21:05:44,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:05:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:05:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-03 21:05:44,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-03 21:05:44,636 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 419 flow. Second operand 7 states and 92 transitions. [2024-06-03 21:05:44,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 645 flow [2024-06-03 21:05:44,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 71 transitions, 616 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 21:05:44,641 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 489 flow [2024-06-03 21:05:44,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=489, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2024-06-03 21:05:44,642 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2024-06-03 21:05:44,642 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 489 flow [2024-06-03 21:05:44,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:44,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:05:44,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:05:44,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 21:05:44,643 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:05:44,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:05:44,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1294045799, now seen corresponding path program 2 times [2024-06-03 21:05:44,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:05:44,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824017548] [2024-06-03 21:05:44,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:05:44,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:05:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:05:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:05:52,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:05:52,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824017548] [2024-06-03 21:05:52,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824017548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:05:52,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:05:52,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:05:52,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647704025] [2024-06-03 21:05:52,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:05:52,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:05:52,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:05:52,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:05:52,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:05:52,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:05:52,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 489 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:52,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:05:52,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:05:52,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:05:52,815 INFO L124 PetriNetUnfolderBase]: 207/387 cut-off events. [2024-06-03 21:05:52,815 INFO L125 PetriNetUnfolderBase]: For 3890/3890 co-relation queries the response was YES. [2024-06-03 21:05:52,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 387 events. 207/387 cut-off events. For 3890/3890 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1488 event pairs, 45 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 1867. Up to 339 conditions per place. [2024-06-03 21:05:52,819 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 52 selfloop transitions, 16 changer transitions 0/71 dead transitions. [2024-06-03 21:05:52,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 71 transitions, 653 flow [2024-06-03 21:05:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:05:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:05:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-03 21:05:52,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38839285714285715 [2024-06-03 21:05:52,820 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 489 flow. Second operand 7 states and 87 transitions. [2024-06-03 21:05:52,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 71 transitions, 653 flow [2024-06-03 21:05:52,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 71 transitions, 624 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-03 21:05:52,824 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 515 flow [2024-06-03 21:05:52,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=515, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2024-06-03 21:05:52,825 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2024-06-03 21:05:52,825 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 515 flow [2024-06-03 21:05:52,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:52,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:05:52,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:05:52,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 21:05:52,826 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:05:52,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:05:52,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1294312709, now seen corresponding path program 3 times [2024-06-03 21:05:52,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:05:52,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337408261] [2024-06-03 21:05:52,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:05:52,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:05:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:05:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:05:59,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:05:59,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337408261] [2024-06-03 21:05:59,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337408261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:05:59,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:05:59,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:05:59,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766285912] [2024-06-03 21:05:59,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:05:59,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:05:59,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:05:59,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:05:59,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:05:59,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 21:05:59,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 515 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:59,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:05:59,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 21:05:59,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:05:59,696 INFO L124 PetriNetUnfolderBase]: 205/384 cut-off events. [2024-06-03 21:05:59,696 INFO L125 PetriNetUnfolderBase]: For 4158/4158 co-relation queries the response was YES. [2024-06-03 21:05:59,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 384 events. 205/384 cut-off events. For 4158/4158 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1472 event pairs, 45 based on Foata normal form. 1/381 useless extension candidates. Maximal degree in co-relation 1911. Up to 327 conditions per place. [2024-06-03 21:05:59,699 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 51 selfloop transitions, 21 changer transitions 0/75 dead transitions. [2024-06-03 21:05:59,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 75 transitions, 701 flow [2024-06-03 21:05:59,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:05:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:05:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-03 21:05:59,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42410714285714285 [2024-06-03 21:05:59,700 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 515 flow. Second operand 7 states and 95 transitions. [2024-06-03 21:05:59,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 75 transitions, 701 flow [2024-06-03 21:05:59,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 662 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-03 21:05:59,707 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 566 flow [2024-06-03 21:05:59,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=566, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2024-06-03 21:05:59,707 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 48 predicate places. [2024-06-03 21:05:59,708 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 566 flow [2024-06-03 21:05:59,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:05:59,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:05:59,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:05:59,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 21:05:59,711 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:05:59,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:05:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1294322629, now seen corresponding path program 1 times [2024-06-03 21:05:59,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:05:59,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333633137] [2024-06-03 21:05:59,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:05:59,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:05:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:06:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:06:07,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:06:07,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333633137] [2024-06-03 21:06:07,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333633137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:06:07,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:06:07,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:06:07,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801119443] [2024-06-03 21:06:07,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:06:07,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:06:07,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:06:07,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:06:07,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:06:07,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-03 21:06:07,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 566 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:07,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:06:07,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-03 21:06:07,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:06:07,929 INFO L124 PetriNetUnfolderBase]: 188/363 cut-off events. [2024-06-03 21:06:07,930 INFO L125 PetriNetUnfolderBase]: For 4468/4472 co-relation queries the response was YES. [2024-06-03 21:06:07,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1884 conditions, 363 events. 188/363 cut-off events. For 4468/4472 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1429 event pairs, 42 based on Foata normal form. 5/365 useless extension candidates. Maximal degree in co-relation 1844. Up to 309 conditions per place. [2024-06-03 21:06:07,932 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 55 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2024-06-03 21:06:07,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 78 transitions, 724 flow [2024-06-03 21:06:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:06:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:06:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2024-06-03 21:06:07,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45089285714285715 [2024-06-03 21:06:07,933 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 566 flow. Second operand 7 states and 101 transitions. [2024-06-03 21:06:07,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 78 transitions, 724 flow [2024-06-03 21:06:07,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 78 transitions, 693 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-03 21:06:07,938 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 576 flow [2024-06-03 21:06:07,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2024-06-03 21:06:07,939 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 52 predicate places. [2024-06-03 21:06:07,939 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 576 flow [2024-06-03 21:06:07,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:07,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:06:07,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:06:07,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 21:06:07,939 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:06:07,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:06:07,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1962604071, now seen corresponding path program 1 times [2024-06-03 21:06:07,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:06:07,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722388333] [2024-06-03 21:06:07,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:06:07,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:06:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:06:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:06:15,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:06:15,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722388333] [2024-06-03 21:06:15,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722388333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:06:15,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:06:15,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:06:15,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713692916] [2024-06-03 21:06:15,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:06:15,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:06:15,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:06:15,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:06:15,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:06:15,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:06:15,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 576 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:15,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:06:15,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:06:15,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:06:15,622 INFO L124 PetriNetUnfolderBase]: 201/377 cut-off events. [2024-06-03 21:06:15,622 INFO L125 PetriNetUnfolderBase]: For 4767/4767 co-relation queries the response was YES. [2024-06-03 21:06:15,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2026 conditions, 377 events. 201/377 cut-off events. For 4767/4767 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1446 event pairs, 40 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 1985. Up to 310 conditions per place. [2024-06-03 21:06:15,625 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 65 selfloop transitions, 19 changer transitions 0/87 dead transitions. [2024-06-03 21:06:15,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 87 transitions, 808 flow [2024-06-03 21:06:15,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:06:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:06:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-03 21:06:15,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-03 21:06:15,626 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 576 flow. Second operand 8 states and 104 transitions. [2024-06-03 21:06:15,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 87 transitions, 808 flow [2024-06-03 21:06:15,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 87 transitions, 761 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 21:06:15,632 INFO L231 Difference]: Finished difference. Result has 85 places, 73 transitions, 600 flow [2024-06-03 21:06:15,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=600, PETRI_PLACES=85, PETRI_TRANSITIONS=73} [2024-06-03 21:06:15,633 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2024-06-03 21:06:15,633 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 73 transitions, 600 flow [2024-06-03 21:06:15,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:15,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:06:15,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:06:15,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 21:06:15,634 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:06:15,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:06:15,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1962483915, now seen corresponding path program 1 times [2024-06-03 21:06:15,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:06:15,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179385755] [2024-06-03 21:06:15,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:06:15,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:06:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:06:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:06:23,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:06:23,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179385755] [2024-06-03 21:06:23,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179385755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:06:23,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:06:23,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:06:23,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22410989] [2024-06-03 21:06:23,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:06:23,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:06:23,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:06:23,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:06:23,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:06:23,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-03 21:06:23,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 73 transitions, 600 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:23,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:06:23,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-03 21:06:23,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:06:23,874 INFO L124 PetriNetUnfolderBase]: 207/387 cut-off events. [2024-06-03 21:06:23,874 INFO L125 PetriNetUnfolderBase]: For 5498/5498 co-relation queries the response was YES. [2024-06-03 21:06:23,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2125 conditions, 387 events. 207/387 cut-off events. For 5498/5498 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1491 event pairs, 39 based on Foata normal form. 2/387 useless extension candidates. Maximal degree in co-relation 2083. Up to 317 conditions per place. [2024-06-03 21:06:23,877 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 62 selfloop transitions, 22 changer transitions 0/87 dead transitions. [2024-06-03 21:06:23,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 87 transitions, 822 flow [2024-06-03 21:06:23,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:06:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:06:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-03 21:06:23,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37109375 [2024-06-03 21:06:23,880 INFO L175 Difference]: Start difference. First operand has 85 places, 73 transitions, 600 flow. Second operand 8 states and 95 transitions. [2024-06-03 21:06:23,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 87 transitions, 822 flow [2024-06-03 21:06:23,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 87 transitions, 767 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-03 21:06:23,885 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 629 flow [2024-06-03 21:06:23,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=629, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2024-06-03 21:06:23,886 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-03 21:06:23,886 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 629 flow [2024-06-03 21:06:23,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:23,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:06:23,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:06:23,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 21:06:23,887 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:06:23,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:06:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1957842285, now seen corresponding path program 2 times [2024-06-03 21:06:23,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:06:23,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119178542] [2024-06-03 21:06:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:06:23,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:06:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:06:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:06:30,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:06:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119178542] [2024-06-03 21:06:30,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119178542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:06:30,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:06:30,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:06:30,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726809098] [2024-06-03 21:06:30,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:06:30,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:06:30,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:06:30,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:06:30,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:06:30,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:06:30,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 629 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:30,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:06:30,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:06:30,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:06:30,571 INFO L124 PetriNetUnfolderBase]: 214/399 cut-off events. [2024-06-03 21:06:30,571 INFO L125 PetriNetUnfolderBase]: For 6189/6189 co-relation queries the response was YES. [2024-06-03 21:06:30,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2261 conditions, 399 events. 214/399 cut-off events. For 6189/6189 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1544 event pairs, 41 based on Foata normal form. 2/399 useless extension candidates. Maximal degree in co-relation 2218. Up to 318 conditions per place. [2024-06-03 21:06:30,575 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 62 selfloop transitions, 24 changer transitions 0/89 dead transitions. [2024-06-03 21:06:30,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 89 transitions, 895 flow [2024-06-03 21:06:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:06:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:06:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-03 21:06:30,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-03 21:06:30,591 INFO L175 Difference]: Start difference. First operand has 87 places, 76 transitions, 629 flow. Second operand 8 states and 104 transitions. [2024-06-03 21:06:30,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 89 transitions, 895 flow [2024-06-03 21:06:30,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 89 transitions, 837 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-03 21:06:30,604 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 664 flow [2024-06-03 21:06:30,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=664, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2024-06-03 21:06:30,604 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-06-03 21:06:30,605 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 664 flow [2024-06-03 21:06:30,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:30,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:06:30,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:06:30,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 21:06:30,605 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:06:30,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:06:30,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1388414467, now seen corresponding path program 2 times [2024-06-03 21:06:30,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:06:30,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550567755] [2024-06-03 21:06:30,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:06:30,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:06:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:06:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:06:36,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:06:36,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550567755] [2024-06-03 21:06:36,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550567755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:06:36,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:06:36,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:06:36,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594398704] [2024-06-03 21:06:36,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:06:36,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:06:36,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:06:36,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:06:36,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:06:36,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:06:36,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 664 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:36,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:06:36,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:06:36,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:06:37,108 INFO L124 PetriNetUnfolderBase]: 211/394 cut-off events. [2024-06-03 21:06:37,108 INFO L125 PetriNetUnfolderBase]: For 6629/6629 co-relation queries the response was YES. [2024-06-03 21:06:37,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 394 events. 211/394 cut-off events. For 6629/6629 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1527 event pairs, 41 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 2232. Up to 321 conditions per place. [2024-06-03 21:06:37,111 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 63 selfloop transitions, 22 changer transitions 0/88 dead transitions. [2024-06-03 21:06:37,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 88 transitions, 856 flow [2024-06-03 21:06:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:06:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:06:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-03 21:06:37,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-03 21:06:37,112 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 664 flow. Second operand 8 states and 101 transitions. [2024-06-03 21:06:37,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 88 transitions, 856 flow [2024-06-03 21:06:37,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 88 transitions, 761 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-03 21:06:37,119 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 618 flow [2024-06-03 21:06:37,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=618, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2024-06-03 21:06:37,120 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 60 predicate places. [2024-06-03 21:06:37,120 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 618 flow [2024-06-03 21:06:37,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:37,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:06:37,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:06:37,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 21:06:37,121 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:06:37,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:06:37,122 INFO L85 PathProgramCache]: Analyzing trace with hash -444048529, now seen corresponding path program 3 times [2024-06-03 21:06:37,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:06:37,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864714117] [2024-06-03 21:06:37,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:06:37,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:06:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:06:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:06:44,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:06:44,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864714117] [2024-06-03 21:06:44,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864714117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:06:44,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:06:44,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:06:44,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636126635] [2024-06-03 21:06:44,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:06:44,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:06:44,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:06:44,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:06:44,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:06:44,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:06:44,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 618 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:44,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:06:44,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:06:44,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:06:45,030 INFO L124 PetriNetUnfolderBase]: 214/399 cut-off events. [2024-06-03 21:06:45,031 INFO L125 PetriNetUnfolderBase]: For 7068/7068 co-relation queries the response was YES. [2024-06-03 21:06:45,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 399 events. 214/399 cut-off events. For 7068/7068 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1544 event pairs, 41 based on Foata normal form. 1/398 useless extension candidates. Maximal degree in co-relation 2234. Up to 306 conditions per place. [2024-06-03 21:06:45,034 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 57 selfloop transitions, 30 changer transitions 0/90 dead transitions. [2024-06-03 21:06:45,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 90 transitions, 838 flow [2024-06-03 21:06:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:06:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:06:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-03 21:06:45,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2024-06-03 21:06:45,035 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 618 flow. Second operand 8 states and 103 transitions. [2024-06-03 21:06:45,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 90 transitions, 838 flow [2024-06-03 21:06:45,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 791 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-03 21:06:45,042 INFO L231 Difference]: Finished difference. Result has 92 places, 81 transitions, 664 flow [2024-06-03 21:06:45,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=664, PETRI_PLACES=92, PETRI_TRANSITIONS=81} [2024-06-03 21:06:45,043 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 61 predicate places. [2024-06-03 21:06:45,043 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 81 transitions, 664 flow [2024-06-03 21:06:45,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:45,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:06:45,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:06:45,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 21:06:45,043 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:06:45,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:06:45,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1388407523, now seen corresponding path program 1 times [2024-06-03 21:06:45,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:06:45,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858757743] [2024-06-03 21:06:45,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:06:45,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:06:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:06:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:06:52,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:06:52,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858757743] [2024-06-03 21:06:52,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858757743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:06:52,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:06:52,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:06:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724880854] [2024-06-03 21:06:52,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:06:52,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:06:52,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:06:52,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:06:52,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:06:52,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:06:52,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 81 transitions, 664 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:52,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:06:52,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:06:52,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:06:53,184 INFO L124 PetriNetUnfolderBase]: 220/409 cut-off events. [2024-06-03 21:06:53,185 INFO L125 PetriNetUnfolderBase]: For 7982/7982 co-relation queries the response was YES. [2024-06-03 21:06:53,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2407 conditions, 409 events. 220/409 cut-off events. For 7982/7982 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1599 event pairs, 38 based on Foata normal form. 2/409 useless extension candidates. Maximal degree in co-relation 2361. Up to 362 conditions per place. [2024-06-03 21:06:53,188 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 75 selfloop transitions, 15 changer transitions 0/93 dead transitions. [2024-06-03 21:06:53,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 93 transitions, 888 flow [2024-06-03 21:06:53,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:06:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:06:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-03 21:06:53,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38671875 [2024-06-03 21:06:53,191 INFO L175 Difference]: Start difference. First operand has 92 places, 81 transitions, 664 flow. Second operand 8 states and 99 transitions. [2024-06-03 21:06:53,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 93 transitions, 888 flow [2024-06-03 21:06:53,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 93 transitions, 811 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-03 21:06:53,198 INFO L231 Difference]: Finished difference. Result has 94 places, 83 transitions, 644 flow [2024-06-03 21:06:53,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=644, PETRI_PLACES=94, PETRI_TRANSITIONS=83} [2024-06-03 21:06:53,199 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 63 predicate places. [2024-06-03 21:06:53,199 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 83 transitions, 644 flow [2024-06-03 21:06:53,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:53,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:06:53,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:06:53,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 21:06:53,199 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:06:53,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:06:53,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1460708909, now seen corresponding path program 4 times [2024-06-03 21:06:53,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:06:53,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580404039] [2024-06-03 21:06:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:06:53,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:06:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:06:59,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-03 21:06:59,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:06:59,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580404039] [2024-06-03 21:06:59,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580404039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:06:59,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:06:59,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:06:59,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767753174] [2024-06-03 21:06:59,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:06:59,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:06:59,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:06:59,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:06:59,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:06:59,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-03 21:06:59,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 83 transitions, 644 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:59,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:06:59,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-03 21:06:59,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:06:59,807 INFO L124 PetriNetUnfolderBase]: 226/420 cut-off events. [2024-06-03 21:06:59,808 INFO L125 PetriNetUnfolderBase]: For 8641/8641 co-relation queries the response was YES. [2024-06-03 21:06:59,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2485 conditions, 420 events. 226/420 cut-off events. For 8641/8641 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1668 event pairs, 46 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 2438. Up to 328 conditions per place. [2024-06-03 21:06:59,811 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 63 selfloop transitions, 28 changer transitions 0/94 dead transitions. [2024-06-03 21:06:59,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 94 transitions, 898 flow [2024-06-03 21:06:59,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:06:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:06:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-03 21:06:59,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-03 21:06:59,812 INFO L175 Difference]: Start difference. First operand has 94 places, 83 transitions, 644 flow. Second operand 8 states and 94 transitions. [2024-06-03 21:06:59,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 94 transitions, 898 flow [2024-06-03 21:06:59,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 94 transitions, 857 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 21:06:59,820 INFO L231 Difference]: Finished difference. Result has 96 places, 86 transitions, 713 flow [2024-06-03 21:06:59,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=713, PETRI_PLACES=96, PETRI_TRANSITIONS=86} [2024-06-03 21:06:59,820 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 65 predicate places. [2024-06-03 21:06:59,820 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 86 transitions, 713 flow [2024-06-03 21:06:59,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:06:59,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:06:59,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:06:59,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 21:06:59,821 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:06:59,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:06:59,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1460715419, now seen corresponding path program 5 times [2024-06-03 21:06:59,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:06:59,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538383803] [2024-06-03 21:06:59,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:06:59,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:06:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:07:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:07:07,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:07:07,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538383803] [2024-06-03 21:07:07,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538383803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:07:07,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:07:07,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:07:07,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73609933] [2024-06-03 21:07:07,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:07:07,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:07:07,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:07:07,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:07:07,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:07:07,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:07:07,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 86 transitions, 713 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:07:07,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:07:07,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:07:07,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:07:07,832 INFO L124 PetriNetUnfolderBase]: 229/425 cut-off events. [2024-06-03 21:07:07,833 INFO L125 PetriNetUnfolderBase]: For 9296/9296 co-relation queries the response was YES. [2024-06-03 21:07:07,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2608 conditions, 425 events. 229/425 cut-off events. For 9296/9296 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1700 event pairs, 46 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 2560. Up to 327 conditions per place. [2024-06-03 21:07:07,836 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 62 selfloop transitions, 31 changer transitions 0/96 dead transitions. [2024-06-03 21:07:07,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 96 transitions, 963 flow [2024-06-03 21:07:07,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:07:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:07:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-03 21:07:07,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-03 21:07:07,837 INFO L175 Difference]: Start difference. First operand has 96 places, 86 transitions, 713 flow. Second operand 8 states and 104 transitions. [2024-06-03 21:07:07,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 96 transitions, 963 flow [2024-06-03 21:07:07,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 96 transitions, 875 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-03 21:07:07,845 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 728 flow [2024-06-03 21:07:07,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=728, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2024-06-03 21:07:07,845 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-03 21:07:07,846 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 88 transitions, 728 flow [2024-06-03 21:07:07,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:07:07,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:07:07,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:07:07,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 21:07:07,846 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:07:07,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:07:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1785345637, now seen corresponding path program 2 times [2024-06-03 21:07:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:07:07,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305616488] [2024-06-03 21:07:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:07:07,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:07:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:07:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:07:16,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:07:16,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305616488] [2024-06-03 21:07:16,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305616488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:07:16,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:07:16,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:07:16,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166963347] [2024-06-03 21:07:16,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:07:16,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:07:16,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:07:16,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:07:16,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:07:16,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:07:16,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 88 transitions, 728 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:07:16,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:07:16,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:07:16,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:07:16,710 INFO L124 PetriNetUnfolderBase]: 232/430 cut-off events. [2024-06-03 21:07:16,711 INFO L125 PetriNetUnfolderBase]: For 10016/10016 co-relation queries the response was YES. [2024-06-03 21:07:16,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2658 conditions, 430 events. 232/430 cut-off events. For 10016/10016 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1715 event pairs, 41 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 2609. Up to 379 conditions per place. [2024-06-03 21:07:16,724 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 76 selfloop transitions, 18 changer transitions 0/97 dead transitions. [2024-06-03 21:07:16,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 97 transitions, 952 flow [2024-06-03 21:07:16,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:07:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:07:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-03 21:07:16,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37890625 [2024-06-03 21:07:16,726 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 728 flow. Second operand 8 states and 97 transitions. [2024-06-03 21:07:16,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 97 transitions, 952 flow [2024-06-03 21:07:16,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 97 transitions, 865 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-03 21:07:16,734 INFO L231 Difference]: Finished difference. Result has 100 places, 90 transitions, 706 flow [2024-06-03 21:07:16,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=706, PETRI_PLACES=100, PETRI_TRANSITIONS=90} [2024-06-03 21:07:16,735 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 69 predicate places. [2024-06-03 21:07:16,735 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 90 transitions, 706 flow [2024-06-03 21:07:16,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:07:16,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:07:16,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:07:16,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 21:07:16,736 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:07:16,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:07:16,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1785115245, now seen corresponding path program 6 times [2024-06-03 21:07:16,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:07:16,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629250761] [2024-06-03 21:07:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:07:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:07:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:07:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:07:23,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:07:23,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629250761] [2024-06-03 21:07:23,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629250761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:07:23,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:07:23,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:07:23,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378379147] [2024-06-03 21:07:23,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:07:23,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:07:23,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:07:23,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:07:23,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:07:23,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:07:23,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 706 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:07:23,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:07:23,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:07:23,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:07:24,020 INFO L124 PetriNetUnfolderBase]: 230/427 cut-off events. [2024-06-03 21:07:24,020 INFO L125 PetriNetUnfolderBase]: For 10193/10193 co-relation queries the response was YES. [2024-06-03 21:07:24,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 427 events. 230/427 cut-off events. For 10193/10193 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1703 event pairs, 45 based on Foata normal form. 1/423 useless extension candidates. Maximal degree in co-relation 2563. Up to 300 conditions per place. [2024-06-03 21:07:24,024 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 53 selfloop transitions, 44 changer transitions 0/100 dead transitions. [2024-06-03 21:07:24,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 100 transitions, 970 flow [2024-06-03 21:07:24,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:07:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:07:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-03 21:07:24,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2024-06-03 21:07:24,026 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 706 flow. Second operand 8 states and 103 transitions. [2024-06-03 21:07:24,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 100 transitions, 970 flow [2024-06-03 21:07:24,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 100 transitions, 921 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 21:07:24,039 INFO L231 Difference]: Finished difference. Result has 102 places, 92 transitions, 790 flow [2024-06-03 21:07:24,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=790, PETRI_PLACES=102, PETRI_TRANSITIONS=92} [2024-06-03 21:07:24,039 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 71 predicate places. [2024-06-03 21:07:24,039 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 92 transitions, 790 flow [2024-06-03 21:07:24,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:07:24,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:07:24,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:07:24,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 21:07:24,040 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:07:24,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:07:24,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1785114997, now seen corresponding path program 3 times [2024-06-03 21:07:24,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:07:24,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387774946] [2024-06-03 21:07:24,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:07:24,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:07:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:07:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:07:31,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:07:31,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387774946] [2024-06-03 21:07:31,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387774946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:07:31,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:07:31,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:07:31,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114737667] [2024-06-03 21:07:31,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:07:31,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:07:31,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:07:31,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:07:31,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:07:31,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:07:31,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 790 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:07:31,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:07:31,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:07:31,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:07:31,496 INFO L124 PetriNetUnfolderBase]: 233/432 cut-off events. [2024-06-03 21:07:31,496 INFO L125 PetriNetUnfolderBase]: For 10958/10958 co-relation queries the response was YES. [2024-06-03 21:07:31,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2747 conditions, 432 events. 233/432 cut-off events. For 10958/10958 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1721 event pairs, 40 based on Foata normal form. 1/429 useless extension candidates. Maximal degree in co-relation 2696. Up to 359 conditions per place. [2024-06-03 21:07:31,500 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 75 selfloop transitions, 28 changer transitions 0/106 dead transitions. [2024-06-03 21:07:31,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 106 transitions, 1126 flow [2024-06-03 21:07:31,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:07:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:07:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-03 21:07:31,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-03 21:07:31,518 INFO L175 Difference]: Start difference. First operand has 102 places, 92 transitions, 790 flow. Second operand 8 states and 101 transitions. [2024-06-03 21:07:31,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 106 transitions, 1126 flow [2024-06-03 21:07:31,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 106 transitions, 1009 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-03 21:07:31,529 INFO L231 Difference]: Finished difference. Result has 105 places, 98 transitions, 810 flow [2024-06-03 21:07:31,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=810, PETRI_PLACES=105, PETRI_TRANSITIONS=98} [2024-06-03 21:07:31,533 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 74 predicate places. [2024-06-03 21:07:31,533 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 98 transitions, 810 flow [2024-06-03 21:07:31,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:07:31,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:07:31,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:07:31,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 21:07:31,534 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:07:31,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:07:31,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1469286547, now seen corresponding path program 4 times [2024-06-03 21:07:31,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:07:31,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801023130] [2024-06-03 21:07:31,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:07:31,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:07:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:07:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:07:38,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:07:38,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801023130] [2024-06-03 21:07:38,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801023130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:07:38,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:07:38,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:07:38,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739630974] [2024-06-03 21:07:38,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:07:38,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:07:38,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:07:38,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:07:38,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:07:38,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:07:38,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 98 transitions, 810 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:07:38,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:07:38,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:07:38,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:07:38,523 INFO L124 PetriNetUnfolderBase]: 234/433 cut-off events. [2024-06-03 21:07:38,523 INFO L125 PetriNetUnfolderBase]: For 11593/11593 co-relation queries the response was YES. [2024-06-03 21:07:38,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2735 conditions, 433 events. 234/433 cut-off events. For 11593/11593 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1706 event pairs, 40 based on Foata normal form. 2/433 useless extension candidates. Maximal degree in co-relation 2682. Up to 391 conditions per place. [2024-06-03 21:07:38,527 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 90 selfloop transitions, 14 changer transitions 0/107 dead transitions. [2024-06-03 21:07:38,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 107 transitions, 1060 flow [2024-06-03 21:07:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:07:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:07:38,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-03 21:07:38,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37890625 [2024-06-03 21:07:38,529 INFO L175 Difference]: Start difference. First operand has 105 places, 98 transitions, 810 flow. Second operand 8 states and 97 transitions. [2024-06-03 21:07:38,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 107 transitions, 1060 flow [2024-06-03 21:07:38,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 1005 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-03 21:07:38,539 INFO L231 Difference]: Finished difference. Result has 110 places, 100 transitions, 820 flow [2024-06-03 21:07:38,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=820, PETRI_PLACES=110, PETRI_TRANSITIONS=100} [2024-06-03 21:07:38,540 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 79 predicate places. [2024-06-03 21:07:38,540 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 100 transitions, 820 flow [2024-06-03 21:07:38,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:07:38,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:07:38,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:07:38,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 21:07:38,541 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:07:38,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:07:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1469297459, now seen corresponding path program 1 times [2024-06-03 21:07:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:07:38,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619331412] [2024-06-03 21:07:38,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:07:38,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:07:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:07:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:07:47,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:07:47,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619331412] [2024-06-03 21:07:47,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619331412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:07:47,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:07:47,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:07:47,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198958207] [2024-06-03 21:07:47,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:07:47,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:07:47,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:07:47,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:07:47,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:07:47,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 21:07:47,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 100 transitions, 820 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-03 21:07:47,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:07:47,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 21:07:47,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:07:47,875 INFO L124 PetriNetUnfolderBase]: 218/413 cut-off events. [2024-06-03 21:07:47,876 INFO L125 PetriNetUnfolderBase]: For 11452/11456 co-relation queries the response was YES. [2024-06-03 21:07:47,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 413 events. 218/413 cut-off events. For 11452/11456 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1662 event pairs, 37 based on Foata normal form. 6/416 useless extension candidates. Maximal degree in co-relation 2535. Up to 339 conditions per place. [2024-06-03 21:07:47,879 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 78 selfloop transitions, 13 changer transitions 0/109 dead transitions. [2024-06-03 21:07:47,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 1022 flow [2024-06-03 21:07:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:07:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:07:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-03 21:07:47,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-03 21:07:47,881 INFO L175 Difference]: Start difference. First operand has 110 places, 100 transitions, 820 flow. Second operand 9 states and 112 transitions. [2024-06-03 21:07:47,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 1022 flow [2024-06-03 21:07:47,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 977 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-03 21:07:47,892 INFO L231 Difference]: Finished difference. Result has 113 places, 100 transitions, 805 flow [2024-06-03 21:07:47,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=805, PETRI_PLACES=113, PETRI_TRANSITIONS=100} [2024-06-03 21:07:47,893 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 82 predicate places. [2024-06-03 21:07:47,893 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 805 flow [2024-06-03 21:07:47,893 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-03 21:07:47,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:07:47,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:07:47,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 21:07:47,894 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:07:47,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:07:47,894 INFO L85 PathProgramCache]: Analyzing trace with hash -711182526, now seen corresponding path program 1 times [2024-06-03 21:07:47,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:07:47,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12760349] [2024-06-03 21:07:47,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:07:47,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:07:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:07:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:07:56,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:07:56,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12760349] [2024-06-03 21:07:56,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12760349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:07:56,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:07:56,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:07:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103014482] [2024-06-03 21:07:56,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:07:56,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:07:56,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:07:56,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:07:56,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:07:56,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:07:56,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 100 transitions, 805 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:07:56,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:07:56,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:07:56,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:07:56,840 INFO L124 PetriNetUnfolderBase]: 234/435 cut-off events. [2024-06-03 21:07:56,840 INFO L125 PetriNetUnfolderBase]: For 11697/11697 co-relation queries the response was YES. [2024-06-03 21:07:56,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 435 events. 234/435 cut-off events. For 11697/11697 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1728 event pairs, 35 based on Foata normal form. 1/434 useless extension candidates. Maximal degree in co-relation 2699. Up to 363 conditions per place. [2024-06-03 21:07:56,843 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 93 selfloop transitions, 21 changer transitions 0/117 dead transitions. [2024-06-03 21:07:56,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 1111 flow [2024-06-03 21:07:56,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:07:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:07:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 21:07:56,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-03 21:07:56,845 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 805 flow. Second operand 9 states and 114 transitions. [2024-06-03 21:07:56,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 1111 flow [2024-06-03 21:07:56,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 117 transitions, 1079 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 21:07:56,855 INFO L231 Difference]: Finished difference. Result has 115 places, 102 transitions, 860 flow [2024-06-03 21:07:56,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=860, PETRI_PLACES=115, PETRI_TRANSITIONS=102} [2024-06-03 21:07:56,856 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-03 21:07:56,856 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 102 transitions, 860 flow [2024-06-03 21:07:56,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:07:56,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:07:56,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:07:56,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 21:07:56,857 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:07:56,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:07:56,857 INFO L85 PathProgramCache]: Analyzing trace with hash -707457659, now seen corresponding path program 1 times [2024-06-03 21:07:56,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:07:56,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908660273] [2024-06-03 21:07:56,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:07:56,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:07:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:08:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:08:05,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:08:05,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908660273] [2024-06-03 21:08:05,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908660273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:08:05,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:08:05,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:08:05,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410590956] [2024-06-03 21:08:05,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:08:05,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:08:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:08:05,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:08:05,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:08:05,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:08:05,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 102 transitions, 860 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:08:05,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:08:05,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:08:05,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:08:05,929 INFO L124 PetriNetUnfolderBase]: 240/445 cut-off events. [2024-06-03 21:08:05,929 INFO L125 PetriNetUnfolderBase]: For 13118/13118 co-relation queries the response was YES. [2024-06-03 21:08:05,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2884 conditions, 445 events. 240/445 cut-off events. For 13118/13118 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1788 event pairs, 34 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 2827. Up to 367 conditions per place. [2024-06-03 21:08:05,932 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 89 selfloop transitions, 25 changer transitions 0/117 dead transitions. [2024-06-03 21:08:05,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 1164 flow [2024-06-03 21:08:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:08:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:08:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 21:08:05,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-03 21:08:05,934 INFO L175 Difference]: Start difference. First operand has 115 places, 102 transitions, 860 flow. Second operand 9 states and 114 transitions. [2024-06-03 21:08:05,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 1164 flow [2024-06-03 21:08:05,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 1093 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-03 21:08:05,949 INFO L231 Difference]: Finished difference. Result has 117 places, 105 transitions, 897 flow [2024-06-03 21:08:05,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=897, PETRI_PLACES=117, PETRI_TRANSITIONS=105} [2024-06-03 21:08:05,950 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 86 predicate places. [2024-06-03 21:08:05,950 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 105 transitions, 897 flow [2024-06-03 21:08:05,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:08:05,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:08:05,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:08:05,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 21:08:05,950 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:08:05,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:08:05,951 INFO L85 PathProgramCache]: Analyzing trace with hash -96530786, now seen corresponding path program 2 times [2024-06-03 21:08:05,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:08:05,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548037761] [2024-06-03 21:08:05,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:08:05,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:08:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:08:16,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:08:16,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:08:16,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548037761] [2024-06-03 21:08:16,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548037761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:08:16,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:08:16,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:08:16,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2894787] [2024-06-03 21:08:16,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:08:16,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:08:16,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:08:16,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:08:16,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:08:16,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:08:16,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 105 transitions, 897 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:08:16,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:08:16,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:08:16,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:08:16,553 INFO L124 PetriNetUnfolderBase]: 243/452 cut-off events. [2024-06-03 21:08:16,554 INFO L125 PetriNetUnfolderBase]: For 13758/13758 co-relation queries the response was YES. [2024-06-03 21:08:16,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 452 events. 243/452 cut-off events. For 13758/13758 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1834 event pairs, 34 based on Foata normal form. 1/451 useless extension candidates. Maximal degree in co-relation 2929. Up to 375 conditions per place. [2024-06-03 21:08:16,556 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 92 selfloop transitions, 24 changer transitions 0/119 dead transitions. [2024-06-03 21:08:16,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 119 transitions, 1201 flow [2024-06-03 21:08:16,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:08:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:08:16,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-03 21:08:16,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-03 21:08:16,558 INFO L175 Difference]: Start difference. First operand has 117 places, 105 transitions, 897 flow. Second operand 9 states and 113 transitions. [2024-06-03 21:08:16,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 119 transitions, 1201 flow [2024-06-03 21:08:16,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 119 transitions, 1115 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-03 21:08:16,571 INFO L231 Difference]: Finished difference. Result has 119 places, 107 transitions, 910 flow [2024-06-03 21:08:16,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=910, PETRI_PLACES=119, PETRI_TRANSITIONS=107} [2024-06-03 21:08:16,572 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2024-06-03 21:08:16,572 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 107 transitions, 910 flow [2024-06-03 21:08:16,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:08:16,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:08:16,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:08:16,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 21:08:16,572 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:08:16,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:08:16,573 INFO L85 PathProgramCache]: Analyzing trace with hash -90958939, now seen corresponding path program 2 times [2024-06-03 21:08:16,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:08:16,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480617527] [2024-06-03 21:08:16,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:08:16,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:08:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:08:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:08:24,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:08:24,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480617527] [2024-06-03 21:08:24,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480617527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:08:24,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:08:24,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:08:24,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237341277] [2024-06-03 21:08:24,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:08:24,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:08:24,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:08:24,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:08:24,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:08:24,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:08:24,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 107 transitions, 910 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:08:24,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:08:24,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:08:24,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:08:24,586 INFO L124 PetriNetUnfolderBase]: 269/494 cut-off events. [2024-06-03 21:08:24,587 INFO L125 PetriNetUnfolderBase]: For 17965/17965 co-relation queries the response was YES. [2024-06-03 21:08:24,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3426 conditions, 494 events. 269/494 cut-off events. For 17965/17965 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2031 event pairs, 34 based on Foata normal form. 2/494 useless extension candidates. Maximal degree in co-relation 3367. Up to 353 conditions per place. [2024-06-03 21:08:24,590 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 83 selfloop transitions, 39 changer transitions 0/125 dead transitions. [2024-06-03 21:08:24,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 125 transitions, 1348 flow [2024-06-03 21:08:24,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:08:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:08:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-03 21:08:24,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-03 21:08:24,605 INFO L175 Difference]: Start difference. First operand has 119 places, 107 transitions, 910 flow. Second operand 9 states and 118 transitions. [2024-06-03 21:08:24,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 125 transitions, 1348 flow [2024-06-03 21:08:24,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 125 transitions, 1265 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-03 21:08:24,623 INFO L231 Difference]: Finished difference. Result has 122 places, 112 transitions, 1011 flow [2024-06-03 21:08:24,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1011, PETRI_PLACES=122, PETRI_TRANSITIONS=112} [2024-06-03 21:08:24,624 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 91 predicate places. [2024-06-03 21:08:24,624 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 112 transitions, 1011 flow [2024-06-03 21:08:24,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:08:24,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:08:24,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:08:24,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 21:08:24,624 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:08:24,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:08:24,625 INFO L85 PathProgramCache]: Analyzing trace with hash -90966379, now seen corresponding path program 3 times [2024-06-03 21:08:24,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:08:24,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396917315] [2024-06-03 21:08:24,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:08:24,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:08:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:08:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:08:33,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:08:33,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396917315] [2024-06-03 21:08:33,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396917315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:08:33,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:08:33,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:08:33,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690518367] [2024-06-03 21:08:33,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:08:33,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:08:33,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:08:33,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:08:33,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:08:33,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:08:33,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 112 transitions, 1011 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:08:33,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:08:33,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:08:33,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:08:34,170 INFO L124 PetriNetUnfolderBase]: 272/499 cut-off events. [2024-06-03 21:08:34,170 INFO L125 PetriNetUnfolderBase]: For 18624/18624 co-relation queries the response was YES. [2024-06-03 21:08:34,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 499 events. 272/499 cut-off events. For 18624/18624 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2058 event pairs, 36 based on Foata normal form. 1/498 useless extension candidates. Maximal degree in co-relation 3523. Up to 379 conditions per place. [2024-06-03 21:08:34,174 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 88 selfloop transitions, 39 changer transitions 0/130 dead transitions. [2024-06-03 21:08:34,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 130 transitions, 1489 flow [2024-06-03 21:08:34,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:08:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:08:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-03 21:08:34,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-03 21:08:34,175 INFO L175 Difference]: Start difference. First operand has 122 places, 112 transitions, 1011 flow. Second operand 9 states and 116 transitions. [2024-06-03 21:08:34,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 130 transitions, 1489 flow [2024-06-03 21:08:34,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 130 transitions, 1381 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-03 21:08:34,194 INFO L231 Difference]: Finished difference. Result has 127 places, 119 transitions, 1149 flow [2024-06-03 21:08:34,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1149, PETRI_PLACES=127, PETRI_TRANSITIONS=119} [2024-06-03 21:08:34,194 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2024-06-03 21:08:34,194 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 119 transitions, 1149 flow [2024-06-03 21:08:34,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:08:34,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:08:34,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:08:34,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 21:08:34,195 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:08:34,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:08:34,195 INFO L85 PathProgramCache]: Analyzing trace with hash -90966596, now seen corresponding path program 3 times [2024-06-03 21:08:34,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:08:34,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457246507] [2024-06-03 21:08:34,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:08:34,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:08:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:08:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:08:46,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:08:46,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457246507] [2024-06-03 21:08:46,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457246507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:08:46,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:08:46,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:08:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994825694] [2024-06-03 21:08:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:08:46,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:08:46,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:08:46,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:08:46,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:08:46,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:08:46,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 119 transitions, 1149 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:08:46,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:08:46,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:08:46,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:08:46,524 INFO L124 PetriNetUnfolderBase]: 280/516 cut-off events. [2024-06-03 21:08:46,524 INFO L125 PetriNetUnfolderBase]: For 20407/20407 co-relation queries the response was YES. [2024-06-03 21:08:46,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3822 conditions, 516 events. 280/516 cut-off events. For 20407/20407 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2160 event pairs, 36 based on Foata normal form. 1/515 useless extension candidates. Maximal degree in co-relation 3758. Up to 405 conditions per place. [2024-06-03 21:08:46,527 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 97 selfloop transitions, 34 changer transitions 0/134 dead transitions. [2024-06-03 21:08:46,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 134 transitions, 1603 flow [2024-06-03 21:08:46,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:08:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:08:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 21:08:46,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-03 21:08:46,529 INFO L175 Difference]: Start difference. First operand has 127 places, 119 transitions, 1149 flow. Second operand 9 states and 114 transitions. [2024-06-03 21:08:46,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 134 transitions, 1603 flow [2024-06-03 21:08:46,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 134 transitions, 1540 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-03 21:08:46,551 INFO L231 Difference]: Finished difference. Result has 132 places, 123 transitions, 1259 flow [2024-06-03 21:08:46,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1259, PETRI_PLACES=132, PETRI_TRANSITIONS=123} [2024-06-03 21:08:46,553 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-06-03 21:08:46,553 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 123 transitions, 1259 flow [2024-06-03 21:08:46,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:08:46,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:08:46,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:08:46,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 21:08:46,554 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:08:46,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:08:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash -563567129, now seen corresponding path program 4 times [2024-06-03 21:08:46,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:08:46,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81663134] [2024-06-03 21:08:46,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:08:46,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:08:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:08:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:08:53,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:08:53,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81663134] [2024-06-03 21:08:53,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81663134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:08:53,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:08:53,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:08:53,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708700922] [2024-06-03 21:08:53,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:08:53,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:08:53,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:08:53,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:08:53,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:08:53,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:08:53,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 123 transitions, 1259 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:08:53,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:08:53,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:08:53,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:08:54,115 INFO L124 PetriNetUnfolderBase]: 276/510 cut-off events. [2024-06-03 21:08:54,115 INFO L125 PetriNetUnfolderBase]: For 20982/20982 co-relation queries the response was YES. [2024-06-03 21:08:54,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3786 conditions, 510 events. 276/510 cut-off events. For 20982/20982 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2132 event pairs, 36 based on Foata normal form. 2/510 useless extension candidates. Maximal degree in co-relation 3720. Up to 417 conditions per place. [2024-06-03 21:08:54,120 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 103 selfloop transitions, 27 changer transitions 0/133 dead transitions. [2024-06-03 21:08:54,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 133 transitions, 1543 flow [2024-06-03 21:08:54,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:08:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:08:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 21:08:54,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-03 21:08:54,124 INFO L175 Difference]: Start difference. First operand has 132 places, 123 transitions, 1259 flow. Second operand 9 states and 114 transitions. [2024-06-03 21:08:54,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 133 transitions, 1543 flow [2024-06-03 21:08:54,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 133 transitions, 1431 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-03 21:08:54,148 INFO L231 Difference]: Finished difference. Result has 136 places, 123 transitions, 1207 flow [2024-06-03 21:08:54,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1207, PETRI_PLACES=136, PETRI_TRANSITIONS=123} [2024-06-03 21:08:54,149 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 105 predicate places. [2024-06-03 21:08:54,149 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 123 transitions, 1207 flow [2024-06-03 21:08:54,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:08:54,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:08:54,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:08:54,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 21:08:54,149 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:08:54,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:08:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash -563567346, now seen corresponding path program 4 times [2024-06-03 21:08:54,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:08:54,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125574253] [2024-06-03 21:08:54,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:08:54,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:08:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:09:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:09:07,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:09:07,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125574253] [2024-06-03 21:09:07,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125574253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:09:07,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:09:07,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:09:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147533933] [2024-06-03 21:09:07,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:09:07,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:09:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:09:07,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:09:07,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:09:07,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:09:07,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 123 transitions, 1207 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:09:07,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:09:07,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:09:07,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:09:07,490 INFO L124 PetriNetUnfolderBase]: 274/507 cut-off events. [2024-06-03 21:09:07,491 INFO L125 PetriNetUnfolderBase]: For 19890/19890 co-relation queries the response was YES. [2024-06-03 21:09:07,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3715 conditions, 507 events. 274/507 cut-off events. For 19890/19890 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2112 event pairs, 36 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 3647. Up to 417 conditions per place. [2024-06-03 21:09:07,501 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 104 selfloop transitions, 26 changer transitions 0/133 dead transitions. [2024-06-03 21:09:07,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 133 transitions, 1491 flow [2024-06-03 21:09:07,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:09:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:09:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-03 21:09:07,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-03 21:09:07,504 INFO L175 Difference]: Start difference. First operand has 136 places, 123 transitions, 1207 flow. Second operand 9 states and 113 transitions. [2024-06-03 21:09:07,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 133 transitions, 1491 flow [2024-06-03 21:09:07,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 133 transitions, 1401 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-03 21:09:07,534 INFO L231 Difference]: Finished difference. Result has 138 places, 123 transitions, 1174 flow [2024-06-03 21:09:07,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1174, PETRI_PLACES=138, PETRI_TRANSITIONS=123} [2024-06-03 21:09:07,535 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 107 predicate places. [2024-06-03 21:09:07,535 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 123 transitions, 1174 flow [2024-06-03 21:09:07,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:09:07,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:09:07,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:09:07,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 21:09:07,536 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:09:07,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:09:07,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1705693285, now seen corresponding path program 5 times [2024-06-03 21:09:07,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:09:07,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229815610] [2024-06-03 21:09:07,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:09:07,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:09:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:09:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:09:16,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:09:16,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229815610] [2024-06-03 21:09:16,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229815610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:09:16,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:09:16,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:09:16,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354542169] [2024-06-03 21:09:16,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:09:16,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:09:16,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:09:16,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:09:16,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:09:16,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:09:16,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 123 transitions, 1174 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:09:16,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:09:16,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:09:16,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:09:16,645 INFO L124 PetriNetUnfolderBase]: 277/512 cut-off events. [2024-06-03 21:09:16,645 INFO L125 PetriNetUnfolderBase]: For 20748/20748 co-relation queries the response was YES. [2024-06-03 21:09:16,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3742 conditions, 512 events. 277/512 cut-off events. For 20748/20748 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2128 event pairs, 37 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 3673. Up to 467 conditions per place. [2024-06-03 21:09:16,656 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 116 selfloop transitions, 14 changer transitions 0/133 dead transitions. [2024-06-03 21:09:16,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 133 transitions, 1486 flow [2024-06-03 21:09:16,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:09:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:09:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-03 21:09:16,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-03 21:09:16,658 INFO L175 Difference]: Start difference. First operand has 138 places, 123 transitions, 1174 flow. Second operand 9 states and 105 transitions. [2024-06-03 21:09:16,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 133 transitions, 1486 flow [2024-06-03 21:09:16,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 133 transitions, 1405 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 21:09:16,695 INFO L231 Difference]: Finished difference. Result has 139 places, 125 transitions, 1164 flow [2024-06-03 21:09:16,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1164, PETRI_PLACES=139, PETRI_TRANSITIONS=125} [2024-06-03 21:09:16,695 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 108 predicate places. [2024-06-03 21:09:16,696 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 125 transitions, 1164 flow [2024-06-03 21:09:16,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:09:16,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:09:16,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:09:16,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 21:09:16,696 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:09:16,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:09:16,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1705960195, now seen corresponding path program 6 times [2024-06-03 21:09:16,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:09:16,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238234238] [2024-06-03 21:09:16,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:09:16,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:09:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:09:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:09:24,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:09:24,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238234238] [2024-06-03 21:09:24,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238234238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:09:24,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:09:24,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:09:24,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601175298] [2024-06-03 21:09:24,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:09:24,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:09:24,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:09:24,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:09:24,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:09:24,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:09:24,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 125 transitions, 1164 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:09:24,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:09:24,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:09:24,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:09:25,151 INFO L124 PetriNetUnfolderBase]: 290/534 cut-off events. [2024-06-03 21:09:25,152 INFO L125 PetriNetUnfolderBase]: For 23477/23477 co-relation queries the response was YES. [2024-06-03 21:09:25,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4002 conditions, 534 events. 290/534 cut-off events. For 23477/23477 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2262 event pairs, 42 based on Foata normal form. 1/530 useless extension candidates. Maximal degree in co-relation 3932. Up to 344 conditions per place. [2024-06-03 21:09:25,156 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 78 selfloop transitions, 62 changer transitions 0/143 dead transitions. [2024-06-03 21:09:25,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 143 transitions, 1786 flow [2024-06-03 21:09:25,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:09:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:09:25,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-03 21:09:25,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-03 21:09:25,175 INFO L175 Difference]: Start difference. First operand has 139 places, 125 transitions, 1164 flow. Second operand 9 states and 118 transitions. [2024-06-03 21:09:25,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 143 transitions, 1786 flow [2024-06-03 21:09:25,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 143 transitions, 1728 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 21:09:25,211 INFO L231 Difference]: Finished difference. Result has 142 places, 133 transitions, 1442 flow [2024-06-03 21:09:25,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1442, PETRI_PLACES=142, PETRI_TRANSITIONS=133} [2024-06-03 21:09:25,212 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2024-06-03 21:09:25,212 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 133 transitions, 1442 flow [2024-06-03 21:09:25,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:09:25,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:09:25,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:09:25,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 21:09:25,213 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:09:25,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:09:25,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1962662515, now seen corresponding path program 7 times [2024-06-03 21:09:25,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:09:25,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626308486] [2024-06-03 21:09:25,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:09:25,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:09:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:09:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:09:32,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:09:32,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626308486] [2024-06-03 21:09:32,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626308486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:09:32,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:09:32,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:09:32,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633849084] [2024-06-03 21:09:32,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:09:32,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:09:32,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:09:32,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:09:32,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:09:32,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:09:32,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 133 transitions, 1442 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:09:32,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:09:32,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:09:32,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:09:33,174 INFO L124 PetriNetUnfolderBase]: 297/546 cut-off events. [2024-06-03 21:09:33,174 INFO L125 PetriNetUnfolderBase]: For 26561/26561 co-relation queries the response was YES. [2024-06-03 21:09:33,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4285 conditions, 546 events. 297/546 cut-off events. For 26561/26561 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2343 event pairs, 43 based on Foata normal form. 4/545 useless extension candidates. Maximal degree in co-relation 4213. Up to 434 conditions per place. [2024-06-03 21:09:33,179 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 110 selfloop transitions, 33 changer transitions 0/146 dead transitions. [2024-06-03 21:09:33,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 1854 flow [2024-06-03 21:09:33,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:09:33,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:09:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 21:09:33,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-03 21:09:33,198 INFO L175 Difference]: Start difference. First operand has 142 places, 133 transitions, 1442 flow. Second operand 9 states and 114 transitions. [2024-06-03 21:09:33,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 1854 flow [2024-06-03 21:09:33,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 146 transitions, 1775 flow, removed 30 selfloop flow, removed 3 redundant places. [2024-06-03 21:09:33,238 INFO L231 Difference]: Finished difference. Result has 148 places, 137 transitions, 1536 flow [2024-06-03 21:09:33,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1536, PETRI_PLACES=148, PETRI_TRANSITIONS=137} [2024-06-03 21:09:33,239 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-03 21:09:33,239 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 1536 flow [2024-06-03 21:09:33,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:09:33,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:09:33,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:09:33,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 21:09:33,240 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:09:33,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:09:33,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1616167348, now seen corresponding path program 5 times [2024-06-03 21:09:33,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:09:33,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075278570] [2024-06-03 21:09:33,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:09:33,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:09:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:09:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:09:42,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:09:42,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075278570] [2024-06-03 21:09:42,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075278570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:09:42,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:09:42,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:09:42,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496827258] [2024-06-03 21:09:42,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:09:42,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:09:42,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:09:42,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:09:42,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:09:42,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:09:42,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 1536 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:09:42,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:09:42,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:09:42,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:09:42,865 INFO L124 PetriNetUnfolderBase]: 300/553 cut-off events. [2024-06-03 21:09:42,865 INFO L125 PetriNetUnfolderBase]: For 26104/26104 co-relation queries the response was YES. [2024-06-03 21:09:42,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4438 conditions, 553 events. 300/553 cut-off events. For 26104/26104 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2386 event pairs, 42 based on Foata normal form. 1/549 useless extension candidates. Maximal degree in co-relation 4364. Up to 448 conditions per place. [2024-06-03 21:09:42,870 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 114 selfloop transitions, 30 changer transitions 0/147 dead transitions. [2024-06-03 21:09:42,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 147 transitions, 1898 flow [2024-06-03 21:09:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:09:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:09:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-03 21:09:42,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-03 21:09:42,871 INFO L175 Difference]: Start difference. First operand has 148 places, 137 transitions, 1536 flow. Second operand 9 states and 112 transitions. [2024-06-03 21:09:42,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 147 transitions, 1898 flow [2024-06-03 21:09:42,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 147 transitions, 1752 flow, removed 43 selfloop flow, removed 7 redundant places. [2024-06-03 21:09:42,908 INFO L231 Difference]: Finished difference. Result has 150 places, 139 transitions, 1515 flow [2024-06-03 21:09:42,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1515, PETRI_PLACES=150, PETRI_TRANSITIONS=139} [2024-06-03 21:09:42,909 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 119 predicate places. [2024-06-03 21:09:42,909 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 139 transitions, 1515 flow [2024-06-03 21:09:42,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:09:42,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:09:42,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:09:42,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 21:09:42,909 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:09:42,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:09:42,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1705952476, now seen corresponding path program 1 times [2024-06-03 21:09:42,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:09:42,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762236589] [2024-06-03 21:09:42,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:09:42,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:09:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:09:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:09:53,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:09:53,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762236589] [2024-06-03 21:09:53,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762236589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:09:53,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:09:53,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:09:53,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652305205] [2024-06-03 21:09:53,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:09:53,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:09:53,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:09:53,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:09:53,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:09:53,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-03 21:09:53,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 139 transitions, 1515 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:09:53,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:09:53,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-03 21:09:53,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:09:54,181 INFO L124 PetriNetUnfolderBase]: 303/558 cut-off events. [2024-06-03 21:09:54,181 INFO L125 PetriNetUnfolderBase]: For 27140/27140 co-relation queries the response was YES. [2024-06-03 21:09:54,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4436 conditions, 558 events. 303/558 cut-off events. For 27140/27140 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2410 event pairs, 37 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 4361. Up to 458 conditions per place. [2024-06-03 21:09:54,187 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 115 selfloop transitions, 34 changer transitions 0/152 dead transitions. [2024-06-03 21:09:54,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 152 transitions, 1985 flow [2024-06-03 21:09:54,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:09:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:09:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-03 21:09:54,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-03 21:09:54,191 INFO L175 Difference]: Start difference. First operand has 150 places, 139 transitions, 1515 flow. Second operand 9 states and 104 transitions. [2024-06-03 21:09:54,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 152 transitions, 1985 flow [2024-06-03 21:09:54,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 152 transitions, 1876 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-03 21:09:54,228 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 1551 flow [2024-06-03 21:09:54,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1551, PETRI_PLACES=152, PETRI_TRANSITIONS=143} [2024-06-03 21:09:54,229 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 121 predicate places. [2024-06-03 21:09:54,229 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 1551 flow [2024-06-03 21:09:54,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:09:54,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:09:54,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:09:54,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 21:09:54,229 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:09:54,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:09:54,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1705952755, now seen corresponding path program 8 times [2024-06-03 21:09:54,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:09:54,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154626391] [2024-06-03 21:09:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:09:54,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:09:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:10:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:10:01,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:10:01,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154626391] [2024-06-03 21:10:01,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154626391] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:10:01,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:10:01,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:10:01,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211046639] [2024-06-03 21:10:01,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:10:01,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:10:01,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:10:01,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:10:01,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:10:02,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:10:02,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 143 transitions, 1551 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:10:02,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:10:02,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:10:02,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:10:02,513 INFO L124 PetriNetUnfolderBase]: 314/576 cut-off events. [2024-06-03 21:10:02,514 INFO L125 PetriNetUnfolderBase]: For 29659/29659 co-relation queries the response was YES. [2024-06-03 21:10:02,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4654 conditions, 576 events. 314/576 cut-off events. For 29659/29659 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2514 event pairs, 42 based on Foata normal form. 2/573 useless extension candidates. Maximal degree in co-relation 4578. Up to 319 conditions per place. [2024-06-03 21:10:02,518 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 87 selfloop transitions, 72 changer transitions 0/162 dead transitions. [2024-06-03 21:10:02,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 162 transitions, 2319 flow [2024-06-03 21:10:02,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:10:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:10:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-06-03 21:10:02,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-03 21:10:02,520 INFO L175 Difference]: Start difference. First operand has 152 places, 143 transitions, 1551 flow. Second operand 9 states and 124 transitions. [2024-06-03 21:10:02,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 162 transitions, 2319 flow [2024-06-03 21:10:02,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 162 transitions, 2239 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-03 21:10:02,560 INFO L231 Difference]: Finished difference. Result has 156 places, 151 transitions, 1794 flow [2024-06-03 21:10:02,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1794, PETRI_PLACES=156, PETRI_TRANSITIONS=151} [2024-06-03 21:10:02,560 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-03 21:10:02,560 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 151 transitions, 1794 flow [2024-06-03 21:10:02,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:10:02,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:10:02,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:10:02,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 21:10:02,562 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:10:02,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:10:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1705960412, now seen corresponding path program 6 times [2024-06-03 21:10:02,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:10:02,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601401341] [2024-06-03 21:10:02,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:10:02,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:10:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:10:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:10:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:10:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601401341] [2024-06-03 21:10:12,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601401341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:10:12,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:10:12,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:10:12,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643697256] [2024-06-03 21:10:12,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:10:12,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:10:12,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:10:12,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:10:12,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:10:12,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:10:12,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 151 transitions, 1794 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:10:12,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:10:12,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:10:12,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:10:12,852 INFO L124 PetriNetUnfolderBase]: 317/583 cut-off events. [2024-06-03 21:10:12,852 INFO L125 PetriNetUnfolderBase]: For 31053/31053 co-relation queries the response was YES. [2024-06-03 21:10:12,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4870 conditions, 583 events. 317/583 cut-off events. For 31053/31053 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2567 event pairs, 43 based on Foata normal form. 1/579 useless extension candidates. Maximal degree in co-relation 4792. Up to 425 conditions per place. [2024-06-03 21:10:12,857 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 110 selfloop transitions, 51 changer transitions 0/164 dead transitions. [2024-06-03 21:10:12,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 164 transitions, 2344 flow [2024-06-03 21:10:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:10:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:10:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 21:10:12,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-03 21:10:12,862 INFO L175 Difference]: Start difference. First operand has 156 places, 151 transitions, 1794 flow. Second operand 9 states and 114 transitions. [2024-06-03 21:10:12,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 164 transitions, 2344 flow [2024-06-03 21:10:12,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 164 transitions, 2266 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-03 21:10:12,911 INFO L231 Difference]: Finished difference. Result has 162 places, 155 transitions, 1947 flow [2024-06-03 21:10:12,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1716, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1947, PETRI_PLACES=162, PETRI_TRANSITIONS=155} [2024-06-03 21:10:12,914 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2024-06-03 21:10:12,914 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 155 transitions, 1947 flow [2024-06-03 21:10:12,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:10:12,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:10:12,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:10:12,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 21:10:12,915 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:10:12,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:10:12,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1962452986, now seen corresponding path program 2 times [2024-06-03 21:10:12,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:10:12,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933624474] [2024-06-03 21:10:12,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:10:12,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:10:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:10:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:10:20,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:10:20,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933624474] [2024-06-03 21:10:20,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933624474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:10:20,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:10:20,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:10:20,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351947316] [2024-06-03 21:10:20,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:10:20,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:10:20,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:10:20,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:10:20,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:10:21,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-03 21:10:21,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 155 transitions, 1947 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:10:21,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:10:21,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-03 21:10:21,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:10:21,460 INFO L124 PetriNetUnfolderBase]: 315/580 cut-off events. [2024-06-03 21:10:21,460 INFO L125 PetriNetUnfolderBase]: For 31450/31450 co-relation queries the response was YES. [2024-06-03 21:10:21,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4891 conditions, 580 events. 315/580 cut-off events. For 31450/31450 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2551 event pairs, 38 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 4811. Up to 514 conditions per place. [2024-06-03 21:10:21,465 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 140 selfloop transitions, 20 changer transitions 0/163 dead transitions. [2024-06-03 21:10:21,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 163 transitions, 2285 flow [2024-06-03 21:10:21,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:10:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:10:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-03 21:10:21,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-03 21:10:21,466 INFO L175 Difference]: Start difference. First operand has 162 places, 155 transitions, 1947 flow. Second operand 9 states and 98 transitions. [2024-06-03 21:10:21,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 163 transitions, 2285 flow [2024-06-03 21:10:21,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 2169 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-06-03 21:10:21,511 INFO L231 Difference]: Finished difference. Result has 166 places, 155 transitions, 1876 flow [2024-06-03 21:10:21,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1831, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1876, PETRI_PLACES=166, PETRI_TRANSITIONS=155} [2024-06-03 21:10:21,511 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 135 predicate places. [2024-06-03 21:10:21,512 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 155 transitions, 1876 flow [2024-06-03 21:10:21,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:10:21,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:10:21,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:10:21,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 21:10:21,512 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:10:21,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:10:21,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1962460705, now seen corresponding path program 9 times [2024-06-03 21:10:21,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:10:21,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10505914] [2024-06-03 21:10:21,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:10:21,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:10:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:10:30,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:10:30,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:10:30,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10505914] [2024-06-03 21:10:30,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10505914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:10:30,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:10:30,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:10:30,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55211547] [2024-06-03 21:10:30,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:10:30,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:10:30,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:10:30,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:10:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:10:30,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:10:30,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 155 transitions, 1876 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:10:30,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:10:30,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:10:30,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:10:31,138 INFO L124 PetriNetUnfolderBase]: 318/585 cut-off events. [2024-06-03 21:10:31,138 INFO L125 PetriNetUnfolderBase]: For 31918/31918 co-relation queries the response was YES. [2024-06-03 21:10:31,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4902 conditions, 585 events. 318/585 cut-off events. For 31918/31918 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2565 event pairs, 42 based on Foata normal form. 1/581 useless extension candidates. Maximal degree in co-relation 4820. Up to 459 conditions per place. [2024-06-03 21:10:31,143 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 126 selfloop transitions, 38 changer transitions 0/167 dead transitions. [2024-06-03 21:10:31,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 167 transitions, 2381 flow [2024-06-03 21:10:31,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:10:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:10:31,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 21:10:31,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-03 21:10:31,146 INFO L175 Difference]: Start difference. First operand has 166 places, 155 transitions, 1876 flow. Second operand 9 states and 117 transitions. [2024-06-03 21:10:31,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 167 transitions, 2381 flow [2024-06-03 21:10:31,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 167 transitions, 2313 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 21:10:31,201 INFO L231 Difference]: Finished difference. Result has 167 places, 158 transitions, 1954 flow [2024-06-03 21:10:31,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1954, PETRI_PLACES=167, PETRI_TRANSITIONS=158} [2024-06-03 21:10:31,201 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-03 21:10:31,201 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 158 transitions, 1954 flow [2024-06-03 21:10:31,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:10:31,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:10:31,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:10:31,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 21:10:31,202 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:10:31,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:10:31,202 INFO L85 PathProgramCache]: Analyzing trace with hash 488853758, now seen corresponding path program 7 times [2024-06-03 21:10:31,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:10:31,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153142286] [2024-06-03 21:10:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:10:31,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:10:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:10:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:10:40,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:10:40,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153142286] [2024-06-03 21:10:40,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153142286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:10:40,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:10:40,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:10:40,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777880147] [2024-06-03 21:10:40,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:10:40,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:10:40,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:10:40,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:10:40,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:10:40,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:10:40,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 158 transitions, 1954 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:10:40,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:10:40,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:10:40,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:10:40,906 INFO L124 PetriNetUnfolderBase]: 316/582 cut-off events. [2024-06-03 21:10:40,906 INFO L125 PetriNetUnfolderBase]: For 32133/32133 co-relation queries the response was YES. [2024-06-03 21:10:40,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4878 conditions, 582 events. 316/582 cut-off events. For 32133/32133 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2554 event pairs, 43 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 4795. Up to 466 conditions per place. [2024-06-03 21:10:40,914 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 129 selfloop transitions, 34 changer transitions 0/166 dead transitions. [2024-06-03 21:10:40,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 166 transitions, 2298 flow [2024-06-03 21:10:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:10:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:10:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 21:10:40,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-03 21:10:40,918 INFO L175 Difference]: Start difference. First operand has 167 places, 158 transitions, 1954 flow. Second operand 9 states and 114 transitions. [2024-06-03 21:10:40,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 166 transitions, 2298 flow [2024-06-03 21:10:40,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 166 transitions, 2130 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-03 21:10:40,978 INFO L231 Difference]: Finished difference. Result has 170 places, 158 transitions, 1859 flow [2024-06-03 21:10:40,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1786, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1859, PETRI_PLACES=170, PETRI_TRANSITIONS=158} [2024-06-03 21:10:40,978 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 139 predicate places. [2024-06-03 21:10:40,979 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 158 transitions, 1859 flow [2024-06-03 21:10:40,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:10:40,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:10:40,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:10:40,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 21:10:40,979 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:10:40,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:10:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1962453265, now seen corresponding path program 10 times [2024-06-03 21:10:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:10:40,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217085622] [2024-06-03 21:10:40,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:10:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:10:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:10:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:10:49,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:10:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217085622] [2024-06-03 21:10:49,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217085622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:10:49,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:10:49,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:10:49,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243374069] [2024-06-03 21:10:49,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:10:49,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:10:49,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:10:49,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:10:49,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:10:49,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:10:49,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 158 transitions, 1859 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:10:49,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:10:49,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:10:49,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:10:49,790 INFO L124 PetriNetUnfolderBase]: 314/579 cut-off events. [2024-06-03 21:10:49,790 INFO L125 PetriNetUnfolderBase]: For 31750/31750 co-relation queries the response was YES. [2024-06-03 21:10:49,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4734 conditions, 579 events. 314/579 cut-off events. For 31750/31750 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2531 event pairs, 42 based on Foata normal form. 1/575 useless extension candidates. Maximal degree in co-relation 4650. Up to 454 conditions per place. [2024-06-03 21:10:49,794 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 124 selfloop transitions, 39 changer transitions 0/166 dead transitions. [2024-06-03 21:10:49,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 166 transitions, 2203 flow [2024-06-03 21:10:49,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:10:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:10:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-03 21:10:49,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-03 21:10:49,796 INFO L175 Difference]: Start difference. First operand has 170 places, 158 transitions, 1859 flow. Second operand 9 states and 116 transitions. [2024-06-03 21:10:49,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 166 transitions, 2203 flow [2024-06-03 21:10:49,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 2005 flow, removed 35 selfloop flow, removed 10 redundant places. [2024-06-03 21:10:49,845 INFO L231 Difference]: Finished difference. Result has 169 places, 158 transitions, 1744 flow [2024-06-03 21:10:49,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1744, PETRI_PLACES=169, PETRI_TRANSITIONS=158} [2024-06-03 21:10:49,846 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 138 predicate places. [2024-06-03 21:10:49,846 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 158 transitions, 1744 flow [2024-06-03 21:10:49,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:10:49,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:10:49,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:10:49,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 21:10:49,847 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:10:49,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:10:49,847 INFO L85 PathProgramCache]: Analyzing trace with hash 135655998, now seen corresponding path program 1 times [2024-06-03 21:10:49,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:10:49,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675846970] [2024-06-03 21:10:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:10:49,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:10:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:10:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:10:56,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:10:56,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675846970] [2024-06-03 21:10:56,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675846970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:10:56,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:10:56,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:10:56,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566082598] [2024-06-03 21:10:56,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:10:56,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:10:56,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:10:56,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:10:56,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:10:56,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:10:56,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 158 transitions, 1744 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:10:56,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:10:56,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:10:56,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:10:56,781 INFO L124 PetriNetUnfolderBase]: 318/586 cut-off events. [2024-06-03 21:10:56,781 INFO L125 PetriNetUnfolderBase]: For 33851/33851 co-relation queries the response was YES. [2024-06-03 21:10:56,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4662 conditions, 586 events. 318/586 cut-off events. For 33851/33851 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2580 event pairs, 15 based on Foata normal form. 2/586 useless extension candidates. Maximal degree in co-relation 4579. Up to 484 conditions per place. [2024-06-03 21:10:56,786 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 154 selfloop transitions, 19 changer transitions 0/176 dead transitions. [2024-06-03 21:10:56,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 176 transitions, 2154 flow [2024-06-03 21:10:56,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:10:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:10:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-03 21:10:56,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-03 21:10:56,787 INFO L175 Difference]: Start difference. First operand has 169 places, 158 transitions, 1744 flow. Second operand 9 states and 113 transitions. [2024-06-03 21:10:56,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 176 transitions, 2154 flow [2024-06-03 21:10:56,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 176 transitions, 2081 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-03 21:10:56,837 INFO L231 Difference]: Finished difference. Result has 171 places, 159 transitions, 1733 flow [2024-06-03 21:10:56,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1733, PETRI_PLACES=171, PETRI_TRANSITIONS=159} [2024-06-03 21:10:56,838 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 140 predicate places. [2024-06-03 21:10:56,838 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 159 transitions, 1733 flow [2024-06-03 21:10:56,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:10:56,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:10:56,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:10:56,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 21:10:56,844 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:10:56,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:10:56,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1576362194, now seen corresponding path program 2 times [2024-06-03 21:10:56,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:10:56,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267464803] [2024-06-03 21:10:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:10:56,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:10:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:11:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:11:02,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:11:02,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267464803] [2024-06-03 21:11:02,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267464803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:11:02,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:11:02,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:11:02,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286019897] [2024-06-03 21:11:02,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:11:02,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:11:02,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:11:02,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:11:02,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:11:02,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:11:02,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 159 transitions, 1733 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:02,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:11:02,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:11:02,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:11:03,155 INFO L124 PetriNetUnfolderBase]: 322/594 cut-off events. [2024-06-03 21:11:03,155 INFO L125 PetriNetUnfolderBase]: For 35216/35216 co-relation queries the response was YES. [2024-06-03 21:11:03,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4720 conditions, 594 events. 322/594 cut-off events. For 35216/35216 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2624 event pairs, 32 based on Foata normal form. 2/594 useless extension candidates. Maximal degree in co-relation 4636. Up to 509 conditions per place. [2024-06-03 21:11:03,160 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 153 selfloop transitions, 20 changer transitions 0/176 dead transitions. [2024-06-03 21:11:03,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 176 transitions, 2143 flow [2024-06-03 21:11:03,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:11:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:11:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 21:11:03,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-03 21:11:03,161 INFO L175 Difference]: Start difference. First operand has 171 places, 159 transitions, 1733 flow. Second operand 9 states and 114 transitions. [2024-06-03 21:11:03,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 176 transitions, 2143 flow [2024-06-03 21:11:03,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 176 transitions, 2091 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 21:11:03,214 INFO L231 Difference]: Finished difference. Result has 173 places, 160 transitions, 1747 flow [2024-06-03 21:11:03,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1681, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1747, PETRI_PLACES=173, PETRI_TRANSITIONS=160} [2024-06-03 21:11:03,215 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 142 predicate places. [2024-06-03 21:11:03,215 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 160 transitions, 1747 flow [2024-06-03 21:11:03,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:03,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:11:03,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:11:03,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 21:11:03,215 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:11:03,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:11:03,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1576367154, now seen corresponding path program 1 times [2024-06-03 21:11:03,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:11:03,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13883169] [2024-06-03 21:11:03,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:11:03,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:11:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:11:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:11:13,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:11:13,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13883169] [2024-06-03 21:11:13,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13883169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:11:13,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:11:13,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:11:13,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772350468] [2024-06-03 21:11:13,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:11:13,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:11:13,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:11:13,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:11:13,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:11:13,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:11:13,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 160 transitions, 1747 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:13,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:11:13,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:11:13,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:11:13,785 INFO L124 PetriNetUnfolderBase]: 325/601 cut-off events. [2024-06-03 21:11:13,785 INFO L125 PetriNetUnfolderBase]: For 36051/36051 co-relation queries the response was YES. [2024-06-03 21:11:13,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4784 conditions, 601 events. 325/601 cut-off events. For 36051/36051 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2692 event pairs, 31 based on Foata normal form. 1/600 useless extension candidates. Maximal degree in co-relation 4699. Up to 514 conditions per place. [2024-06-03 21:11:13,790 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 152 selfloop transitions, 23 changer transitions 0/178 dead transitions. [2024-06-03 21:11:13,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 178 transitions, 2189 flow [2024-06-03 21:11:13,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:11:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:11:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 21:11:13,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-03 21:11:13,791 INFO L175 Difference]: Start difference. First operand has 173 places, 160 transitions, 1747 flow. Second operand 10 states and 124 transitions. [2024-06-03 21:11:13,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 178 transitions, 2189 flow [2024-06-03 21:11:13,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 178 transitions, 2133 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-03 21:11:13,847 INFO L231 Difference]: Finished difference. Result has 176 places, 162 transitions, 1794 flow [2024-06-03 21:11:13,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1691, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1794, PETRI_PLACES=176, PETRI_TRANSITIONS=162} [2024-06-03 21:11:13,848 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-03 21:11:13,848 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 162 transitions, 1794 flow [2024-06-03 21:11:13,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:13,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:11:13,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:11:13,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 21:11:13,849 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:11:13,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:11:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash -456534054, now seen corresponding path program 3 times [2024-06-03 21:11:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:11:13,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4566186] [2024-06-03 21:11:13,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:11:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:11:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:11:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:11:20,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:11:20,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4566186] [2024-06-03 21:11:20,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4566186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:11:20,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:11:20,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:11:20,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694101868] [2024-06-03 21:11:20,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:11:20,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:11:20,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:11:20,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:11:20,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:11:20,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:11:20,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 162 transitions, 1794 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:20,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:11:20,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:11:20,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:11:20,721 INFO L124 PetriNetUnfolderBase]: 329/609 cut-off events. [2024-06-03 21:11:20,722 INFO L125 PetriNetUnfolderBase]: For 38774/38774 co-relation queries the response was YES. [2024-06-03 21:11:20,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4861 conditions, 609 events. 329/609 cut-off events. For 38774/38774 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2732 event pairs, 31 based on Foata normal form. 2/609 useless extension candidates. Maximal degree in co-relation 4775. Up to 527 conditions per place. [2024-06-03 21:11:20,727 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 151 selfloop transitions, 22 changer transitions 0/176 dead transitions. [2024-06-03 21:11:20,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 176 transitions, 2194 flow [2024-06-03 21:11:20,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:11:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:11:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-03 21:11:20,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-03 21:11:20,737 INFO L175 Difference]: Start difference. First operand has 176 places, 162 transitions, 1794 flow. Second operand 9 states and 111 transitions. [2024-06-03 21:11:20,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 176 transitions, 2194 flow [2024-06-03 21:11:20,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 176 transitions, 2107 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-03 21:11:20,798 INFO L231 Difference]: Finished difference. Result has 177 places, 163 transitions, 1779 flow [2024-06-03 21:11:20,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1779, PETRI_PLACES=177, PETRI_TRANSITIONS=163} [2024-06-03 21:11:20,799 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 146 predicate places. [2024-06-03 21:11:20,799 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 163 transitions, 1779 flow [2024-06-03 21:11:20,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:20,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:11:20,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:11:20,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 21:11:20,800 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:11:20,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:11:20,800 INFO L85 PathProgramCache]: Analyzing trace with hash -456349604, now seen corresponding path program 2 times [2024-06-03 21:11:20,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:11:20,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750436853] [2024-06-03 21:11:20,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:11:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:11:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:11:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:11:29,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:11:29,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750436853] [2024-06-03 21:11:29,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750436853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:11:29,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:11:29,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:11:29,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762571931] [2024-06-03 21:11:29,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:11:29,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:11:29,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:11:29,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:11:29,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:11:29,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:11:29,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 163 transitions, 1779 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:29,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:11:29,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:11:29,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:11:30,370 INFO L124 PetriNetUnfolderBase]: 356/658 cut-off events. [2024-06-03 21:11:30,371 INFO L125 PetriNetUnfolderBase]: For 46841/46841 co-relation queries the response was YES. [2024-06-03 21:11:30,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5523 conditions, 658 events. 356/658 cut-off events. For 46841/46841 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3031 event pairs, 29 based on Foata normal form. 2/658 useless extension candidates. Maximal degree in co-relation 5436. Up to 534 conditions per place. [2024-06-03 21:11:30,376 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 150 selfloop transitions, 33 changer transitions 0/186 dead transitions. [2024-06-03 21:11:30,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 186 transitions, 2484 flow [2024-06-03 21:11:30,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:11:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:11:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-03 21:11:30,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-03 21:11:30,377 INFO L175 Difference]: Start difference. First operand has 177 places, 163 transitions, 1779 flow. Second operand 10 states and 127 transitions. [2024-06-03 21:11:30,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 186 transitions, 2484 flow [2024-06-03 21:11:30,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 186 transitions, 2400 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-03 21:11:30,442 INFO L231 Difference]: Finished difference. Result has 180 places, 171 transitions, 1971 flow [2024-06-03 21:11:30,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1971, PETRI_PLACES=180, PETRI_TRANSITIONS=171} [2024-06-03 21:11:30,446 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 149 predicate places. [2024-06-03 21:11:30,446 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 171 transitions, 1971 flow [2024-06-03 21:11:30,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:30,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:11:30,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:11:30,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 21:11:30,447 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:11:30,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:11:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1691838062, now seen corresponding path program 1 times [2024-06-03 21:11:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:11:30,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529497242] [2024-06-03 21:11:30,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:11:30,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:11:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:11:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:11:38,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:11:38,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529497242] [2024-06-03 21:11:38,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529497242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:11:38,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:11:38,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:11:38,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989367803] [2024-06-03 21:11:38,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:11:38,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:11:38,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:11:38,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:11:38,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:11:38,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:11:38,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 171 transitions, 1971 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:38,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:11:38,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:11:38,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:11:39,274 INFO L124 PetriNetUnfolderBase]: 354/656 cut-off events. [2024-06-03 21:11:39,275 INFO L125 PetriNetUnfolderBase]: For 46923/46923 co-relation queries the response was YES. [2024-06-03 21:11:39,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5473 conditions, 656 events. 354/656 cut-off events. For 46923/46923 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3016 event pairs, 30 based on Foata normal form. 3/657 useless extension candidates. Maximal degree in co-relation 5385. Up to 527 conditions per place. [2024-06-03 21:11:39,281 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 149 selfloop transitions, 35 changer transitions 0/187 dead transitions. [2024-06-03 21:11:39,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 187 transitions, 2429 flow [2024-06-03 21:11:39,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:11:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:11:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-03 21:11:39,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-03 21:11:39,282 INFO L175 Difference]: Start difference. First operand has 180 places, 171 transitions, 1971 flow. Second operand 10 states and 126 transitions. [2024-06-03 21:11:39,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 187 transitions, 2429 flow [2024-06-03 21:11:39,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 187 transitions, 2329 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-03 21:11:39,364 INFO L231 Difference]: Finished difference. Result has 184 places, 173 transitions, 2006 flow [2024-06-03 21:11:39,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2006, PETRI_PLACES=184, PETRI_TRANSITIONS=173} [2024-06-03 21:11:39,365 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2024-06-03 21:11:39,365 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 173 transitions, 2006 flow [2024-06-03 21:11:39,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:39,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:11:39,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-03 21:11:39,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 21:11:39,365 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:11:39,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:11:39,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1691831304, now seen corresponding path program 3 times [2024-06-03 21:11:39,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:11:39,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670849814] [2024-06-03 21:11:39,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:11:39,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:11:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:11:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:11:48,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:11:48,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670849814] [2024-06-03 21:11:48,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670849814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:11:48,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:11:48,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:11:48,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545627981] [2024-06-03 21:11:48,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:11:48,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:11:48,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:11:48,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:11:48,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:11:48,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:11:48,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 173 transitions, 2006 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:48,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:11:48,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:11:48,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:11:48,661 INFO L124 PetriNetUnfolderBase]: 352/653 cut-off events. [2024-06-03 21:11:48,661 INFO L125 PetriNetUnfolderBase]: For 43246/43246 co-relation queries the response was YES. [2024-06-03 21:11:48,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5397 conditions, 653 events. 352/653 cut-off events. For 43246/43246 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3005 event pairs, 30 based on Foata normal form. 1/652 useless extension candidates. Maximal degree in co-relation 5307. Up to 548 conditions per place. [2024-06-03 21:11:48,667 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 156 selfloop transitions, 30 changer transitions 0/189 dead transitions. [2024-06-03 21:11:48,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 189 transitions, 2468 flow [2024-06-03 21:11:48,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:11:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:11:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-03 21:11:48,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-03 21:11:48,668 INFO L175 Difference]: Start difference. First operand has 184 places, 173 transitions, 2006 flow. Second operand 10 states and 125 transitions. [2024-06-03 21:11:48,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 189 transitions, 2468 flow [2024-06-03 21:11:48,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 189 transitions, 2319 flow, removed 43 selfloop flow, removed 8 redundant places. [2024-06-03 21:11:48,747 INFO L231 Difference]: Finished difference. Result has 187 places, 176 transitions, 1992 flow [2024-06-03 21:11:48,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1857, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1992, PETRI_PLACES=187, PETRI_TRANSITIONS=176} [2024-06-03 21:11:48,747 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 156 predicate places. [2024-06-03 21:11:48,748 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 176 transitions, 1992 flow [2024-06-03 21:11:48,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:48,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:11:48,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:11:48,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 21:11:48,748 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:11:48,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:11:48,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1857292498, now seen corresponding path program 4 times [2024-06-03 21:11:48,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:11:48,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732743100] [2024-06-03 21:11:48,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:11:48,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:11:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:11:56,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:11:56,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:11:56,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732743100] [2024-06-03 21:11:56,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732743100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:11:56,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:11:56,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:11:56,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923729046] [2024-06-03 21:11:56,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:11:56,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:11:56,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:11:56,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:11:56,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:11:56,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:11:56,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 176 transitions, 1992 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:56,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:11:56,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:11:56,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:11:56,527 INFO L124 PetriNetUnfolderBase]: 356/661 cut-off events. [2024-06-03 21:11:56,527 INFO L125 PetriNetUnfolderBase]: For 46664/46664 co-relation queries the response was YES. [2024-06-03 21:11:56,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5413 conditions, 661 events. 356/661 cut-off events. For 46664/46664 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3047 event pairs, 32 based on Foata normal form. 2/661 useless extension candidates. Maximal degree in co-relation 5321. Up to 562 conditions per place. [2024-06-03 21:11:56,533 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 162 selfloop transitions, 23 changer transitions 0/188 dead transitions. [2024-06-03 21:11:56,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 188 transitions, 2412 flow [2024-06-03 21:11:56,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:11:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:11:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-03 21:11:56,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-03 21:11:56,534 INFO L175 Difference]: Start difference. First operand has 187 places, 176 transitions, 1992 flow. Second operand 9 states and 111 transitions. [2024-06-03 21:11:56,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 188 transitions, 2412 flow [2024-06-03 21:11:56,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 188 transitions, 2315 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-03 21:11:56,620 INFO L231 Difference]: Finished difference. Result has 189 places, 177 transitions, 1971 flow [2024-06-03 21:11:56,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1971, PETRI_PLACES=189, PETRI_TRANSITIONS=177} [2024-06-03 21:11:56,621 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 158 predicate places. [2024-06-03 21:11:56,621 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 177 transitions, 1971 flow [2024-06-03 21:11:56,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:56,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:11:56,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:11:56,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 21:11:56,622 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:11:56,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:11:56,622 INFO L85 PathProgramCache]: Analyzing trace with hash -682667282, now seen corresponding path program 2 times [2024-06-03 21:11:56,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:11:56,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085405035] [2024-06-03 21:11:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:11:56,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:11:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:12:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:12:04,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:12:04,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085405035] [2024-06-03 21:12:04,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085405035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:12:04,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:12:04,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:12:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088992851] [2024-06-03 21:12:04,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:12:04,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:12:04,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:12:04,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:12:04,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:12:04,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:12:04,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 177 transitions, 1971 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:12:04,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:12:04,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:12:04,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:12:05,199 INFO L124 PetriNetUnfolderBase]: 357/661 cut-off events. [2024-06-03 21:12:05,199 INFO L125 PetriNetUnfolderBase]: For 46551/46551 co-relation queries the response was YES. [2024-06-03 21:12:05,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 661 events. 357/661 cut-off events. For 46551/46551 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3041 event pairs, 32 based on Foata normal form. 2/661 useless extension candidates. Maximal degree in co-relation 5267. Up to 552 conditions per place. [2024-06-03 21:12:05,205 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 157 selfloop transitions, 30 changer transitions 0/190 dead transitions. [2024-06-03 21:12:05,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 190 transitions, 2415 flow [2024-06-03 21:12:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:12:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:12:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-03 21:12:05,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-03 21:12:05,206 INFO L175 Difference]: Start difference. First operand has 189 places, 177 transitions, 1971 flow. Second operand 10 states and 125 transitions. [2024-06-03 21:12:05,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 190 transitions, 2415 flow [2024-06-03 21:12:05,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 190 transitions, 2349 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 21:12:05,288 INFO L231 Difference]: Finished difference. Result has 192 places, 179 transitions, 2019 flow [2024-06-03 21:12:05,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2019, PETRI_PLACES=192, PETRI_TRANSITIONS=179} [2024-06-03 21:12:05,288 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 161 predicate places. [2024-06-03 21:12:05,289 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 179 transitions, 2019 flow [2024-06-03 21:12:05,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:12:05,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:12:05,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:12:05,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 21:12:05,289 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:12:05,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:12:05,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1863733058, now seen corresponding path program 4 times [2024-06-03 21:12:05,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:12:05,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923903771] [2024-06-03 21:12:05,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:12:05,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:12:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:12:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:12:14,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:12:14,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923903771] [2024-06-03 21:12:14,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923903771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:12:14,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:12:14,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:12:14,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334963711] [2024-06-03 21:12:14,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:12:14,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:12:14,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:12:14,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:12:14,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:12:14,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 21:12:14,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 179 transitions, 2019 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:12:14,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:12:14,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 21:12:14,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:12:15,283 INFO L124 PetriNetUnfolderBase]: 375/696 cut-off events. [2024-06-03 21:12:15,284 INFO L125 PetriNetUnfolderBase]: For 52863/52863 co-relation queries the response was YES. [2024-06-03 21:12:15,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5922 conditions, 696 events. 375/696 cut-off events. For 52863/52863 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3274 event pairs, 31 based on Foata normal form. 1/695 useless extension candidates. Maximal degree in co-relation 5828. Up to 526 conditions per place. [2024-06-03 21:12:15,289 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 149 selfloop transitions, 49 changer transitions 0/201 dead transitions. [2024-06-03 21:12:15,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 201 transitions, 3035 flow [2024-06-03 21:12:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:12:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:12:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-03 21:12:15,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-03 21:12:15,291 INFO L175 Difference]: Start difference. First operand has 192 places, 179 transitions, 2019 flow. Second operand 10 states and 140 transitions. [2024-06-03 21:12:15,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 201 transitions, 3035 flow [2024-06-03 21:12:15,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 201 transitions, 2908 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-06-03 21:12:15,374 INFO L231 Difference]: Finished difference. Result has 193 places, 187 transitions, 2239 flow [2024-06-03 21:12:15,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2239, PETRI_PLACES=193, PETRI_TRANSITIONS=187} [2024-06-03 21:12:15,374 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 162 predicate places. [2024-06-03 21:12:15,374 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 187 transitions, 2239 flow [2024-06-03 21:12:15,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:12:15,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:12:15,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:12:15,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 21:12:15,375 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-03 21:12:15,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:12:15,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1863733306, now seen corresponding path program 3 times [2024-06-03 21:12:15,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:12:15,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147315381] [2024-06-03 21:12:15,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:12:15,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:12:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:12:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:12:23,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:12:23,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147315381] [2024-06-03 21:12:23,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147315381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:12:23,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:12:23,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:12:23,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624529020] [2024-06-03 21:12:23,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:12:23,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:12:23,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:12:23,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:12:23,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:12:23,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:12:23,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 187 transitions, 2239 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:12:23,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:12:23,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:12:23,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:12:23,940 INFO L124 PetriNetUnfolderBase]: 373/693 cut-off events. [2024-06-03 21:12:23,940 INFO L125 PetriNetUnfolderBase]: For 52793/52793 co-relation queries the response was YES. [2024-06-03 21:12:23,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5843 conditions, 693 events. 373/693 cut-off events. For 52793/52793 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3262 event pairs, 31 based on Foata normal form. 1/692 useless extension candidates. Maximal degree in co-relation 5749. Up to 552 conditions per place. [2024-06-03 21:12:23,946 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 154 selfloop transitions, 41 changer transitions 0/198 dead transitions. [2024-06-03 21:12:23,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 198 transitions, 2655 flow [2024-06-03 21:12:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:12:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:12:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-03 21:12:23,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-03 21:12:23,947 INFO L175 Difference]: Start difference. First operand has 193 places, 187 transitions, 2239 flow. Second operand 10 states and 125 transitions. [2024-06-03 21:12:23,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 198 transitions, 2655 flow [2024-06-03 21:12:24,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 198 transitions, 2534 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-03 21:12:24,035 INFO L231 Difference]: Finished difference. Result has 199 places, 187 transitions, 2205 flow [2024-06-03 21:12:24,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2205, PETRI_PLACES=199, PETRI_TRANSITIONS=187} [2024-06-03 21:12:24,037 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 168 predicate places. [2024-06-03 21:12:24,037 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 187 transitions, 2205 flow [2024-06-03 21:12:24,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:12:24,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:12:24,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:12:24,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 21:12:24,037 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-03 21:12:24,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:12:24,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1863726548, now seen corresponding path program 5 times [2024-06-03 21:12:24,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:12:24,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016863845] [2024-06-03 21:12:24,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:12:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:12:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:12:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:12:32,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:12:32,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016863845] [2024-06-03 21:12:32,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016863845] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:12:32,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:12:32,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:12:32,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028153672] [2024-06-03 21:12:32,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:12:32,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:12:32,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:12:32,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:12:32,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:12:33,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:12:33,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 187 transitions, 2205 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:12:33,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:12:33,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:12:33,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:12:33,564 INFO L124 PetriNetUnfolderBase]: 386/716 cut-off events. [2024-06-03 21:12:33,564 INFO L125 PetriNetUnfolderBase]: For 57404/57404 co-relation queries the response was YES. [2024-06-03 21:12:33,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6229 conditions, 716 events. 386/716 cut-off events. For 57404/57404 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3400 event pairs, 33 based on Foata normal form. 1/715 useless extension candidates. Maximal degree in co-relation 6133. Up to 491 conditions per place. [2024-06-03 21:12:33,571 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 142 selfloop transitions, 62 changer transitions 0/207 dead transitions. [2024-06-03 21:12:33,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 207 transitions, 3179 flow [2024-06-03 21:12:33,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:12:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:12:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-03 21:12:33,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-03 21:12:33,572 INFO L175 Difference]: Start difference. First operand has 199 places, 187 transitions, 2205 flow. Second operand 10 states and 133 transitions. [2024-06-03 21:12:33,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 207 transitions, 3179 flow [2024-06-03 21:12:33,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 207 transitions, 3035 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-03 21:12:33,680 INFO L231 Difference]: Finished difference. Result has 200 places, 193 transitions, 2368 flow [2024-06-03 21:12:33,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2061, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2368, PETRI_PLACES=200, PETRI_TRANSITIONS=193} [2024-06-03 21:12:33,681 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 169 predicate places. [2024-06-03 21:12:33,681 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 193 transitions, 2368 flow [2024-06-03 21:12:33,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:12:33,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:12:33,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:12:33,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 21:12:33,681 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-03 21:12:33,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:12:33,682 INFO L85 PathProgramCache]: Analyzing trace with hash 903795654, now seen corresponding path program 1 times [2024-06-03 21:12:33,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:12:33,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197069624] [2024-06-03 21:12:33,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:12:33,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:12:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:12:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:12:41,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:12:41,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197069624] [2024-06-03 21:12:41,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197069624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:12:41,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:12:41,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:12:41,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235797173] [2024-06-03 21:12:41,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:12:41,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:12:41,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:12:41,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:12:41,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:12:41,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:12:41,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 193 transitions, 2368 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:12:41,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:12:41,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:12:41,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:12:42,144 INFO L124 PetriNetUnfolderBase]: 390/724 cut-off events. [2024-06-03 21:12:42,144 INFO L125 PetriNetUnfolderBase]: For 62009/62009 co-relation queries the response was YES. [2024-06-03 21:12:42,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6324 conditions, 724 events. 390/724 cut-off events. For 62009/62009 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3468 event pairs, 31 based on Foata normal form. 2/724 useless extension candidates. Maximal degree in co-relation 6228. Up to 645 conditions per place. [2024-06-03 21:12:42,150 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 185 selfloop transitions, 18 changer transitions 0/206 dead transitions. [2024-06-03 21:12:42,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 206 transitions, 2826 flow [2024-06-03 21:12:42,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:12:42,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:12:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-03 21:12:42,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-03 21:12:42,153 INFO L175 Difference]: Start difference. First operand has 200 places, 193 transitions, 2368 flow. Second operand 10 states and 118 transitions. [2024-06-03 21:12:42,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 206 transitions, 2826 flow [2024-06-03 21:12:42,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 206 transitions, 2728 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-03 21:12:42,259 INFO L231 Difference]: Finished difference. Result has 204 places, 194 transitions, 2336 flow [2024-06-03 21:12:42,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2336, PETRI_PLACES=204, PETRI_TRANSITIONS=194} [2024-06-03 21:12:42,259 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 173 predicate places. [2024-06-03 21:12:42,260 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 194 transitions, 2336 flow [2024-06-03 21:12:42,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:12:42,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:12:42,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:12:42,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 21:12:42,260 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-03 21:12:42,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:12:42,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1528593658, now seen corresponding path program 6 times [2024-06-03 21:12:42,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:12:42,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22649044] [2024-06-03 21:12:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:12:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:12:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:12:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:12:52,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:12:52,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22649044] [2024-06-03 21:12:52,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22649044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:12:52,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:12:52,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:12:52,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552414241] [2024-06-03 21:12:52,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:12:52,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:12:52,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:12:52,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:12:52,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:12:52,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 21:12:52,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 194 transitions, 2336 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:12:52,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:12:52,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 21:12:52,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:12:53,027 INFO L124 PetriNetUnfolderBase]: 388/721 cut-off events. [2024-06-03 21:12:53,027 INFO L125 PetriNetUnfolderBase]: For 59506/59506 co-relation queries the response was YES. [2024-06-03 21:12:53,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6173 conditions, 721 events. 388/721 cut-off events. For 59506/59506 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3444 event pairs, 32 based on Foata normal form. 1/720 useless extension candidates. Maximal degree in co-relation 6076. Up to 551 conditions per place. [2024-06-03 21:12:53,034 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 150 selfloop transitions, 53 changer transitions 0/206 dead transitions. [2024-06-03 21:12:53,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 206 transitions, 2894 flow [2024-06-03 21:12:53,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:12:53,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:12:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-03 21:12:53,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-03 21:12:53,049 INFO L175 Difference]: Start difference. First operand has 204 places, 194 transitions, 2336 flow. Second operand 10 states and 136 transitions. [2024-06-03 21:12:53,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 206 transitions, 2894 flow [2024-06-03 21:12:53,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 206 transitions, 2755 flow, removed 32 selfloop flow, removed 10 redundant places. [2024-06-03 21:12:53,158 INFO L231 Difference]: Finished difference. Result has 204 places, 194 transitions, 2308 flow [2024-06-03 21:12:53,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2308, PETRI_PLACES=204, PETRI_TRANSITIONS=194} [2024-06-03 21:12:53,159 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 173 predicate places. [2024-06-03 21:12:53,159 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 194 transitions, 2308 flow [2024-06-03 21:12:53,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:12:53,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:12:53,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:12:53,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 21:12:53,160 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-03 21:12:53,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:12:53,160 INFO L85 PathProgramCache]: Analyzing trace with hash 897293466, now seen corresponding path program 7 times [2024-06-03 21:12:53,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:12:53,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644457939] [2024-06-03 21:12:53,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:12:53,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:12:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:13:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:13:02,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:13:02,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644457939] [2024-06-03 21:13:02,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644457939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:13:02,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:13:02,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:13:02,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223513806] [2024-06-03 21:13:02,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:13:02,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:13:02,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:13:02,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:13:02,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:13:02,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:13:02,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 194 transitions, 2308 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:13:02,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:13:02,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:13:02,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:13:02,957 INFO L124 PetriNetUnfolderBase]: 396/738 cut-off events. [2024-06-03 21:13:02,957 INFO L125 PetriNetUnfolderBase]: For 63703/63703 co-relation queries the response was YES. [2024-06-03 21:13:02,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6407 conditions, 738 events. 396/738 cut-off events. For 63703/63703 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3574 event pairs, 32 based on Foata normal form. 1/737 useless extension candidates. Maximal degree in co-relation 6310. Up to 596 conditions per place. [2024-06-03 21:13:02,964 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 170 selfloop transitions, 38 changer transitions 0/211 dead transitions. [2024-06-03 21:13:02,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 211 transitions, 3132 flow [2024-06-03 21:13:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:13:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:13:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-03 21:13:02,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-03 21:13:02,967 INFO L175 Difference]: Start difference. First operand has 204 places, 194 transitions, 2308 flow. Second operand 10 states and 129 transitions. [2024-06-03 21:13:02,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 211 transitions, 3132 flow [2024-06-03 21:13:03,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 211 transitions, 3034 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-03 21:13:03,084 INFO L231 Difference]: Finished difference. Result has 206 places, 198 transitions, 2417 flow [2024-06-03 21:13:03,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2417, PETRI_PLACES=206, PETRI_TRANSITIONS=198} [2024-06-03 21:13:03,085 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 175 predicate places. [2024-06-03 21:13:03,085 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 198 transitions, 2417 flow [2024-06-03 21:13:03,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:13:03,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:13:03,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:13:03,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 21:13:03,086 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-03 21:13:03,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:13:03,086 INFO L85 PathProgramCache]: Analyzing trace with hash 897299976, now seen corresponding path program 8 times [2024-06-03 21:13:03,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:13:03,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487851771] [2024-06-03 21:13:03,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:13:03,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:13:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:13:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:13:10,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:13:10,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487851771] [2024-06-03 21:13:10,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487851771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:13:10,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:13:10,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:13:10,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577559657] [2024-06-03 21:13:10,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:13:10,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:13:10,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:13:10,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:13:10,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:13:10,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 21:13:10,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 198 transitions, 2417 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:13:10,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:13:10,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 21:13:10,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:13:11,428 INFO L124 PetriNetUnfolderBase]: 394/735 cut-off events. [2024-06-03 21:13:11,428 INFO L125 PetriNetUnfolderBase]: For 63325/63325 co-relation queries the response was YES. [2024-06-03 21:13:11,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6312 conditions, 735 events. 394/735 cut-off events. For 63325/63325 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3557 event pairs, 32 based on Foata normal form. 1/734 useless extension candidates. Maximal degree in co-relation 6214. Up to 611 conditions per place. [2024-06-03 21:13:11,435 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 174 selfloop transitions, 32 changer transitions 0/209 dead transitions. [2024-06-03 21:13:11,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 209 transitions, 2855 flow [2024-06-03 21:13:11,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:13:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:13:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-03 21:13:11,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-03 21:13:11,436 INFO L175 Difference]: Start difference. First operand has 206 places, 198 transitions, 2417 flow. Second operand 10 states and 134 transitions. [2024-06-03 21:13:11,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 209 transitions, 2855 flow [2024-06-03 21:13:11,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 209 transitions, 2662 flow, removed 55 selfloop flow, removed 7 redundant places. [2024-06-03 21:13:11,572 INFO L231 Difference]: Finished difference. Result has 209 places, 198 transitions, 2293 flow [2024-06-03 21:13:11,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2224, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2293, PETRI_PLACES=209, PETRI_TRANSITIONS=198} [2024-06-03 21:13:11,572 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 178 predicate places. [2024-06-03 21:13:11,573 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 198 transitions, 2293 flow [2024-06-03 21:13:11,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:13:11,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:13:11,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:13:11,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 21:13:11,573 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-03 21:13:11,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:13:11,573 INFO L85 PathProgramCache]: Analyzing trace with hash 116352244, now seen corresponding path program 5 times [2024-06-03 21:13:11,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:13:11,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497835549] [2024-06-03 21:13:11,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:13:11,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:13:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:13:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:13:18,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:13:18,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497835549] [2024-06-03 21:13:18,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497835549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:13:18,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:13:18,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:13:18,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019995131] [2024-06-03 21:13:18,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:13:18,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:13:18,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:13:18,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:13:18,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:13:18,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:13:18,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 198 transitions, 2293 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:13:18,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:13:18,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:13:18,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:13:18,761 INFO L124 PetriNetUnfolderBase]: 391/731 cut-off events. [2024-06-03 21:13:18,762 INFO L125 PetriNetUnfolderBase]: For 61955/61955 co-relation queries the response was YES. [2024-06-03 21:13:18,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6053 conditions, 731 events. 391/731 cut-off events. For 61955/61955 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3548 event pairs, 37 based on Foata normal form. 2/728 useless extension candidates. Maximal degree in co-relation 5954. Up to 609 conditions per place. [2024-06-03 21:13:18,767 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 177 selfloop transitions, 28 changer transitions 0/208 dead transitions. [2024-06-03 21:13:18,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 208 transitions, 2736 flow [2024-06-03 21:13:18,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:13:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:13:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-03 21:13:18,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-03 21:13:18,769 INFO L175 Difference]: Start difference. First operand has 209 places, 198 transitions, 2293 flow. Second operand 9 states and 110 transitions. [2024-06-03 21:13:18,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 208 transitions, 2736 flow [2024-06-03 21:13:18,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 208 transitions, 2642 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 21:13:18,886 INFO L231 Difference]: Finished difference. Result has 209 places, 199 transitions, 2272 flow [2024-06-03 21:13:18,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2272, PETRI_PLACES=209, PETRI_TRANSITIONS=199} [2024-06-03 21:13:18,886 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 178 predicate places. [2024-06-03 21:13:18,886 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 199 transitions, 2272 flow [2024-06-03 21:13:18,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:13:18,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:13:18,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:13:18,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 21:13:18,887 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-03 21:13:18,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:13:18,887 INFO L85 PathProgramCache]: Analyzing trace with hash -706498798, now seen corresponding path program 2 times [2024-06-03 21:13:18,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:13:18,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827669733] [2024-06-03 21:13:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:13:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:13:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:13:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:13:27,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:13:27,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827669733] [2024-06-03 21:13:27,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827669733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:13:27,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:13:27,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:13:27,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344386603] [2024-06-03 21:13:27,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:13:27,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:13:27,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:13:27,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:13:27,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:13:28,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:13:28,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 199 transitions, 2272 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:13:28,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:13:28,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:13:28,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:13:28,492 INFO L124 PetriNetUnfolderBase]: 395/739 cut-off events. [2024-06-03 21:13:28,492 INFO L125 PetriNetUnfolderBase]: For 64105/64105 co-relation queries the response was YES. [2024-06-03 21:13:28,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6117 conditions, 739 events. 395/739 cut-off events. For 64105/64105 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3595 event pairs, 32 based on Foata normal form. 2/737 useless extension candidates. Maximal degree in co-relation 6017. Up to 649 conditions per place. [2024-06-03 21:13:28,499 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 186 selfloop transitions, 21 changer transitions 0/210 dead transitions. [2024-06-03 21:13:28,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 210 transitions, 2734 flow [2024-06-03 21:13:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:13:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:13:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-03 21:13:28,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-03 21:13:28,500 INFO L175 Difference]: Start difference. First operand has 209 places, 199 transitions, 2272 flow. Second operand 10 states and 117 transitions. [2024-06-03 21:13:28,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 210 transitions, 2734 flow [2024-06-03 21:13:28,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 210 transitions, 2605 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-03 21:13:28,646 INFO L231 Difference]: Finished difference. Result has 211 places, 200 transitions, 2217 flow [2024-06-03 21:13:28,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2217, PETRI_PLACES=211, PETRI_TRANSITIONS=200} [2024-06-03 21:13:28,647 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 180 predicate places. [2024-06-03 21:13:28,647 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 200 transitions, 2217 flow [2024-06-03 21:13:28,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:13:28,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:13:28,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:13:28,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 21:13:28,648 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-03 21:13:28,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:13:28,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1795466436, now seen corresponding path program 3 times [2024-06-03 21:13:28,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:13:28,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255938093] [2024-06-03 21:13:28,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:13:28,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:13:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:13:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:13:37,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:13:37,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255938093] [2024-06-03 21:13:37,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255938093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:13:37,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:13:37,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:13:37,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108664160] [2024-06-03 21:13:37,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:13:37,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:13:37,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:13:37,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:13:37,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:13:37,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:13:37,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 200 transitions, 2217 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:13:37,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:13:37,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:13:37,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:13:37,898 INFO L124 PetriNetUnfolderBase]: 402/749 cut-off events. [2024-06-03 21:13:37,899 INFO L125 PetriNetUnfolderBase]: For 65975/65975 co-relation queries the response was YES. [2024-06-03 21:13:37,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6140 conditions, 749 events. 402/749 cut-off events. For 65975/65975 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3645 event pairs, 34 based on Foata normal form. 2/749 useless extension candidates. Maximal degree in co-relation 6039. Up to 678 conditions per place. [2024-06-03 21:13:37,904 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 195 selfloop transitions, 15 changer transitions 0/213 dead transitions. [2024-06-03 21:13:37,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 213 transitions, 2701 flow [2024-06-03 21:13:37,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:13:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:13:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-03 21:13:37,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-03 21:13:37,907 INFO L175 Difference]: Start difference. First operand has 211 places, 200 transitions, 2217 flow. Second operand 10 states and 115 transitions. [2024-06-03 21:13:37,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 213 transitions, 2701 flow [2024-06-03 21:13:38,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 213 transitions, 2618 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-03 21:13:38,038 INFO L231 Difference]: Finished difference. Result has 213 places, 203 transitions, 2219 flow [2024-06-03 21:13:38,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2219, PETRI_PLACES=213, PETRI_TRANSITIONS=203} [2024-06-03 21:13:38,038 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2024-06-03 21:13:38,038 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 203 transitions, 2219 flow [2024-06-03 21:13:38,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:13:38,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:13:38,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:13:38,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 21:13:38,039 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-03 21:13:38,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:13:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash -706738366, now seen corresponding path program 9 times [2024-06-03 21:13:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:13:38,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515961167] [2024-06-03 21:13:38,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:13:38,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:13:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:13:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:13:46,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:13:46,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515961167] [2024-06-03 21:13:46,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515961167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:13:46,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:13:46,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:13:46,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580792949] [2024-06-03 21:13:46,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:13:46,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:13:46,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:13:46,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:13:46,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:13:46,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 21:13:46,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 203 transitions, 2219 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:13:46,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:13:46,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 21:13:46,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:13:47,103 INFO L124 PetriNetUnfolderBase]: 444/829 cut-off events. [2024-06-03 21:13:47,103 INFO L125 PetriNetUnfolderBase]: For 85563/85563 co-relation queries the response was YES. [2024-06-03 21:13:47,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7421 conditions, 829 events. 444/829 cut-off events. For 85563/85563 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4150 event pairs, 38 based on Foata normal form. 2/826 useless extension candidates. Maximal degree in co-relation 7319. Up to 609 conditions per place. [2024-06-03 21:13:47,111 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 176 selfloop transitions, 50 changer transitions 0/229 dead transitions. [2024-06-03 21:13:47,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 229 transitions, 3479 flow [2024-06-03 21:13:47,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:13:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:13:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 145 transitions. [2024-06-03 21:13:47,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453125 [2024-06-03 21:13:47,112 INFO L175 Difference]: Start difference. First operand has 213 places, 203 transitions, 2219 flow. Second operand 10 states and 145 transitions. [2024-06-03 21:13:47,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 229 transitions, 3479 flow [2024-06-03 21:13:47,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 229 transitions, 3426 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-03 21:13:47,255 INFO L231 Difference]: Finished difference. Result has 217 places, 214 transitions, 2597 flow [2024-06-03 21:13:47,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2597, PETRI_PLACES=217, PETRI_TRANSITIONS=214} [2024-06-03 21:13:47,256 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-03 21:13:47,256 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 214 transitions, 2597 flow [2024-06-03 21:13:47,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:13:47,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:13:47,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:13:47,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 21:13:47,257 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-03 21:13:47,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:13:47,257 INFO L85 PathProgramCache]: Analyzing trace with hash 344677412, now seen corresponding path program 4 times [2024-06-03 21:13:47,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:13:47,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443729337] [2024-06-03 21:13:47,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:13:47,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:13:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:13:55,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:13:55,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:13:55,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443729337] [2024-06-03 21:13:55,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443729337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:13:55,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:13:55,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:13:55,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831683359] [2024-06-03 21:13:55,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:13:55,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:13:55,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:13:55,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:13:55,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:13:55,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:13:55,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 214 transitions, 2597 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:13:55,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:13:55,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:13:55,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:13:55,697 INFO L124 PetriNetUnfolderBase]: 448/837 cut-off events. [2024-06-03 21:13:55,698 INFO L125 PetriNetUnfolderBase]: For 88830/88830 co-relation queries the response was YES. [2024-06-03 21:13:55,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7641 conditions, 837 events. 448/837 cut-off events. For 88830/88830 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4207 event pairs, 36 based on Foata normal form. 2/835 useless extension candidates. Maximal degree in co-relation 7537. Up to 702 conditions per place. [2024-06-03 21:13:55,705 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 185 selfloop transitions, 36 changer transitions 0/224 dead transitions. [2024-06-03 21:13:55,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 224 transitions, 3089 flow [2024-06-03 21:13:55,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:13:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:13:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-03 21:13:55,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-03 21:13:55,706 INFO L175 Difference]: Start difference. First operand has 217 places, 214 transitions, 2597 flow. Second operand 9 states and 113 transitions. [2024-06-03 21:13:55,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 224 transitions, 3089 flow [2024-06-03 21:13:55,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 224 transitions, 2936 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-03 21:13:55,870 INFO L231 Difference]: Finished difference. Result has 222 places, 215 transitions, 2552 flow [2024-06-03 21:13:55,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2444, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2552, PETRI_PLACES=222, PETRI_TRANSITIONS=215} [2024-06-03 21:13:55,870 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 191 predicate places. [2024-06-03 21:13:55,871 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 215 transitions, 2552 flow [2024-06-03 21:13:55,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:13:55,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:13:55,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:13:55,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 21:13:55,871 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-03 21:13:55,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:13:55,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1091604292, now seen corresponding path program 4 times [2024-06-03 21:13:55,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:13:55,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838123985] [2024-06-03 21:13:55,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:13:55,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:13:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:14:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:14:08,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:14:08,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838123985] [2024-06-03 21:14:08,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838123985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:14:08,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:14:08,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:14:08,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719136204] [2024-06-03 21:14:08,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:14:08,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:14:08,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:14:08,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:14:08,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:14:09,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:14:09,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 215 transitions, 2552 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:14:09,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:14:09,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:14:09,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:14:09,615 INFO L124 PetriNetUnfolderBase]: 456/849 cut-off events. [2024-06-03 21:14:09,615 INFO L125 PetriNetUnfolderBase]: For 90407/90407 co-relation queries the response was YES. [2024-06-03 21:14:09,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7696 conditions, 849 events. 456/849 cut-off events. For 90407/90407 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4290 event pairs, 35 based on Foata normal form. 1/848 useless extension candidates. Maximal degree in co-relation 7590. Up to 763 conditions per place. [2024-06-03 21:14:09,623 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 207 selfloop transitions, 19 changer transitions 0/229 dead transitions. [2024-06-03 21:14:09,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 229 transitions, 3250 flow [2024-06-03 21:14:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:14:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:14:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-03 21:14:09,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-03 21:14:09,624 INFO L175 Difference]: Start difference. First operand has 222 places, 215 transitions, 2552 flow. Second operand 10 states and 118 transitions. [2024-06-03 21:14:09,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 229 transitions, 3250 flow [2024-06-03 21:14:09,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 229 transitions, 3152 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-03 21:14:09,794 INFO L231 Difference]: Finished difference. Result has 225 places, 219 transitions, 2585 flow [2024-06-03 21:14:09,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2454, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2585, PETRI_PLACES=225, PETRI_TRANSITIONS=219} [2024-06-03 21:14:09,795 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 194 predicate places. [2024-06-03 21:14:09,795 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 219 transitions, 2585 flow [2024-06-03 21:14:09,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:14:09,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:14:09,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:14:09,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 21:14:09,795 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-03 21:14:09,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:14:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1344926508, now seen corresponding path program 10 times [2024-06-03 21:14:09,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:14:09,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010470212] [2024-06-03 21:14:09,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:14:09,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:14:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:14:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:14:19,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:14:19,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010470212] [2024-06-03 21:14:19,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010470212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:14:19,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:14:19,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:14:19,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098322058] [2024-06-03 21:14:19,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:14:19,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:14:19,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:14:19,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:14:19,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:14:19,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 21:14:19,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 219 transitions, 2585 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:14:19,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:14:19,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 21:14:19,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:14:20,074 INFO L124 PetriNetUnfolderBase]: 477/888 cut-off events. [2024-06-03 21:14:20,075 INFO L125 PetriNetUnfolderBase]: For 103167/103167 co-relation queries the response was YES. [2024-06-03 21:14:20,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8335 conditions, 888 events. 477/888 cut-off events. For 103167/103167 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4532 event pairs, 42 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 8228. Up to 434 conditions per place. [2024-06-03 21:14:20,083 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 138 selfloop transitions, 103 changer transitions 0/244 dead transitions. [2024-06-03 21:14:20,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 244 transitions, 4015 flow [2024-06-03 21:14:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:14:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:14:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2024-06-03 21:14:20,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465625 [2024-06-03 21:14:20,086 INFO L175 Difference]: Start difference. First operand has 225 places, 219 transitions, 2585 flow. Second operand 10 states and 149 transitions. [2024-06-03 21:14:20,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 244 transitions, 4015 flow [2024-06-03 21:14:20,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 244 transitions, 3961 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-03 21:14:20,282 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 3030 flow [2024-06-03 21:14:20,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2531, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3030, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2024-06-03 21:14:20,282 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 198 predicate places. [2024-06-03 21:14:20,283 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 3030 flow [2024-06-03 21:14:20,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:14:20,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:14:20,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:14:20,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 21:14:20,283 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-03 21:14:20,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:14:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1049342190, now seen corresponding path program 5 times [2024-06-03 21:14:20,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:14:20,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858145703] [2024-06-03 21:14:20,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:14:20,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:14:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:14:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:14:31,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:14:31,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858145703] [2024-06-03 21:14:31,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858145703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:14:31,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:14:31,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:14:31,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385429523] [2024-06-03 21:14:31,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:14:31,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:14:31,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:14:31,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:14:31,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:14:31,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:14:31,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 3030 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:14:31,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:14:31,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:14:31,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:14:32,198 INFO L124 PetriNetUnfolderBase]: 481/895 cut-off events. [2024-06-03 21:14:32,198 INFO L125 PetriNetUnfolderBase]: For 108044/108044 co-relation queries the response was YES. [2024-06-03 21:14:32,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8706 conditions, 895 events. 481/895 cut-off events. For 108044/108044 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4604 event pairs, 34 based on Foata normal form. 2/895 useless extension candidates. Maximal degree in co-relation 8597. Up to 780 conditions per place. [2024-06-03 21:14:32,207 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 218 selfloop transitions, 21 changer transitions 0/242 dead transitions. [2024-06-03 21:14:32,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 242 transitions, 3712 flow [2024-06-03 21:14:32,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:14:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:14:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-03 21:14:32,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36079545454545453 [2024-06-03 21:14:32,210 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 3030 flow. Second operand 11 states and 127 transitions. [2024-06-03 21:14:32,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 242 transitions, 3712 flow [2024-06-03 21:14:32,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 242 transitions, 3398 flow, removed 74 selfloop flow, removed 6 redundant places. [2024-06-03 21:14:32,418 INFO L231 Difference]: Finished difference. Result has 234 places, 229 transitions, 2794 flow [2024-06-03 21:14:32,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2716, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2794, PETRI_PLACES=234, PETRI_TRANSITIONS=229} [2024-06-03 21:14:32,418 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2024-06-03 21:14:32,418 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 229 transitions, 2794 flow [2024-06-03 21:14:32,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:14:32,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:14:32,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:14:32,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 21:14:32,419 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-03 21:14:32,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:14:32,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1059826390, now seen corresponding path program 5 times [2024-06-03 21:14:32,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:14:32,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223841416] [2024-06-03 21:14:32,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:14:32,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:14:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:14:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:14:41,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:14:41,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223841416] [2024-06-03 21:14:41,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223841416] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:14:41,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:14:41,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:14:41,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009007385] [2024-06-03 21:14:41,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:14:41,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:14:41,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:14:41,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:14:41,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:14:41,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:14:41,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 229 transitions, 2794 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:14:41,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:14:41,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:14:41,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:14:42,380 INFO L124 PetriNetUnfolderBase]: 479/892 cut-off events. [2024-06-03 21:14:42,380 INFO L125 PetriNetUnfolderBase]: For 101861/101861 co-relation queries the response was YES. [2024-06-03 21:14:42,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8212 conditions, 892 events. 479/892 cut-off events. For 101861/101861 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4582 event pairs, 37 based on Foata normal form. 1/891 useless extension candidates. Maximal degree in co-relation 8103. Up to 809 conditions per place. [2024-06-03 21:14:42,390 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 219 selfloop transitions, 16 changer transitions 0/238 dead transitions. [2024-06-03 21:14:42,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 238 transitions, 3284 flow [2024-06-03 21:14:42,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:14:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:14:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-03 21:14:42,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-03 21:14:42,393 INFO L175 Difference]: Start difference. First operand has 234 places, 229 transitions, 2794 flow. Second operand 10 states and 115 transitions. [2024-06-03 21:14:42,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 238 transitions, 3284 flow [2024-06-03 21:14:42,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 238 transitions, 3193 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-03 21:14:42,587 INFO L231 Difference]: Finished difference. Result has 237 places, 229 transitions, 2740 flow [2024-06-03 21:14:42,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2703, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2740, PETRI_PLACES=237, PETRI_TRANSITIONS=229} [2024-06-03 21:14:42,587 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 206 predicate places. [2024-06-03 21:14:42,588 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 229 transitions, 2740 flow [2024-06-03 21:14:42,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:14:42,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:14:42,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:14:42,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 21:14:42,588 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-03 21:14:42,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:14:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash -713000986, now seen corresponding path program 11 times [2024-06-03 21:14:42,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:14:42,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259619480] [2024-06-03 21:14:42,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:14:42,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:14:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:14:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:14:49,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:14:49,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259619480] [2024-06-03 21:14:49,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259619480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:14:49,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:14:49,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:14:49,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13951126] [2024-06-03 21:14:49,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:14:49,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:14:49,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:14:49,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:14:49,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:14:49,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:14:49,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 229 transitions, 2740 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:14:49,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:14:49,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:14:49,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:14:50,563 INFO L124 PetriNetUnfolderBase]: 487/910 cut-off events. [2024-06-03 21:14:50,563 INFO L125 PetriNetUnfolderBase]: For 107330/107330 co-relation queries the response was YES. [2024-06-03 21:14:50,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8383 conditions, 910 events. 487/910 cut-off events. For 107330/107330 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4728 event pairs, 41 based on Foata normal form. 1/906 useless extension candidates. Maximal degree in co-relation 8273. Up to 738 conditions per place. [2024-06-03 21:14:50,573 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 200 selfloop transitions, 42 changer transitions 0/245 dead transitions. [2024-06-03 21:14:50,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 245 transitions, 3686 flow [2024-06-03 21:14:50,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:14:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:14:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-03 21:14:50,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 21:14:50,574 INFO L175 Difference]: Start difference. First operand has 237 places, 229 transitions, 2740 flow. Second operand 10 states and 128 transitions. [2024-06-03 21:14:50,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 245 transitions, 3686 flow [2024-06-03 21:14:50,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 245 transitions, 3631 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 21:14:50,809 INFO L231 Difference]: Finished difference. Result has 238 places, 234 transitions, 2918 flow [2024-06-03 21:14:50,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2691, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2918, PETRI_PLACES=238, PETRI_TRANSITIONS=234} [2024-06-03 21:14:50,810 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 207 predicate places. [2024-06-03 21:14:50,810 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 234 transitions, 2918 flow [2024-06-03 21:14:50,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:14:50,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:14:50,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:14:50,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 21:14:50,810 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-03 21:14:50,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:14:50,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1803756084, now seen corresponding path program 12 times [2024-06-03 21:14:50,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:14:50,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734811834] [2024-06-03 21:14:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:14:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:14:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:14:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:14:59,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:14:59,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734811834] [2024-06-03 21:14:59,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734811834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:14:59,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:14:59,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:14:59,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193929777] [2024-06-03 21:14:59,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:14:59,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:14:59,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:14:59,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:14:59,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:14:59,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:14:59,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 234 transitions, 2918 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:14:59,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:14:59,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:14:59,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:15:00,433 INFO L124 PetriNetUnfolderBase]: 490/917 cut-off events. [2024-06-03 21:15:00,434 INFO L125 PetriNetUnfolderBase]: For 111186/111186 co-relation queries the response was YES. [2024-06-03 21:15:00,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8526 conditions, 917 events. 490/917 cut-off events. For 111186/111186 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4781 event pairs, 39 based on Foata normal form. 1/913 useless extension candidates. Maximal degree in co-relation 8415. Up to 616 conditions per place. [2024-06-03 21:15:00,471 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 162 selfloop transitions, 91 changer transitions 0/256 dead transitions. [2024-06-03 21:15:00,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 256 transitions, 4043 flow [2024-06-03 21:15:00,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:15:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:15:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-03 21:15:00,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-03 21:15:00,476 INFO L175 Difference]: Start difference. First operand has 238 places, 234 transitions, 2918 flow. Second operand 10 states and 129 transitions. [2024-06-03 21:15:00,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 256 transitions, 4043 flow [2024-06-03 21:15:00,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 256 transitions, 3920 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-03 21:15:00,673 INFO L231 Difference]: Finished difference. Result has 244 places, 245 transitions, 3360 flow [2024-06-03 21:15:00,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2800, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3360, PETRI_PLACES=244, PETRI_TRANSITIONS=245} [2024-06-03 21:15:00,674 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 213 predicate places. [2024-06-03 21:15:00,674 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 245 transitions, 3360 flow [2024-06-03 21:15:00,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:15:00,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:15:00,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:15:00,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 21:15:00,675 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-03 21:15:00,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:15:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash -706499108, now seen corresponding path program 6 times [2024-06-03 21:15:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:15:00,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961014258] [2024-06-03 21:15:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:15:00,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:15:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:15:08,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-03 21:15:08,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:15:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961014258] [2024-06-03 21:15:08,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961014258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:15:08,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:15:08,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:15:08,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082101220] [2024-06-03 21:15:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:15:08,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:15:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:15:08,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:15:08,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:15:09,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:15:09,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 245 transitions, 3360 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:15:09,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:15:09,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:15:09,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:15:09,494 INFO L124 PetriNetUnfolderBase]: 493/920 cut-off events. [2024-06-03 21:15:09,494 INFO L125 PetriNetUnfolderBase]: For 114207/114207 co-relation queries the response was YES. [2024-06-03 21:15:09,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8878 conditions, 920 events. 493/920 cut-off events. For 114207/114207 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4792 event pairs, 40 based on Foata normal form. 1/916 useless extension candidates. Maximal degree in co-relation 8763. Up to 740 conditions per place. [2024-06-03 21:15:09,504 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 204 selfloop transitions, 50 changer transitions 0/257 dead transitions. [2024-06-03 21:15:09,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 257 transitions, 4090 flow [2024-06-03 21:15:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:15:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:15:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-03 21:15:09,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-03 21:15:09,505 INFO L175 Difference]: Start difference. First operand has 244 places, 245 transitions, 3360 flow. Second operand 10 states and 129 transitions. [2024-06-03 21:15:09,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 257 transitions, 4090 flow [2024-06-03 21:15:09,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 257 transitions, 3980 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-03 21:15:09,713 INFO L231 Difference]: Finished difference. Result has 249 places, 247 transitions, 3403 flow [2024-06-03 21:15:09,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3250, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3403, PETRI_PLACES=249, PETRI_TRANSITIONS=247} [2024-06-03 21:15:09,714 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-03 21:15:09,714 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 247 transitions, 3403 flow [2024-06-03 21:15:09,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:15:09,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:15:09,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:15:09,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-03 21:15:09,714 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-03 21:15:09,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:15:09,715 INFO L85 PathProgramCache]: Analyzing trace with hash 116536694, now seen corresponding path program 13 times [2024-06-03 21:15:09,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:15:09,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718784210] [2024-06-03 21:15:09,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:15:09,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:15:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:15:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:15:18,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:15:18,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718784210] [2024-06-03 21:15:18,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718784210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:15:18,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:15:18,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:15:18,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817006236] [2024-06-03 21:15:18,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:15:18,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:15:18,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:15:18,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:15:18,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:15:18,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:15:18,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 247 transitions, 3403 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:15:18,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:15:18,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:15:18,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:15:19,242 INFO L124 PetriNetUnfolderBase]: 491/919 cut-off events. [2024-06-03 21:15:19,243 INFO L125 PetriNetUnfolderBase]: For 114902/114902 co-relation queries the response was YES. [2024-06-03 21:15:19,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8823 conditions, 919 events. 491/919 cut-off events. For 114902/114902 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4798 event pairs, 38 based on Foata normal form. 1/915 useless extension candidates. Maximal degree in co-relation 8706. Up to 763 conditions per place. [2024-06-03 21:15:19,252 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 216 selfloop transitions, 37 changer transitions 0/256 dead transitions. [2024-06-03 21:15:19,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 256 transitions, 3929 flow [2024-06-03 21:15:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:15:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:15:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-03 21:15:19,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-03 21:15:19,253 INFO L175 Difference]: Start difference. First operand has 249 places, 247 transitions, 3403 flow. Second operand 10 states and 123 transitions. [2024-06-03 21:15:19,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 256 transitions, 3929 flow [2024-06-03 21:15:19,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 256 transitions, 3709 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-03 21:15:19,460 INFO L231 Difference]: Finished difference. Result has 250 places, 247 transitions, 3262 flow [2024-06-03 21:15:19,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3183, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3262, PETRI_PLACES=250, PETRI_TRANSITIONS=247} [2024-06-03 21:15:19,460 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 219 predicate places. [2024-06-03 21:15:19,461 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 247 transitions, 3262 flow [2024-06-03 21:15:19,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:15:19,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:15:19,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:15:19,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-03 21:15:19,461 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-03 21:15:19,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:15:19,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1345156900, now seen corresponding path program 7 times [2024-06-03 21:15:19,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:15:19,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709053263] [2024-06-03 21:15:19,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:15:19,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:15:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:15:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:15:27,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:15:27,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709053263] [2024-06-03 21:15:27,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709053263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:15:27,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:15:27,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:15:27,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033932298] [2024-06-03 21:15:27,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:15:27,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:15:27,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:15:27,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:15:27,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:15:27,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:15:27,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 247 transitions, 3262 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:15:27,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:15:27,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:15:27,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:15:28,268 INFO L124 PetriNetUnfolderBase]: 489/916 cut-off events. [2024-06-03 21:15:28,268 INFO L125 PetriNetUnfolderBase]: For 114186/114186 co-relation queries the response was YES. [2024-06-03 21:15:28,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8594 conditions, 916 events. 489/916 cut-off events. For 114186/114186 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4776 event pairs, 38 based on Foata normal form. 1/912 useless extension candidates. Maximal degree in co-relation 8477. Up to 683 conditions per place. [2024-06-03 21:15:28,278 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 184 selfloop transitions, 69 changer transitions 0/256 dead transitions. [2024-06-03 21:15:28,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 256 transitions, 3788 flow [2024-06-03 21:15:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:15:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:15:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-03 21:15:28,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-03 21:15:28,280 INFO L175 Difference]: Start difference. First operand has 250 places, 247 transitions, 3262 flow. Second operand 10 states and 126 transitions. [2024-06-03 21:15:28,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 256 transitions, 3788 flow [2024-06-03 21:15:28,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 256 transitions, 3626 flow, removed 40 selfloop flow, removed 8 redundant places. [2024-06-03 21:15:28,503 INFO L231 Difference]: Finished difference. Result has 252 places, 247 transitions, 3243 flow [2024-06-03 21:15:28,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3100, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3243, PETRI_PLACES=252, PETRI_TRANSITIONS=247} [2024-06-03 21:15:28,511 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 221 predicate places. [2024-06-03 21:15:28,511 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 247 transitions, 3243 flow [2024-06-03 21:15:28,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:15:28,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:15:28,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:15:28,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-03 21:15:28,512 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-03 21:15:28,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:15:28,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1345157148, now seen corresponding path program 14 times [2024-06-03 21:15:28,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:15:28,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265721560] [2024-06-03 21:15:28,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:15:28,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:15:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:15:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:15:35,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:15:35,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265721560] [2024-06-03 21:15:35,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265721560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:15:35,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:15:35,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:15:35,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884529580] [2024-06-03 21:15:35,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:15:35,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:15:35,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:15:35,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:15:35,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:15:35,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 21:15:35,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 247 transitions, 3243 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:15:35,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:15:35,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 21:15:35,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:15:36,331 INFO L124 PetriNetUnfolderBase]: 490/920 cut-off events. [2024-06-03 21:15:36,332 INFO L125 PetriNetUnfolderBase]: For 115421/115421 co-relation queries the response was YES. [2024-06-03 21:15:36,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8531 conditions, 920 events. 490/920 cut-off events. For 115421/115421 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4836 event pairs, 40 based on Foata normal form. 2/917 useless extension candidates. Maximal degree in co-relation 8414. Up to 454 conditions per place. [2024-06-03 21:15:36,341 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 139 selfloop transitions, 120 changer transitions 0/262 dead transitions. [2024-06-03 21:15:36,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 262 transitions, 4332 flow [2024-06-03 21:15:36,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:15:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:15:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2024-06-03 21:15:36,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45625 [2024-06-03 21:15:36,344 INFO L175 Difference]: Start difference. First operand has 252 places, 247 transitions, 3243 flow. Second operand 10 states and 146 transitions. [2024-06-03 21:15:36,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 262 transitions, 4332 flow [2024-06-03 21:15:36,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 262 transitions, 4185 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 21:15:36,594 INFO L231 Difference]: Finished difference. Result has 253 places, 250 transitions, 3417 flow [2024-06-03 21:15:36,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3096, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3417, PETRI_PLACES=253, PETRI_TRANSITIONS=250} [2024-06-03 21:15:36,595 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 222 predicate places. [2024-06-03 21:15:36,595 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 250 transitions, 3417 flow [2024-06-03 21:15:36,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:15:36,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:15:36,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:15:36,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-03 21:15:36,596 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-03 21:15:36,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:15:36,596 INFO L85 PathProgramCache]: Analyzing trace with hash -706507478, now seen corresponding path program 8 times [2024-06-03 21:15:36,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:15:36,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328058163] [2024-06-03 21:15:36,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:15:36,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:15:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:15:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:15:47,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:15:47,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328058163] [2024-06-03 21:15:47,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328058163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:15:47,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:15:47,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:15:47,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680550474] [2024-06-03 21:15:47,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:15:47,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:15:47,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:15:47,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:15:47,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:15:47,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:15:47,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 250 transitions, 3417 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:15:47,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:15:47,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:15:47,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:15:47,972 INFO L124 PetriNetUnfolderBase]: 488/915 cut-off events. [2024-06-03 21:15:47,973 INFO L125 PetriNetUnfolderBase]: For 114170/114170 co-relation queries the response was YES. [2024-06-03 21:15:47,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8597 conditions, 915 events. 488/915 cut-off events. For 114170/114170 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4782 event pairs, 39 based on Foata normal form. 1/911 useless extension candidates. Maximal degree in co-relation 8479. Up to 750 conditions per place. [2024-06-03 21:15:47,982 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 214 selfloop transitions, 42 changer transitions 0/259 dead transitions. [2024-06-03 21:15:47,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 259 transitions, 3949 flow [2024-06-03 21:15:47,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:15:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:15:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-03 21:15:47,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-03 21:15:47,983 INFO L175 Difference]: Start difference. First operand has 253 places, 250 transitions, 3417 flow. Second operand 10 states and 126 transitions. [2024-06-03 21:15:47,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 259 transitions, 3949 flow [2024-06-03 21:15:48,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 259 transitions, 3624 flow, removed 42 selfloop flow, removed 8 redundant places. [2024-06-03 21:15:48,231 INFO L231 Difference]: Finished difference. Result has 255 places, 250 transitions, 3181 flow [2024-06-03 21:15:48,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3092, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3181, PETRI_PLACES=255, PETRI_TRANSITIONS=250} [2024-06-03 21:15:48,231 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 224 predicate places. [2024-06-03 21:15:48,231 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 250 transitions, 3181 flow [2024-06-03 21:15:48,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:15:48,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:15:48,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:15:48,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-03 21:15:48,232 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-03 21:15:48,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:15:48,232 INFO L85 PathProgramCache]: Analyzing trace with hash -706507726, now seen corresponding path program 15 times [2024-06-03 21:15:48,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:15:48,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590300581] [2024-06-03 21:15:48,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:15:48,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:15:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:15:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:15:57,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:15:57,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590300581] [2024-06-03 21:15:57,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590300581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:15:57,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:15:57,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:15:57,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745655325] [2024-06-03 21:15:57,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:15:57,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:15:57,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:15:57,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:15:57,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:15:57,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 21:15:57,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 250 transitions, 3181 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:15:57,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:15:57,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 21:15:57,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:15:58,364 INFO L124 PetriNetUnfolderBase]: 486/912 cut-off events. [2024-06-03 21:15:58,369 INFO L125 PetriNetUnfolderBase]: For 111508/111508 co-relation queries the response was YES. [2024-06-03 21:15:58,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8208 conditions, 912 events. 486/912 cut-off events. For 111508/111508 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4778 event pairs, 38 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 8090. Up to 728 conditions per place. [2024-06-03 21:15:58,378 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 208 selfloop transitions, 50 changer transitions 0/261 dead transitions. [2024-06-03 21:15:58,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 261 transitions, 3910 flow [2024-06-03 21:15:58,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:15:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:15:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-03 21:15:58,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.428125 [2024-06-03 21:15:58,379 INFO L175 Difference]: Start difference. First operand has 255 places, 250 transitions, 3181 flow. Second operand 10 states and 137 transitions. [2024-06-03 21:15:58,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 261 transitions, 3910 flow [2024-06-03 21:15:58,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 261 transitions, 3788 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-03 21:15:58,632 INFO L231 Difference]: Finished difference. Result has 256 places, 251 transitions, 3193 flow [2024-06-03 21:15:58,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3059, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3193, PETRI_PLACES=256, PETRI_TRANSITIONS=251} [2024-06-03 21:15:58,632 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 225 predicate places. [2024-06-03 21:15:58,632 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 251 transitions, 3193 flow [2024-06-03 21:15:58,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:15:58,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:15:58,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:15:58,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-03 21:15:58,633 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-03 21:15:58,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:15:58,634 INFO L85 PathProgramCache]: Analyzing trace with hash -706744876, now seen corresponding path program 16 times [2024-06-03 21:15:58,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:15:58,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937660964] [2024-06-03 21:15:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:15:58,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:15:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:16:08,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:16:08,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:16:08,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937660964] [2024-06-03 21:16:08,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937660964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:16:08,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:16:08,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:16:08,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558542445] [2024-06-03 21:16:08,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:16:08,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:16:08,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:16:08,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:16:08,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:16:08,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:16:08,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 251 transitions, 3193 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:16:08,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:16:08,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:16:08,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:16:09,586 INFO L124 PetriNetUnfolderBase]: 489/919 cut-off events. [2024-06-03 21:16:09,587 INFO L125 PetriNetUnfolderBase]: For 114898/114898 co-relation queries the response was YES. [2024-06-03 21:16:09,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8268 conditions, 919 events. 489/919 cut-off events. For 114898/114898 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4817 event pairs, 38 based on Foata normal form. 1/915 useless extension candidates. Maximal degree in co-relation 8150. Up to 685 conditions per place. [2024-06-03 21:16:09,597 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 197 selfloop transitions, 65 changer transitions 0/265 dead transitions. [2024-06-03 21:16:09,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 265 transitions, 4289 flow [2024-06-03 21:16:09,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:16:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:16:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-03 21:16:09,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-03 21:16:09,600 INFO L175 Difference]: Start difference. First operand has 256 places, 251 transitions, 3193 flow. Second operand 10 states and 134 transitions. [2024-06-03 21:16:09,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 265 transitions, 4289 flow [2024-06-03 21:16:09,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 265 transitions, 4055 flow, removed 49 selfloop flow, removed 8 redundant places. [2024-06-03 21:16:09,853 INFO L231 Difference]: Finished difference. Result has 258 places, 253 transitions, 3148 flow [2024-06-03 21:16:09,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2959, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3148, PETRI_PLACES=258, PETRI_TRANSITIONS=253} [2024-06-03 21:16:09,853 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 227 predicate places. [2024-06-03 21:16:09,854 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 253 transitions, 3148 flow [2024-06-03 21:16:09,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:16:09,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:16:09,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:16:09,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-03 21:16:09,858 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-03 21:16:09,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:16:09,858 INFO L85 PathProgramCache]: Analyzing trace with hash -706738118, now seen corresponding path program 9 times [2024-06-03 21:16:09,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:16:09,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843608943] [2024-06-03 21:16:09,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:16:09,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:16:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:16:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:16:17,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:16:17,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843608943] [2024-06-03 21:16:17,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843608943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:16:17,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:16:17,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:16:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738993218] [2024-06-03 21:16:17,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:16:17,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:16:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:16:17,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:16:17,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:16:18,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:16:18,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 253 transitions, 3148 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:16:18,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:16:18,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:16:18,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:16:18,581 INFO L124 PetriNetUnfolderBase]: 486/913 cut-off events. [2024-06-03 21:16:18,581 INFO L125 PetriNetUnfolderBase]: For 114115/114115 co-relation queries the response was YES. [2024-06-03 21:16:18,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8121 conditions, 913 events. 486/913 cut-off events. For 114115/114115 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4784 event pairs, 41 based on Foata normal form. 1/909 useless extension candidates. Maximal degree in co-relation 8002. Up to 714 conditions per place. [2024-06-03 21:16:18,591 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 212 selfloop transitions, 48 changer transitions 0/263 dead transitions. [2024-06-03 21:16:18,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 263 transitions, 3694 flow [2024-06-03 21:16:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:16:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:16:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-03 21:16:18,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-03 21:16:18,594 INFO L175 Difference]: Start difference. First operand has 258 places, 253 transitions, 3148 flow. Second operand 10 states and 129 transitions. [2024-06-03 21:16:18,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 263 transitions, 3694 flow [2024-06-03 21:16:18,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 263 transitions, 3554 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-03 21:16:18,854 INFO L231 Difference]: Finished difference. Result has 262 places, 253 transitions, 3109 flow [2024-06-03 21:16:18,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3008, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3109, PETRI_PLACES=262, PETRI_TRANSITIONS=253} [2024-06-03 21:16:18,854 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 231 predicate places. [2024-06-03 21:16:18,855 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 253 transitions, 3109 flow [2024-06-03 21:16:18,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:16:18,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:16:18,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:16:18,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-03 21:16:18,856 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-03 21:16:18,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:16:18,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1795475364, now seen corresponding path program 17 times [2024-06-03 21:16:18,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:16:18,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184923990] [2024-06-03 21:16:18,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:16:18,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:16:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:16:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:16:28,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:16:28,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184923990] [2024-06-03 21:16:28,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184923990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:16:28,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:16:28,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:16:28,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661791345] [2024-06-03 21:16:28,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:16:28,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:16:28,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:16:28,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:16:28,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:16:28,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:16:28,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 253 transitions, 3109 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:16:28,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:16:28,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:16:28,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:16:28,805 INFO L124 PetriNetUnfolderBase]: 484/909 cut-off events. [2024-06-03 21:16:28,806 INFO L125 PetriNetUnfolderBase]: For 112718/112718 co-relation queries the response was YES. [2024-06-03 21:16:28,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7964 conditions, 909 events. 484/909 cut-off events. For 112718/112718 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4742 event pairs, 33 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 7844. Up to 819 conditions per place. [2024-06-03 21:16:28,815 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 243 selfloop transitions, 16 changer transitions 0/262 dead transitions. [2024-06-03 21:16:28,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 262 transitions, 3647 flow [2024-06-03 21:16:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:16:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:16:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-03 21:16:28,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-03 21:16:28,816 INFO L175 Difference]: Start difference. First operand has 262 places, 253 transitions, 3109 flow. Second operand 10 states and 115 transitions. [2024-06-03 21:16:28,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 262 transitions, 3647 flow [2024-06-03 21:16:29,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 262 transitions, 3508 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-03 21:16:29,095 INFO L231 Difference]: Finished difference. Result has 264 places, 253 transitions, 3007 flow [2024-06-03 21:16:29,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2970, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3007, PETRI_PLACES=264, PETRI_TRANSITIONS=253} [2024-06-03 21:16:29,096 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 233 predicate places. [2024-06-03 21:16:29,096 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 253 transitions, 3007 flow [2024-06-03 21:16:29,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:16:29,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:16:29,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:16:29,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-03 21:16:29,097 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-03 21:16:29,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:16:29,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1049698380, now seen corresponding path program 6 times [2024-06-03 21:16:29,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:16:29,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626470516] [2024-06-03 21:16:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:16:29,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:16:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:16:37,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:16:37,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:16:37,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626470516] [2024-06-03 21:16:37,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626470516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:16:37,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:16:37,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:16:37,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960758465] [2024-06-03 21:16:37,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:16:37,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:16:37,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:16:37,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:16:37,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:16:37,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 21:16:37,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 253 transitions, 3007 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:16:37,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:16:37,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 21:16:37,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:16:37,908 INFO L124 PetriNetUnfolderBase]: 481/902 cut-off events. [2024-06-03 21:16:37,909 INFO L125 PetriNetUnfolderBase]: For 111002/111002 co-relation queries the response was YES. [2024-06-03 21:16:37,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7681 conditions, 902 events. 481/902 cut-off events. For 111002/111002 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4680 event pairs, 32 based on Foata normal form. 2/902 useless extension candidates. Maximal degree in co-relation 7560. Up to 805 conditions per place. [2024-06-03 21:16:37,916 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 242 selfloop transitions, 19 changer transitions 0/264 dead transitions. [2024-06-03 21:16:37,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 264 transitions, 3553 flow [2024-06-03 21:16:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:16:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:16:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-03 21:16:37,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-03 21:16:37,919 INFO L175 Difference]: Start difference. First operand has 264 places, 253 transitions, 3007 flow. Second operand 11 states and 137 transitions. [2024-06-03 21:16:37,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 264 transitions, 3553 flow [2024-06-03 21:16:38,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 264 transitions, 3494 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-03 21:16:38,183 INFO L231 Difference]: Finished difference. Result has 267 places, 253 transitions, 2990 flow [2024-06-03 21:16:38,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2948, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2990, PETRI_PLACES=267, PETRI_TRANSITIONS=253} [2024-06-03 21:16:38,184 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 236 predicate places. [2024-06-03 21:16:38,184 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 253 transitions, 2990 flow [2024-06-03 21:16:38,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:16:38,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:16:38,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:16:38,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-03 21:16:38,184 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-03 21:16:38,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:16:38,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1795178446, now seen corresponding path program 10 times [2024-06-03 21:16:38,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:16:38,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081966658] [2024-06-03 21:16:38,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:16:38,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:16:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:16: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-03 21:16:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:16:47,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081966658] [2024-06-03 21:16:47,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081966658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:16:47,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:16:47,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:16:47,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382038555] [2024-06-03 21:16:47,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:16:47,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:16:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:16:47,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:16:47,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:16:48,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:16:48,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 253 transitions, 2990 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:16:48,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:16:48,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:16:48,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:16:48,529 INFO L124 PetriNetUnfolderBase]: 479/901 cut-off events. [2024-06-03 21:16:48,530 INFO L125 PetriNetUnfolderBase]: For 105940/105940 co-relation queries the response was YES. [2024-06-03 21:16:48,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7559 conditions, 901 events. 479/901 cut-off events. For 105940/105940 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4700 event pairs, 32 based on Foata normal form. 1/900 useless extension candidates. Maximal degree in co-relation 7437. Up to 796 conditions per place. [2024-06-03 21:16:48,538 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 236 selfloop transitions, 24 changer transitions 0/263 dead transitions. [2024-06-03 21:16:48,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 263 transitions, 3532 flow [2024-06-03 21:16:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:16:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:16:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-03 21:16:48,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-03 21:16:48,539 INFO L175 Difference]: Start difference. First operand has 267 places, 253 transitions, 2990 flow. Second operand 11 states and 128 transitions. [2024-06-03 21:16:48,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 263 transitions, 3532 flow [2024-06-03 21:16:48,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 263 transitions, 3417 flow, removed 15 selfloop flow, removed 13 redundant places. [2024-06-03 21:16:48,829 INFO L231 Difference]: Finished difference. Result has 265 places, 253 transitions, 2928 flow [2024-06-03 21:16:48,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2875, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2928, PETRI_PLACES=265, PETRI_TRANSITIONS=253} [2024-06-03 21:16:48,829 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 234 predicate places. [2024-06-03 21:16:48,829 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 253 transitions, 2928 flow [2024-06-03 21:16:48,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:16:48,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:16:48,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-03 21:16:48,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-03 21:16:48,830 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-03 21:16:48,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:16:48,830 INFO L85 PathProgramCache]: Analyzing trace with hash -635276989, now seen corresponding path program 1 times [2024-06-03 21:16:48,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:16:48,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393759728] [2024-06-03 21:16:48,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:16:48,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:16:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:16:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:16:57,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:16:57,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393759728] [2024-06-03 21:16:57,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393759728] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:16:57,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:16:57,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:16:57,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29488777] [2024-06-03 21:16:57,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:16:57,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:16:57,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:16:57,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:16:57,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:16:57,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:16:57,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 253 transitions, 2928 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:16:57,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:16:57,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:16:57,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:16:58,094 INFO L124 PetriNetUnfolderBase]: 483/909 cut-off events. [2024-06-03 21:16:58,095 INFO L125 PetriNetUnfolderBase]: For 112040/112040 co-relation queries the response was YES. [2024-06-03 21:16:58,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7599 conditions, 909 events. 483/909 cut-off events. For 112040/112040 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4753 event pairs, 13 based on Foata normal form. 2/909 useless extension candidates. Maximal degree in co-relation 7477. Up to 761 conditions per place. [2024-06-03 21:16:58,104 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 250 selfloop transitions, 20 changer transitions 0/273 dead transitions. [2024-06-03 21:16:58,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 273 transitions, 3544 flow [2024-06-03 21:16:58,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:16:58,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:16:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-03 21:16:58,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-03 21:16:58,106 INFO L175 Difference]: Start difference. First operand has 265 places, 253 transitions, 2928 flow. Second operand 10 states and 123 transitions. [2024-06-03 21:16:58,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 273 transitions, 3544 flow [2024-06-03 21:16:58,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 273 transitions, 3461 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-03 21:16:58,383 INFO L231 Difference]: Finished difference. Result has 264 places, 254 transitions, 2917 flow [2024-06-03 21:16:58,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2845, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2917, PETRI_PLACES=264, PETRI_TRANSITIONS=254} [2024-06-03 21:16:58,384 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 233 predicate places. [2024-06-03 21:16:58,384 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 254 transitions, 2917 flow [2024-06-03 21:16:58,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:16:58,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:16:58,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:16:58,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-03 21:16:58,385 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-03 21:16:58,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:16:58,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1535897479, now seen corresponding path program 2 times [2024-06-03 21:16:58,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:16:58,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045547303] [2024-06-03 21:16:58,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:16:58,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:16:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:17:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:17:08,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:17:08,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045547303] [2024-06-03 21:17:08,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045547303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:17:08,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:17:08,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:17:08,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248371359] [2024-06-03 21:17:08,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:17:08,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:17:08,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:17:08,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:17:08,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:17:08,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:17:08,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 254 transitions, 2917 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:17:08,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:17:08,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:17:08,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:17:08,951 INFO L124 PetriNetUnfolderBase]: 487/915 cut-off events. [2024-06-03 21:17:08,952 INFO L125 PetriNetUnfolderBase]: For 114753/114753 co-relation queries the response was YES. [2024-06-03 21:17:08,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7671 conditions, 915 events. 487/915 cut-off events. For 114753/114753 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4780 event pairs, 27 based on Foata normal form. 2/915 useless extension candidates. Maximal degree in co-relation 7549. Up to 786 conditions per place. [2024-06-03 21:17:08,961 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 249 selfloop transitions, 21 changer transitions 0/273 dead transitions. [2024-06-03 21:17:08,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 273 transitions, 3533 flow [2024-06-03 21:17:08,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:17:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:17:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 21:17:08,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-03 21:17:08,962 INFO L175 Difference]: Start difference. First operand has 264 places, 254 transitions, 2917 flow. Second operand 10 states and 124 transitions. [2024-06-03 21:17:08,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 273 transitions, 3533 flow [2024-06-03 21:17:09,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 273 transitions, 3471 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-03 21:17:09,248 INFO L231 Difference]: Finished difference. Result has 266 places, 255 transitions, 2931 flow [2024-06-03 21:17:09,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2931, PETRI_PLACES=266, PETRI_TRANSITIONS=255} [2024-06-03 21:17:09,249 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 235 predicate places. [2024-06-03 21:17:09,249 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 255 transitions, 2931 flow [2024-06-03 21:17:09,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:17:09,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:17:09,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:17:09,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-03 21:17:09,250 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-03 21:17:09,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:17:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1622737159, now seen corresponding path program 3 times [2024-06-03 21:17:09,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:17:09,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206359247] [2024-06-03 21:17:09,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:17:09,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:17:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:17:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:17:17,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:17:17,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206359247] [2024-06-03 21:17:17,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206359247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:17:17,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:17:17,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:17:17,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408215069] [2024-06-03 21:17:17,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:17:17,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:17:17,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:17:17,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:17:17,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:17:17,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:17:17,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 255 transitions, 2931 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:17:17,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:17:17,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:17:17,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:17:18,079 INFO L124 PetriNetUnfolderBase]: 491/923 cut-off events. [2024-06-03 21:17:18,079 INFO L125 PetriNetUnfolderBase]: For 119335/119335 co-relation queries the response was YES. [2024-06-03 21:17:18,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7737 conditions, 923 events. 491/923 cut-off events. For 119335/119335 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4858 event pairs, 29 based on Foata normal form. 2/923 useless extension candidates. Maximal degree in co-relation 7614. Up to 799 conditions per place. [2024-06-03 21:17:18,089 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 248 selfloop transitions, 22 changer transitions 0/273 dead transitions. [2024-06-03 21:17:18,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 273 transitions, 3547 flow [2024-06-03 21:17:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:17:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:17:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 21:17:18,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-03 21:17:18,091 INFO L175 Difference]: Start difference. First operand has 266 places, 255 transitions, 2931 flow. Second operand 10 states and 124 transitions. [2024-06-03 21:17:18,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 273 transitions, 3547 flow [2024-06-03 21:17:18,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 273 transitions, 3481 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-03 21:17:18,360 INFO L231 Difference]: Finished difference. Result has 268 places, 256 transitions, 2945 flow [2024-06-03 21:17:18,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2865, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2945, PETRI_PLACES=268, PETRI_TRANSITIONS=256} [2024-06-03 21:17:18,361 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 237 predicate places. [2024-06-03 21:17:18,361 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 256 transitions, 2945 flow [2024-06-03 21:17:18,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:17:18,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:17:18,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:17:18,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-03 21:17:18,362 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-03 21:17:18,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:17:18,362 INFO L85 PathProgramCache]: Analyzing trace with hash 907158513, now seen corresponding path program 4 times [2024-06-03 21:17:18,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:17:18,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068748364] [2024-06-03 21:17:18,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:17:18,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:17:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:17:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:17:27,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:17:27,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068748364] [2024-06-03 21:17:27,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068748364] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:17:27,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:17:27,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:17:27,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049319265] [2024-06-03 21:17:27,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:17:27,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:17:27,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:17:27,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:17:27,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:17:27,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:17:27,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 256 transitions, 2945 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:17:27,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:17:27,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:17:27,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:17:27,974 INFO L124 PetriNetUnfolderBase]: 495/931 cut-off events. [2024-06-03 21:17:27,975 INFO L125 PetriNetUnfolderBase]: For 122092/122092 co-relation queries the response was YES. [2024-06-03 21:17:27,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7803 conditions, 931 events. 495/931 cut-off events. For 122092/122092 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4910 event pairs, 29 based on Foata normal form. 2/931 useless extension candidates. Maximal degree in co-relation 7679. Up to 804 conditions per place. [2024-06-03 21:17:27,985 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 243 selfloop transitions, 25 changer transitions 0/271 dead transitions. [2024-06-03 21:17:27,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 271 transitions, 3547 flow [2024-06-03 21:17:27,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:17:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:17:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-03 21:17:27,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-03 21:17:27,988 INFO L175 Difference]: Start difference. First operand has 268 places, 256 transitions, 2945 flow. Second operand 10 states and 123 transitions. [2024-06-03 21:17:27,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 271 transitions, 3547 flow [2024-06-03 21:17:28,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 271 transitions, 3477 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-03 21:17:28,316 INFO L231 Difference]: Finished difference. Result has 270 places, 257 transitions, 2963 flow [2024-06-03 21:17:28,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2875, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2963, PETRI_PLACES=270, PETRI_TRANSITIONS=257} [2024-06-03 21:17:28,317 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 239 predicate places. [2024-06-03 21:17:28,317 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 257 transitions, 2963 flow [2024-06-03 21:17:28,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:17:28,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:17:28,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:17:28,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-03 21:17:28,317 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-03 21:17:28,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:17:28,318 INFO L85 PathProgramCache]: Analyzing trace with hash 901796133, now seen corresponding path program 5 times [2024-06-03 21:17:28,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:17:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809807924] [2024-06-03 21:17:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:17:28,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:17:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:17:39,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-03 21:17:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:17:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809807924] [2024-06-03 21:17:39,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809807924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:17:39,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:17:39,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:17:39,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594524935] [2024-06-03 21:17:39,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:17:39,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:17:39,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:17:39,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:17:39,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:17:39,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:17:39,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 257 transitions, 2963 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:17:39,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:17:39,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:17:39,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:17:40,180 INFO L124 PetriNetUnfolderBase]: 499/939 cut-off events. [2024-06-03 21:17:40,181 INFO L125 PetriNetUnfolderBase]: For 124756/124756 co-relation queries the response was YES. [2024-06-03 21:17:40,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7872 conditions, 939 events. 499/939 cut-off events. For 124756/124756 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 4988 event pairs, 31 based on Foata normal form. 2/939 useless extension candidates. Maximal degree in co-relation 7747. Up to 820 conditions per place. [2024-06-03 21:17:40,191 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 246 selfloop transitions, 24 changer transitions 0/273 dead transitions. [2024-06-03 21:17:40,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 273 transitions, 3584 flow [2024-06-03 21:17:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:17:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:17:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-03 21:17:40,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-03 21:17:40,192 INFO L175 Difference]: Start difference. First operand has 270 places, 257 transitions, 2963 flow. Second operand 10 states and 121 transitions. [2024-06-03 21:17:40,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 273 transitions, 3584 flow [2024-06-03 21:17:40,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 273 transitions, 3504 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-03 21:17:40,483 INFO L231 Difference]: Finished difference. Result has 273 places, 259 transitions, 2989 flow [2024-06-03 21:17:40,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2885, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2989, PETRI_PLACES=273, PETRI_TRANSITIONS=259} [2024-06-03 21:17:40,483 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 242 predicate places. [2024-06-03 21:17:40,483 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 259 transitions, 2989 flow [2024-06-03 21:17:40,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:17:40,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:17:40,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:17:40,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-03 21:17:40,484 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-03 21:17:40,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:17:40,484 INFO L85 PathProgramCache]: Analyzing trace with hash 901648263, now seen corresponding path program 6 times [2024-06-03 21:17:40,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:17:40,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580093357] [2024-06-03 21:17:40,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:17:40,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:17:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:17:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:17:49,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:17:49,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580093357] [2024-06-03 21:17:49,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580093357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:17:49,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:17:49,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:17:49,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822116867] [2024-06-03 21:17:49,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:17:49,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:17:49,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:17:49,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:17:49,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:17:49,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:17:49,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 259 transitions, 2989 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:17:49,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:17:49,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:17:49,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:17:50,323 INFO L124 PetriNetUnfolderBase]: 503/947 cut-off events. [2024-06-03 21:17:50,323 INFO L125 PetriNetUnfolderBase]: For 127608/127608 co-relation queries the response was YES. [2024-06-03 21:17:50,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7939 conditions, 947 events. 503/947 cut-off events. For 127608/127608 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5057 event pairs, 29 based on Foata normal form. 2/947 useless extension candidates. Maximal degree in co-relation 7812. Up to 805 conditions per place. [2024-06-03 21:17:50,334 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 249 selfloop transitions, 24 changer transitions 0/276 dead transitions. [2024-06-03 21:17:50,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 276 transitions, 3613 flow [2024-06-03 21:17:50,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:17:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:17:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-03 21:17:50,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-03 21:17:50,335 INFO L175 Difference]: Start difference. First operand has 273 places, 259 transitions, 2989 flow. Second operand 10 states and 123 transitions. [2024-06-03 21:17:50,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 276 transitions, 3613 flow [2024-06-03 21:17:50,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 276 transitions, 3538 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-03 21:17:50,629 INFO L231 Difference]: Finished difference. Result has 276 places, 260 transitions, 3004 flow [2024-06-03 21:17:50,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2914, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3004, PETRI_PLACES=276, PETRI_TRANSITIONS=260} [2024-06-03 21:17:50,630 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 245 predicate places. [2024-06-03 21:17:50,630 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 260 transitions, 3004 flow [2024-06-03 21:17:50,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:17:50,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:17:50,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:17:50,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-03 21:17:50,630 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-03 21:17:50,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:17:50,631 INFO L85 PathProgramCache]: Analyzing trace with hash 907164465, now seen corresponding path program 1 times [2024-06-03 21:17:50,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:17:50,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859117043] [2024-06-03 21:17:50,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:17:50,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:17:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:03,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:03,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859117043] [2024-06-03 21:18:03,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859117043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:03,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:03,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:18:03,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466082048] [2024-06-03 21:18:03,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:03,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:18:03,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:03,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:18:03,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:18:03,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:18:03,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 260 transitions, 3004 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:03,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:03,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:18:03,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:04,104 INFO L124 PetriNetUnfolderBase]: 506/952 cut-off events. [2024-06-03 21:18:04,104 INFO L125 PetriNetUnfolderBase]: For 125809/125809 co-relation queries the response was YES. [2024-06-03 21:18:04,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7975 conditions, 952 events. 506/952 cut-off events. For 125809/125809 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5073 event pairs, 31 based on Foata normal form. 1/951 useless extension candidates. Maximal degree in co-relation 7847. Up to 816 conditions per place. [2024-06-03 21:18:04,117 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 241 selfloop transitions, 32 changer transitions 0/276 dead transitions. [2024-06-03 21:18:04,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 276 transitions, 3634 flow [2024-06-03 21:18:04,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:18:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:18:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-03 21:18:04,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-03 21:18:04,118 INFO L175 Difference]: Start difference. First operand has 276 places, 260 transitions, 3004 flow. Second operand 11 states and 135 transitions. [2024-06-03 21:18:04,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 276 transitions, 3634 flow [2024-06-03 21:18:04,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 276 transitions, 3554 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-03 21:18:04,406 INFO L231 Difference]: Finished difference. Result has 279 places, 262 transitions, 3047 flow [2024-06-03 21:18:04,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2924, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3047, PETRI_PLACES=279, PETRI_TRANSITIONS=262} [2024-06-03 21:18:04,406 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 248 predicate places. [2024-06-03 21:18:04,406 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 262 transitions, 3047 flow [2024-06-03 21:18:04,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:04,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:04,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:04,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-03 21:18:04,407 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-03 21:18:04,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:04,407 INFO L85 PathProgramCache]: Analyzing trace with hash 907366275, now seen corresponding path program 2 times [2024-06-03 21:18:04,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:04,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617033999] [2024-06-03 21:18:04,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:04,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:14,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-03 21:18:14,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:14,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617033999] [2024-06-03 21:18:14,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617033999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:14,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:14,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:18:14,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930590327] [2024-06-03 21:18:14,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:14,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:18:14,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:14,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:18:14,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:18:14,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 21:18:14,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 262 transitions, 3047 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:14,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:14,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 21:18:14,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:14,786 INFO L124 PetriNetUnfolderBase]: 504/949 cut-off events. [2024-06-03 21:18:14,787 INFO L125 PetriNetUnfolderBase]: For 123536/123536 co-relation queries the response was YES. [2024-06-03 21:18:14,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7839 conditions, 949 events. 504/949 cut-off events. For 123536/123536 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5067 event pairs, 31 based on Foata normal form. 1/948 useless extension candidates. Maximal degree in co-relation 7710. Up to 813 conditions per place. [2024-06-03 21:18:14,797 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 240 selfloop transitions, 33 changer transitions 0/276 dead transitions. [2024-06-03 21:18:14,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 276 transitions, 3627 flow [2024-06-03 21:18:14,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:18:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:18:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-03 21:18:14,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-03 21:18:14,799 INFO L175 Difference]: Start difference. First operand has 279 places, 262 transitions, 3047 flow. Second operand 11 states and 134 transitions. [2024-06-03 21:18:14,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 276 transitions, 3627 flow [2024-06-03 21:18:15,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 276 transitions, 3496 flow, removed 35 selfloop flow, removed 9 redundant places. [2024-06-03 21:18:15,208 INFO L231 Difference]: Finished difference. Result has 281 places, 262 transitions, 2987 flow [2024-06-03 21:18:15,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2916, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2987, PETRI_PLACES=281, PETRI_TRANSITIONS=262} [2024-06-03 21:18:15,209 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 250 predicate places. [2024-06-03 21:18:15,209 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 262 transitions, 2987 flow [2024-06-03 21:18:15,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:15,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:15,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:15,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-03 21:18:15,210 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-03 21:18:15,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:15,211 INFO L85 PathProgramCache]: Analyzing trace with hash 888939968, now seen corresponding path program 1 times [2024-06-03 21:18:15,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:15,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820688287] [2024-06-03 21:18:15,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:15,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15