./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.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/mix009.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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/mix009.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix009.oepc.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-cde23df-m [2024-06-14 14:29:56,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:29:56,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:29:56,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:29:56,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:29:56,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:29:56,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:29:56,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:29:56,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:29:56,789 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:29:56,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:29:56,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:29:56,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:29:56,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:29:56,791 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:29:56,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:29:56,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:29:56,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:29:56,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:29:56,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:29:56,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:29:56,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:29:56,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:29:56,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:29:56,794 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:29:56,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:29:56,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:29:56,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:29:56,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:29:56,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:29:56,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:29:56,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:29:56,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:29:56,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:29:56,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:29:56,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:29:56,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:29:56,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:29:56,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:29:56,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:29:56,797 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:29:56,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:29:56,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:29:56,798 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-14 14:29:57,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:29:57,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:29:57,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:29:57,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:29:57,045 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:29:57,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2024-06-14 14:29:58,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:29:58,276 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:29:58,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2024-06-14 14:29:58,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ea34fb8/3cd8fa5c9aba468d8c159a609d07dcf2/FLAGf0732f8f3 [2024-06-14 14:29:58,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ea34fb8/3cd8fa5c9aba468d8c159a609d07dcf2 [2024-06-14 14:29:58,298 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:29:58,299 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:29:58,301 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/mix009.oepc.yml/witness.yml [2024-06-14 14:29:58,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:29:58,457 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:29:58,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:29:58,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:29:58,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:29:58,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:29:58" (1/2) ... [2024-06-14 14:29:58,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a77f8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:29:58, skipping insertion in model container [2024-06-14 14:29:58,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:29:58" (1/2) ... [2024-06-14 14:29:58,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@e1df0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:29:58, skipping insertion in model container [2024-06-14 14:29:58,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:29:58" (2/2) ... [2024-06-14 14:29:58,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a77f8e1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:58, skipping insertion in model container [2024-06-14 14:29:58,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:29:58" (2/2) ... [2024-06-14 14:29:58,467 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:29:58,524 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:29:58,525 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_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 )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$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)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 14:29:58,526 INFO L97 edCorrectnessWitness]: Location invariant before [L825-L825] ((((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_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 )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$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)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 14:29:58,526 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:29:58,527 INFO L106 edCorrectnessWitness]: ghost_update [L823-L823] multithreaded = 1; [2024-06-14 14:29:58,562 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:29:58,894 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:29:58,906 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 14:29:59,189 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:29:59,216 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:29:59,216 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:59 WrapperNode [2024-06-14 14:29:59,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:29:59,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:29:59,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:29:59,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:29:59,223 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 14.06 02:29:59" (1/1) ... [2024-06-14 14:29:59,246 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 14.06 02:29:59" (1/1) ... [2024-06-14 14:29:59,311 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 122 [2024-06-14 14:29:59,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:29:59,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:29:59,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:29:59,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:29:59,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:59" (1/1) ... [2024-06-14 14:29:59,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:59" (1/1) ... [2024-06-14 14:29:59,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:59" (1/1) ... [2024-06-14 14:29:59,375 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-14 14:29:59,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:59" (1/1) ... [2024-06-14 14:29:59,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:59" (1/1) ... [2024-06-14 14:29:59,397 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:59" (1/1) ... [2024-06-14 14:29:59,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:59" (1/1) ... [2024-06-14 14:29:59,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:59" (1/1) ... [2024-06-14 14:29:59,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:59" (1/1) ... [2024-06-14 14:29:59,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:29:59,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:29:59,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:29:59,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:29:59,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:59" (1/1) ... [2024-06-14 14:29:59,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:29:59,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:29:59,461 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-14 14:29:59,470 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-14 14:29:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 14:29:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:29:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 14:29:59,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 14:29:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 14:29:59,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 14:29:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:29:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 14:29:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:29:59,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:29:59,496 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 14:29:59,599 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:29:59,601 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:30:00,428 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:30:00,429 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:30:00,588 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:30:00,588 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 14:30:00,594 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:30:00 BoogieIcfgContainer [2024-06-14 14:30:00,594 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:30:00,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:30:00,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:30:00,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:30:00,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:29:58" (1/4) ... [2024-06-14 14:30:00,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4baa0279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:30:00, skipping insertion in model container [2024-06-14 14:30:00,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:29:58" (2/4) ... [2024-06-14 14:30:00,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4baa0279 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:30:00, skipping insertion in model container [2024-06-14 14:30:00,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:59" (3/4) ... [2024-06-14 14:30:00,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4baa0279 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:30:00, skipping insertion in model container [2024-06-14 14:30:00,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:30:00" (4/4) ... [2024-06-14 14:30:00,602 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.oepc.i [2024-06-14 14:30:00,615 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:30:00,616 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 14:30:00,616 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:30:00,678 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 14:30:00,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-14 14:30:00,754 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-14 14:30:00,754 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:30:00,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 14:30:00,756 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-14 14:30:00,759 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-14 14:30:00,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:30:00,786 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;@31cb0eb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:30:00,786 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:30:00,793 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:30:00,794 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 14:30:00,794 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:30:00,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:00,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 14:30:00,795 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-14 14:30:00,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:00,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1828167494, now seen corresponding path program 1 times [2024-06-14 14:30:00,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:00,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261925756] [2024-06-14 14:30:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:00,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:05,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:05,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261925756] [2024-06-14 14:30:05,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261925756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:05,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:05,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:30:05,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150519857] [2024-06-14 14:30:05,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:05,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:30:05,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:05,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:30:05,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:30:05,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-14 14:30:05,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 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-14 14:30:05,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:05,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-14 14:30:05,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:05,922 INFO L124 PetriNetUnfolderBase]: 162/315 cut-off events. [2024-06-14 14:30:05,922 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-14 14:30:05,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 315 events. 162/315 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1246 event pairs, 97 based on Foata normal form. 1/306 useless extension candidates. Maximal degree in co-relation 614. Up to 288 conditions per place. [2024-06-14 14:30:05,928 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 23 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-14 14:30:05,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 123 flow [2024-06-14 14:30:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:30:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:30:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2024-06-14 14:30:05,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5858585858585859 [2024-06-14 14:30:05,939 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 58 transitions. [2024-06-14 14:30:05,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 123 flow [2024-06-14 14:30:05,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:30:05,942 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-14 14:30:05,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-14 14:30:05,946 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-14 14:30:05,946 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-14 14:30:05,947 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-14 14:30:05,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:05,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:05,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:30:05,948 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-14 14:30:05,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:05,948 INFO L85 PathProgramCache]: Analyzing trace with hash 228048693, now seen corresponding path program 1 times [2024-06-14 14:30:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:05,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832916569] [2024-06-14 14:30:05,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:05,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:09,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:09,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832916569] [2024-06-14 14:30:09,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832916569] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:09,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:09,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 14:30:09,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320984396] [2024-06-14 14:30:09,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:09,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 14:30:09,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:09,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 14:30:09,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 14:30:09,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-14 14:30:09,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:09,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:09,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-14 14:30:09,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:09,651 INFO L124 PetriNetUnfolderBase]: 159/310 cut-off events. [2024-06-14 14:30:09,652 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-06-14 14:30:09,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 310 events. 159/310 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1214 event pairs, 79 based on Foata normal form. 2/307 useless extension candidates. Maximal degree in co-relation 685. Up to 274 conditions per place. [2024-06-14 14:30:09,657 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 27 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2024-06-14 14:30:09,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 165 flow [2024-06-14 14:30:09,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:30:09,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:30:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2024-06-14 14:30:09,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-06-14 14:30:09,661 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 74 transitions. [2024-06-14 14:30:09,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 165 flow [2024-06-14 14:30:09,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:30:09,665 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-14 14:30:09,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-06-14 14:30:09,666 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-14 14:30:09,667 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-14 14:30:09,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:09,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:09,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:09,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 14:30:09,668 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-14 14:30:09,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:09,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1541873971, now seen corresponding path program 1 times [2024-06-14 14:30:09,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:09,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771792285] [2024-06-14 14:30:09,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:09,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:12,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:12,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771792285] [2024-06-14 14:30:12,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771792285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:12,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:12,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 14:30:12,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203273544] [2024-06-14 14:30:12,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:12,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:30:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:12,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:30:12,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 14:30:13,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 14:30:13,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:13,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:13,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 14:30:13,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:13,366 INFO L124 PetriNetUnfolderBase]: 187/360 cut-off events. [2024-06-14 14:30:13,366 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2024-06-14 14:30:13,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 360 events. 187/360 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1392 event pairs, 83 based on Foata normal form. 2/361 useless extension candidates. Maximal degree in co-relation 878. Up to 313 conditions per place. [2024-06-14 14:30:13,368 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 32 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-14 14:30:13,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 215 flow [2024-06-14 14:30:13,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:30:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:30:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-14 14:30:13,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212121212121212 [2024-06-14 14:30:13,370 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 86 transitions. [2024-06-14 14:30:13,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 215 flow [2024-06-14 14:30:13,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 14:30:13,372 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 123 flow [2024-06-14 14:30:13,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-14 14:30:13,372 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-14 14:30:13,373 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 123 flow [2024-06-14 14:30:13,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:13,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:13,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:13,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 14:30:13,373 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-14 14:30:13,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:13,374 INFO L85 PathProgramCache]: Analyzing trace with hash -553452156, now seen corresponding path program 1 times [2024-06-14 14:30:13,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:13,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331022649] [2024-06-14 14:30:13,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:13,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:16,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:16,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331022649] [2024-06-14 14:30:16,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331022649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:16,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:16,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:30:16,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572625281] [2024-06-14 14:30:16,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:16,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:30:16,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:16,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:30:16,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:30:16,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 14:30:16,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:16,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:16,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 14:30:16,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:16,860 INFO L124 PetriNetUnfolderBase]: 184/357 cut-off events. [2024-06-14 14:30:16,861 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2024-06-14 14:30:16,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 357 events. 184/357 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1364 event pairs, 65 based on Foata normal form. 2/358 useless extension candidates. Maximal degree in co-relation 948. Up to 299 conditions per place. [2024-06-14 14:30:16,863 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 36 selfloop transitions, 9 changer transitions 0/49 dead transitions. [2024-06-14 14:30:16,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 263 flow [2024-06-14 14:30:16,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:30:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:30:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-14 14:30:16,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51010101010101 [2024-06-14 14:30:16,868 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 123 flow. Second operand 6 states and 101 transitions. [2024-06-14 14:30:16,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 263 flow [2024-06-14 14:30:16,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 248 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 14:30:16,872 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 147 flow [2024-06-14 14:30:16,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2024-06-14 14:30:16,873 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2024-06-14 14:30:16,874 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 147 flow [2024-06-14 14:30:16,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:16,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:16,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:16,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:30:16,875 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-14 14:30:16,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash -190316767, now seen corresponding path program 1 times [2024-06-14 14:30:16,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:16,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292613388] [2024-06-14 14:30:16,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:16,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:24,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:24,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292613388] [2024-06-14 14:30:24,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292613388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:24,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:24,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:30:24,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127879149] [2024-06-14 14:30:24,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:24,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:30:24,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:24,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:30:24,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:30:24,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:30:24,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:24,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:24,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:30:24,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:25,088 INFO L124 PetriNetUnfolderBase]: 230/424 cut-off events. [2024-06-14 14:30:25,089 INFO L125 PetriNetUnfolderBase]: For 639/639 co-relation queries the response was YES. [2024-06-14 14:30:25,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 424 events. 230/424 cut-off events. For 639/639 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1588 event pairs, 100 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 1230. Up to 402 conditions per place. [2024-06-14 14:30:25,091 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 30 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2024-06-14 14:30:25,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 237 flow [2024-06-14 14:30:25,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:30:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:30:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2024-06-14 14:30:25,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-14 14:30:25,093 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 147 flow. Second operand 5 states and 67 transitions. [2024-06-14 14:30:25,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 237 flow [2024-06-14 14:30:25,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 216 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 14:30:25,099 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 153 flow [2024-06-14 14:30:25,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2024-06-14 14:30:25,102 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2024-06-14 14:30:25,103 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 153 flow [2024-06-14 14:30:25,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:25,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:25,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:25,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:30:25,107 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-14 14:30:25,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:25,108 INFO L85 PathProgramCache]: Analyzing trace with hash 708445859, now seen corresponding path program 1 times [2024-06-14 14:30:25,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:25,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779195666] [2024-06-14 14:30:25,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:25,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:29,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-14 14:30:29,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:29,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779195666] [2024-06-14 14:30:29,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779195666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:29,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:29,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:30:29,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193567600] [2024-06-14 14:30:29,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:29,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:30:29,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:29,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:30:29,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:30:29,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:30:29,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 153 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:29,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:29,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:30:29,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:29,773 INFO L124 PetriNetUnfolderBase]: 223/415 cut-off events. [2024-06-14 14:30:29,773 INFO L125 PetriNetUnfolderBase]: For 887/887 co-relation queries the response was YES. [2024-06-14 14:30:29,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 415 events. 223/415 cut-off events. For 887/887 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1547 event pairs, 58 based on Foata normal form. 2/416 useless extension candidates. Maximal degree in co-relation 1259. Up to 338 conditions per place. [2024-06-14 14:30:29,776 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 46 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2024-06-14 14:30:29,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 349 flow [2024-06-14 14:30:29,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:30:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:30:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-14 14:30:29,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-06-14 14:30:29,778 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 153 flow. Second operand 8 states and 124 transitions. [2024-06-14 14:30:29,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 349 flow [2024-06-14 14:30:29,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 338 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 14:30:29,780 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 202 flow [2024-06-14 14:30:29,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=202, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-06-14 14:30:29,781 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2024-06-14 14:30:29,781 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 202 flow [2024-06-14 14:30:29,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:29,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:29,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:29,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 14:30:29,782 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-14 14:30:29,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1623619635, now seen corresponding path program 1 times [2024-06-14 14:30:29,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:29,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326098361] [2024-06-14 14:30:29,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:29,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:38,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:38,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326098361] [2024-06-14 14:30:38,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326098361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:38,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:38,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:30:38,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420275128] [2024-06-14 14:30:38,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:38,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:30:38,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:38,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:30:38,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:30:38,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:30:38,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 202 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-14 14:30:38,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:38,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:30:38,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:38,886 INFO L124 PetriNetUnfolderBase]: 220/409 cut-off events. [2024-06-14 14:30:38,886 INFO L125 PetriNetUnfolderBase]: For 1121/1121 co-relation queries the response was YES. [2024-06-14 14:30:38,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 409 events. 220/409 cut-off events. For 1121/1121 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1490 event pairs, 58 based on Foata normal form. 3/411 useless extension candidates. Maximal degree in co-relation 1365. Up to 379 conditions per place. [2024-06-14 14:30:38,889 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 37 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2024-06-14 14:30:38,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 318 flow [2024-06-14 14:30:38,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:30:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:30:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-06-14 14:30:38,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.398989898989899 [2024-06-14 14:30:38,890 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 202 flow. Second operand 6 states and 79 transitions. [2024-06-14 14:30:38,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 318 flow [2024-06-14 14:30:38,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 289 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 14:30:38,893 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 206 flow [2024-06-14 14:30:38,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-06-14 14:30:38,894 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2024-06-14 14:30:38,895 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 206 flow [2024-06-14 14:30:38,895 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-14 14:30:38,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:38,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:38,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 14:30:38,896 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-14 14:30:38,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:38,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2069385460, now seen corresponding path program 1 times [2024-06-14 14:30:38,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:38,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605698969] [2024-06-14 14:30:38,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:38,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:45,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:45,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605698969] [2024-06-14 14:30:45,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605698969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:45,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:45,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:30:45,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685386981] [2024-06-14 14:30:45,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:45,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:30:45,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:45,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:30:45,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:30:45,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:30:45,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 206 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-14 14:30:45,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:45,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:30:45,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:46,008 INFO L124 PetriNetUnfolderBase]: 225/416 cut-off events. [2024-06-14 14:30:46,008 INFO L125 PetriNetUnfolderBase]: For 1347/1347 co-relation queries the response was YES. [2024-06-14 14:30:46,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 416 events. 225/416 cut-off events. For 1347/1347 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1546 event pairs, 58 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 1443. Up to 377 conditions per place. [2024-06-14 14:30:46,011 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 40 selfloop transitions, 11 changer transitions 0/55 dead transitions. [2024-06-14 14:30:46,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 55 transitions, 362 flow [2024-06-14 14:30:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:30:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:30:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-06-14 14:30:46,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-06-14 14:30:46,012 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 206 flow. Second operand 6 states and 83 transitions. [2024-06-14 14:30:46,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 55 transitions, 362 flow [2024-06-14 14:30:46,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 345 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 14:30:46,014 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 236 flow [2024-06-14 14:30:46,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2024-06-14 14:30:46,015 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2024-06-14 14:30:46,015 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 236 flow [2024-06-14 14:30:46,015 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-14 14:30:46,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:46,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:46,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:30:46,016 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-14 14:30:46,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1808870444, now seen corresponding path program 2 times [2024-06-14 14:30:46,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:46,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393003975] [2024-06-14 14:30:46,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:46,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393003975] [2024-06-14 14:30:52,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393003975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:52,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:52,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:30:52,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002721531] [2024-06-14 14:30:52,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:52,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:30:52,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:52,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:30:52,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:30:52,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:30:52,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 236 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-14 14:30:52,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:52,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:30:52,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:53,081 INFO L124 PetriNetUnfolderBase]: 223/413 cut-off events. [2024-06-14 14:30:53,081 INFO L125 PetriNetUnfolderBase]: For 1666/1666 co-relation queries the response was YES. [2024-06-14 14:30:53,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 413 events. 223/413 cut-off events. For 1666/1666 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1515 event pairs, 57 based on Foata normal form. 1/413 useless extension candidates. Maximal degree in co-relation 1505. Up to 387 conditions per place. [2024-06-14 14:30:53,084 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 39 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2024-06-14 14:30:53,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 344 flow [2024-06-14 14:30:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:30:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:30:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-06-14 14:30:53,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 14:30:53,085 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 236 flow. Second operand 6 states and 77 transitions. [2024-06-14 14:30:53,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 344 flow [2024-06-14 14:30:53,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 332 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-14 14:30:53,088 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 245 flow [2024-06-14 14:30:53,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-06-14 14:30:53,090 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2024-06-14 14:30:53,090 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 245 flow [2024-06-14 14:30:53,090 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-14 14:30:53,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:53,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:53,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 14:30:53,090 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:53,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:53,091 INFO L85 PathProgramCache]: Analyzing trace with hash 486985931, now seen corresponding path program 1 times [2024-06-14 14:30:53,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:53,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596545334] [2024-06-14 14:30:53,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:53,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:57,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:57,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596545334] [2024-06-14 14:30:57,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596545334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:57,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:57,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:30:57,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178173078] [2024-06-14 14:30:57,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:57,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:30:57,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:57,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:30:57,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:30:57,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:30:57,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 245 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:57,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:57,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:30:57,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:57,901 INFO L124 PetriNetUnfolderBase]: 217/403 cut-off events. [2024-06-14 14:30:57,902 INFO L125 PetriNetUnfolderBase]: For 2095/2095 co-relation queries the response was YES. [2024-06-14 14:30:57,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 403 events. 217/403 cut-off events. For 2095/2095 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1457 event pairs, 35 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1498. Up to 307 conditions per place. [2024-06-14 14:30:57,904 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 50 selfloop transitions, 14 changer transitions 0/70 dead transitions. [2024-06-14 14:30:57,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 425 flow [2024-06-14 14:30:57,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:30:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:30:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2024-06-14 14:30:57,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4478114478114478 [2024-06-14 14:30:57,906 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 245 flow. Second operand 9 states and 133 transitions. [2024-06-14 14:30:57,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 425 flow [2024-06-14 14:30:57,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 404 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-14 14:30:57,908 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 244 flow [2024-06-14 14:30:57,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=244, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2024-06-14 14:30:57,910 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2024-06-14 14:30:57,912 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 244 flow [2024-06-14 14:30:57,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:57,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:57,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:57,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 14:30:57,912 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-14 14:30:57,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:57,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1461964812, now seen corresponding path program 1 times [2024-06-14 14:30:57,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:57,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953105926] [2024-06-14 14:30:57,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:57,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:04,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:04,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953105926] [2024-06-14 14:31:04,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953105926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:04,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:04,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:31:04,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478297193] [2024-06-14 14:31:04,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:04,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:31:04,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:04,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:31:04,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:31:04,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:31:04,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 244 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:04,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:04,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:31:04,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:05,273 INFO L124 PetriNetUnfolderBase]: 238/426 cut-off events. [2024-06-14 14:31:05,274 INFO L125 PetriNetUnfolderBase]: For 2383/2383 co-relation queries the response was YES. [2024-06-14 14:31:05,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 426 events. 238/426 cut-off events. For 2383/2383 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1507 event pairs, 53 based on Foata normal form. 1/426 useless extension candidates. Maximal degree in co-relation 1653. Up to 381 conditions per place. [2024-06-14 14:31:05,277 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 44 selfloop transitions, 16 changer transitions 0/62 dead transitions. [2024-06-14 14:31:05,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 438 flow [2024-06-14 14:31:05,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:31:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:31:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-14 14:31:05,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38961038961038963 [2024-06-14 14:31:05,278 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 244 flow. Second operand 7 states and 90 transitions. [2024-06-14 14:31:05,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 438 flow [2024-06-14 14:31:05,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 402 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 14:31:05,281 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 269 flow [2024-06-14 14:31:05,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-06-14 14:31:05,282 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2024-06-14 14:31:05,282 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 269 flow [2024-06-14 14:31:05,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:05,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:05,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:05,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 14:31:05,282 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-14 14:31:05,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1461785074, now seen corresponding path program 1 times [2024-06-14 14:31:05,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:05,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600259418] [2024-06-14 14:31:05,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:05,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:12,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-14 14:31:12,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600259418] [2024-06-14 14:31:12,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600259418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:12,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:12,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:31:12,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502561436] [2024-06-14 14:31:12,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:12,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:31:12,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:12,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:31:12,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:31:12,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:31:12,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 269 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-14 14:31:12,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:12,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:31:12,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:13,077 INFO L124 PetriNetUnfolderBase]: 243/443 cut-off events. [2024-06-14 14:31:13,077 INFO L125 PetriNetUnfolderBase]: For 3157/3157 co-relation queries the response was YES. [2024-06-14 14:31:13,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 443 events. 243/443 cut-off events. For 3157/3157 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1622 event pairs, 56 based on Foata normal form. 3/445 useless extension candidates. Maximal degree in co-relation 1756. Up to 373 conditions per place. [2024-06-14 14:31:13,080 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 48 selfloop transitions, 15 changer transitions 0/69 dead transitions. [2024-06-14 14:31:13,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 69 transitions, 477 flow [2024-06-14 14:31:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:31:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:31:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-14 14:31:13,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 14:31:13,082 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 269 flow. Second operand 7 states and 98 transitions. [2024-06-14 14:31:13,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 69 transitions, 477 flow [2024-06-14 14:31:13,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 69 transitions, 456 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 14:31:13,088 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 322 flow [2024-06-14 14:31:13,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-06-14 14:31:13,089 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 32 predicate places. [2024-06-14 14:31:13,090 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 322 flow [2024-06-14 14:31:13,090 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-14 14:31:13,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:13,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:13,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 14:31:13,090 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-14 14:31:13,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:13,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1461785322, now seen corresponding path program 2 times [2024-06-14 14:31:13,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:13,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476458527] [2024-06-14 14:31:13,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:13,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:19,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:19,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476458527] [2024-06-14 14:31:19,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476458527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:19,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:19,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:31:19,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305946415] [2024-06-14 14:31:19,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:19,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:31:19,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:19,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:31:19,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:31:19,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:31:19,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 322 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:19,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:19,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:31:19,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:20,195 INFO L124 PetriNetUnfolderBase]: 260/462 cut-off events. [2024-06-14 14:31:20,195 INFO L125 PetriNetUnfolderBase]: For 3665/3665 co-relation queries the response was YES. [2024-06-14 14:31:20,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2023 conditions, 462 events. 260/462 cut-off events. For 3665/3665 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1649 event pairs, 55 based on Foata normal form. 1/462 useless extension candidates. Maximal degree in co-relation 1991. Up to 416 conditions per place. [2024-06-14 14:31:20,198 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 48 selfloop transitions, 17 changer transitions 0/67 dead transitions. [2024-06-14 14:31:20,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 514 flow [2024-06-14 14:31:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:31:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:31:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2024-06-14 14:31:20,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-06-14 14:31:20,199 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 322 flow. Second operand 7 states and 88 transitions. [2024-06-14 14:31:20,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 514 flow [2024-06-14 14:31:20,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 503 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-14 14:31:20,203 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 362 flow [2024-06-14 14:31:20,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-06-14 14:31:20,204 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 37 predicate places. [2024-06-14 14:31:20,204 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 362 flow [2024-06-14 14:31:20,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:20,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:20,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:20,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 14:31:20,205 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-14 14:31:20,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash 240418462, now seen corresponding path program 2 times [2024-06-14 14:31:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:20,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435768775] [2024-06-14 14:31:20,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:26,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:26,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435768775] [2024-06-14 14:31:26,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435768775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:26,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:26,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:31:26,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701067120] [2024-06-14 14:31:26,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:26,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:31:26,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:26,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:31:26,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:31:26,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:31:26,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 362 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-14 14:31:26,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:26,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:31:26,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:27,280 INFO L124 PetriNetUnfolderBase]: 255/463 cut-off events. [2024-06-14 14:31:27,280 INFO L125 PetriNetUnfolderBase]: For 4461/4461 co-relation queries the response was YES. [2024-06-14 14:31:27,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2084 conditions, 463 events. 255/463 cut-off events. For 4461/4461 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1707 event pairs, 54 based on Foata normal form. 3/465 useless extension candidates. Maximal degree in co-relation 2049. Up to 422 conditions per place. [2024-06-14 14:31:27,283 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 50 selfloop transitions, 10 changer transitions 0/67 dead transitions. [2024-06-14 14:31:27,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 67 transitions, 518 flow [2024-06-14 14:31:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:31:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:31:27,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2024-06-14 14:31:27,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-06-14 14:31:27,285 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 362 flow. Second operand 7 states and 88 transitions. [2024-06-14 14:31:27,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 67 transitions, 518 flow [2024-06-14 14:31:27,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 67 transitions, 491 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 14:31:27,289 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 378 flow [2024-06-14 14:31:27,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=378, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2024-06-14 14:31:27,290 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 40 predicate places. [2024-06-14 14:31:27,290 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 378 flow [2024-06-14 14:31:27,290 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-14 14:31:27,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:27,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:27,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 14:31:27,291 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-14 14:31:27,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash -369114016, now seen corresponding path program 3 times [2024-06-14 14:31:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:27,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067922041] [2024-06-14 14:31:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:27,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:33,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:33,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067922041] [2024-06-14 14:31:33,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067922041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:33,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:33,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:31:33,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551030981] [2024-06-14 14:31:33,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:33,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:31:33,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:33,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:31:33,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:31:34,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:31:34,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 378 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:34,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:34,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:31:34,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:34,294 INFO L124 PetriNetUnfolderBase]: 267/474 cut-off events. [2024-06-14 14:31:34,294 INFO L125 PetriNetUnfolderBase]: For 4877/4877 co-relation queries the response was YES. [2024-06-14 14:31:34,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2183 conditions, 474 events. 267/474 cut-off events. For 4877/4877 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1712 event pairs, 54 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 2147. Up to 456 conditions per place. [2024-06-14 14:31:34,297 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 53 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2024-06-14 14:31:34,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 65 transitions, 520 flow [2024-06-14 14:31:34,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:31:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:31:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-14 14:31:34,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3463203463203463 [2024-06-14 14:31:34,299 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 378 flow. Second operand 7 states and 80 transitions. [2024-06-14 14:31:34,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 65 transitions, 520 flow [2024-06-14 14:31:34,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 65 transitions, 493 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 14:31:34,305 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 376 flow [2024-06-14 14:31:34,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=376, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2024-06-14 14:31:34,306 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2024-06-14 14:31:34,306 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 376 flow [2024-06-14 14:31:34,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:34,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:34,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:34,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 14:31:34,307 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-14 14:31:34,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:34,307 INFO L85 PathProgramCache]: Analyzing trace with hash -369113768, now seen corresponding path program 3 times [2024-06-14 14:31:34,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:34,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632848766] [2024-06-14 14:31:34,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:34,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:41,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:41,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632848766] [2024-06-14 14:31:41,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632848766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:41,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:41,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:31:41,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593372835] [2024-06-14 14:31:41,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:41,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:31:41,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:41,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:31:41,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:31:41,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:31:41,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 376 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-14 14:31:41,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:41,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:31:41,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:41,717 INFO L124 PetriNetUnfolderBase]: 247/451 cut-off events. [2024-06-14 14:31:41,717 INFO L125 PetriNetUnfolderBase]: For 5311/5311 co-relation queries the response was YES. [2024-06-14 14:31:41,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2070 conditions, 451 events. 247/451 cut-off events. For 5311/5311 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1663 event pairs, 52 based on Foata normal form. 3/453 useless extension candidates. Maximal degree in co-relation 2034. Up to 399 conditions per place. [2024-06-14 14:31:41,720 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 49 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-14 14:31:41,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 69 transitions, 528 flow [2024-06-14 14:31:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:31:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:31:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-14 14:31:41,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39826839826839827 [2024-06-14 14:31:41,721 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 376 flow. Second operand 7 states and 92 transitions. [2024-06-14 14:31:41,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 69 transitions, 528 flow [2024-06-14 14:31:41,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 69 transitions, 490 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 14:31:41,725 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 369 flow [2024-06-14 14:31:41,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2024-06-14 14:31:41,726 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2024-06-14 14:31:41,726 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 369 flow [2024-06-14 14:31:41,726 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-14 14:31:41,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:41,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:41,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 14:31:41,726 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-14 14:31:41,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:41,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1923582313, now seen corresponding path program 1 times [2024-06-14 14:31:41,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:41,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875137816] [2024-06-14 14:31:41,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:49,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:49,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875137816] [2024-06-14 14:31:49,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875137816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:49,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:49,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:31:49,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392566381] [2024-06-14 14:31:49,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:49,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:31:49,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:49,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:31:49,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:31:49,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:31:49,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 369 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-14 14:31:49,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:49,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:31:49,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:49,477 INFO L124 PetriNetUnfolderBase]: 264/470 cut-off events. [2024-06-14 14:31:49,477 INFO L125 PetriNetUnfolderBase]: For 5790/5790 co-relation queries the response was YES. [2024-06-14 14:31:49,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 470 events. 264/470 cut-off events. For 5790/5790 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1730 event pairs, 52 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 2163. Up to 405 conditions per place. [2024-06-14 14:31:49,480 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 55 selfloop transitions, 23 changer transitions 0/80 dead transitions. [2024-06-14 14:31:49,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 625 flow [2024-06-14 14:31:49,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:31:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:31:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 14:31:49,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2024-06-14 14:31:49,482 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 369 flow. Second operand 8 states and 103 transitions. [2024-06-14 14:31:49,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 625 flow [2024-06-14 14:31:49,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 80 transitions, 584 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 14:31:49,487 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 407 flow [2024-06-14 14:31:49,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=407, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2024-06-14 14:31:49,487 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2024-06-14 14:31:49,487 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 407 flow [2024-06-14 14:31:49,488 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-14 14:31:49,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:49,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:49,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 14:31:49,488 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-14 14:31:49,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:49,489 INFO L85 PathProgramCache]: Analyzing trace with hash -533866750, now seen corresponding path program 1 times [2024-06-14 14:31:49,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:49,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793540415] [2024-06-14 14:31:49,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:49,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:56,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:56,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793540415] [2024-06-14 14:31:56,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793540415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:56,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:56,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:31:56,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328960858] [2024-06-14 14:31:56,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:56,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:31:56,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:56,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:31:56,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:31:56,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:31:56,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 407 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-14 14:31:56,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:56,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:31:56,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:56,872 INFO L124 PetriNetUnfolderBase]: 283/501 cut-off events. [2024-06-14 14:31:56,872 INFO L125 PetriNetUnfolderBase]: For 7041/7041 co-relation queries the response was YES. [2024-06-14 14:31:56,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 501 events. 283/501 cut-off events. For 7041/7041 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1864 event pairs, 57 based on Foata normal form. 3/503 useless extension candidates. Maximal degree in co-relation 2363. Up to 383 conditions per place. [2024-06-14 14:31:56,876 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 60 selfloop transitions, 25 changer transitions 0/87 dead transitions. [2024-06-14 14:31:56,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 87 transitions, 689 flow [2024-06-14 14:31:56,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:31:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:31:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-14 14:31:56,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 14:31:56,877 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 407 flow. Second operand 8 states and 108 transitions. [2024-06-14 14:31:56,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 87 transitions, 689 flow [2024-06-14 14:31:56,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 87 transitions, 652 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 14:31:56,883 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 453 flow [2024-06-14 14:31:56,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=453, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2024-06-14 14:31:56,884 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 48 predicate places. [2024-06-14 14:31:56,884 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 453 flow [2024-06-14 14:31:56,885 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-14 14:31:56,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:56,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:56,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 14:31:56,885 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-14 14:31:56,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:56,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1923732043, now seen corresponding path program 2 times [2024-06-14 14:31:56,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:56,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771938373] [2024-06-14 14:31:56,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:56,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:04,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:04,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771938373] [2024-06-14 14:32:04,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771938373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:04,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:04,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:32:04,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380882539] [2024-06-14 14:32:04,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:04,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:32:04,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:04,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:32:04,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:32:04,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:32:04,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 453 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-14 14:32:04,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:04,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:32:04,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:04,608 INFO L124 PetriNetUnfolderBase]: 286/506 cut-off events. [2024-06-14 14:32:04,608 INFO L125 PetriNetUnfolderBase]: For 7596/7596 co-relation queries the response was YES. [2024-06-14 14:32:04,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2539 conditions, 506 events. 286/506 cut-off events. For 7596/7596 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1874 event pairs, 56 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 2499. Up to 440 conditions per place. [2024-06-14 14:32:04,612 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 58 selfloop transitions, 23 changer transitions 0/83 dead transitions. [2024-06-14 14:32:04,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 699 flow [2024-06-14 14:32:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:32:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:32:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-14 14:32:04,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38257575757575757 [2024-06-14 14:32:04,622 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 453 flow. Second operand 8 states and 101 transitions. [2024-06-14 14:32:04,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 699 flow [2024-06-14 14:32:04,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 83 transitions, 667 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-14 14:32:04,629 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 484 flow [2024-06-14 14:32:04,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=484, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2024-06-14 14:32:04,630 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 52 predicate places. [2024-06-14 14:32:04,630 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 484 flow [2024-06-14 14:32:04,630 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-14 14:32:04,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:04,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:04,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 14:32:04,631 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-14 14:32:04,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:04,631 INFO L85 PathProgramCache]: Analyzing trace with hash -109539285, now seen corresponding path program 3 times [2024-06-14 14:32:04,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:04,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789349896] [2024-06-14 14:32:04,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:04,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:11,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:11,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789349896] [2024-06-14 14:32:11,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789349896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:11,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:11,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:32:11,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362806660] [2024-06-14 14:32:11,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:11,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:32:11,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:11,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:32:11,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:32:11,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:32:11,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 484 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-14 14:32:11,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:11,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:32:11,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:11,975 INFO L124 PetriNetUnfolderBase]: 289/511 cut-off events. [2024-06-14 14:32:11,975 INFO L125 PetriNetUnfolderBase]: For 8325/8325 co-relation queries the response was YES. [2024-06-14 14:32:11,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 511 events. 289/511 cut-off events. For 8325/8325 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1904 event pairs, 60 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 2591. Up to 444 conditions per place. [2024-06-14 14:32:11,978 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 56 selfloop transitions, 24 changer transitions 0/82 dead transitions. [2024-06-14 14:32:11,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 82 transitions, 726 flow [2024-06-14 14:32:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:32:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:32:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 14:32:11,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 14:32:11,981 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 484 flow. Second operand 8 states and 99 transitions. [2024-06-14 14:32:11,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 82 transitions, 726 flow [2024-06-14 14:32:11,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 687 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 14:32:11,987 INFO L231 Difference]: Finished difference. Result has 87 places, 70 transitions, 514 flow [2024-06-14 14:32:11,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=514, PETRI_PLACES=87, PETRI_TRANSITIONS=70} [2024-06-14 14:32:11,987 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 55 predicate places. [2024-06-14 14:32:11,987 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 70 transitions, 514 flow [2024-06-14 14:32:11,988 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-14 14:32:11,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:11,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:11,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 14:32:11,988 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-14 14:32:11,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:11,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1929303890, now seen corresponding path program 2 times [2024-06-14 14:32:11,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:11,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299318098] [2024-06-14 14:32:11,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:11,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:18,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:18,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299318098] [2024-06-14 14:32:18,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299318098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:18,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:18,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:32:18,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134436256] [2024-06-14 14:32:18,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:18,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:32:18,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:18,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:32:18,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:32:19,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:32:19,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 70 transitions, 514 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-14 14:32:19,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:19,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:32:19,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:19,277 INFO L124 PetriNetUnfolderBase]: 313/550 cut-off events. [2024-06-14 14:32:19,277 INFO L125 PetriNetUnfolderBase]: For 10281/10281 co-relation queries the response was YES. [2024-06-14 14:32:19,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2881 conditions, 550 events. 313/550 cut-off events. For 10281/10281 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2093 event pairs, 63 based on Foata normal form. 3/552 useless extension candidates. Maximal degree in co-relation 2838. Up to 413 conditions per place. [2024-06-14 14:32:19,281 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 64 selfloop transitions, 27 changer transitions 0/93 dead transitions. [2024-06-14 14:32:19,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 93 transitions, 852 flow [2024-06-14 14:32:19,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:32:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:32:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-14 14:32:19,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053030303030303 [2024-06-14 14:32:19,283 INFO L175 Difference]: Start difference. First operand has 87 places, 70 transitions, 514 flow. Second operand 8 states and 107 transitions. [2024-06-14 14:32:19,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 93 transitions, 852 flow [2024-06-14 14:32:19,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 93 transitions, 813 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 14:32:19,306 INFO L231 Difference]: Finished difference. Result has 90 places, 74 transitions, 562 flow [2024-06-14 14:32:19,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=562, PETRI_PLACES=90, PETRI_TRANSITIONS=74} [2024-06-14 14:32:19,306 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2024-06-14 14:32:19,308 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 74 transitions, 562 flow [2024-06-14 14:32:19,308 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-14 14:32:19,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:19,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:19,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 14:32:19,309 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-14 14:32:19,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:19,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1929296450, now seen corresponding path program 3 times [2024-06-14 14:32:19,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:19,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208463374] [2024-06-14 14:32:19,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:19,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:26,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:26,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208463374] [2024-06-14 14:32:26,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208463374] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:26,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:26,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:32:26,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221979939] [2024-06-14 14:32:26,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:26,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:32:26,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:26,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:32:26,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:32:26,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:32:26,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 74 transitions, 562 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-14 14:32:26,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:26,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:32:26,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:27,202 INFO L124 PetriNetUnfolderBase]: 307/541 cut-off events. [2024-06-14 14:32:27,202 INFO L125 PetriNetUnfolderBase]: For 10743/10743 co-relation queries the response was YES. [2024-06-14 14:32:27,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 541 events. 307/541 cut-off events. For 10743/10743 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2060 event pairs, 61 based on Foata normal form. 3/543 useless extension candidates. Maximal degree in co-relation 2832. Up to 409 conditions per place. [2024-06-14 14:32:27,207 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 66 selfloop transitions, 26 changer transitions 0/94 dead transitions. [2024-06-14 14:32:27,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 94 transitions, 840 flow [2024-06-14 14:32:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:32:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:32:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-14 14:32:27,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-14 14:32:27,208 INFO L175 Difference]: Start difference. First operand has 90 places, 74 transitions, 562 flow. Second operand 8 states and 109 transitions. [2024-06-14 14:32:27,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 94 transitions, 840 flow [2024-06-14 14:32:27,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 797 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 14:32:27,216 INFO L231 Difference]: Finished difference. Result has 94 places, 74 transitions, 576 flow [2024-06-14 14:32:27,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=576, PETRI_PLACES=94, PETRI_TRANSITIONS=74} [2024-06-14 14:32:27,217 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2024-06-14 14:32:27,217 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 74 transitions, 576 flow [2024-06-14 14:32:27,217 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-14 14:32:27,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:27,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:27,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 14:32:27,218 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-14 14:32:27,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:27,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1137220812, now seen corresponding path program 4 times [2024-06-14 14:32:27,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:27,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856685536] [2024-06-14 14:32:27,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:27,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:34,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:34,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856685536] [2024-06-14 14:32:34,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856685536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:34,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:34,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:32:34,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102614148] [2024-06-14 14:32:34,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:34,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:32:34,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:34,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:32:34,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:32:34,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:32:34,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 74 transitions, 576 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-14 14:32:34,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:34,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:32:34,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:34,974 INFO L124 PetriNetUnfolderBase]: 331/580 cut-off events. [2024-06-14 14:32:34,974 INFO L125 PetriNetUnfolderBase]: For 12685/12685 co-relation queries the response was YES. [2024-06-14 14:32:34,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3143 conditions, 580 events. 331/580 cut-off events. For 12685/12685 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2251 event pairs, 65 based on Foata normal form. 3/582 useless extension candidates. Maximal degree in co-relation 3098. Up to 496 conditions per place. [2024-06-14 14:32:34,979 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 73 selfloop transitions, 19 changer transitions 0/94 dead transitions. [2024-06-14 14:32:34,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 94 transitions, 928 flow [2024-06-14 14:32:34,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:32:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:32:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-14 14:32:34,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38257575757575757 [2024-06-14 14:32:34,980 INFO L175 Difference]: Start difference. First operand has 94 places, 74 transitions, 576 flow. Second operand 8 states and 101 transitions. [2024-06-14 14:32:34,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 94 transitions, 928 flow [2024-06-14 14:32:34,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 94 transitions, 862 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-14 14:32:34,990 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 593 flow [2024-06-14 14:32:34,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=593, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2024-06-14 14:32:34,991 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 63 predicate places. [2024-06-14 14:32:34,991 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 593 flow [2024-06-14 14:32:34,991 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-14 14:32:34,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:34,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:34,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 14:32:34,992 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-14 14:32:34,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:34,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1442368568, now seen corresponding path program 5 times [2024-06-14 14:32:34,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:34,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182463818] [2024-06-14 14:32:34,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:34,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:42,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-14 14:32:42,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:42,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182463818] [2024-06-14 14:32:42,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182463818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:42,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:42,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:32:42,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238858755] [2024-06-14 14:32:42,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:42,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:32:42,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:42,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:32:42,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:32:42,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:32:42,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 593 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-14 14:32:42,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:42,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:32:42,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:42,634 INFO L124 PetriNetUnfolderBase]: 325/571 cut-off events. [2024-06-14 14:32:42,634 INFO L125 PetriNetUnfolderBase]: For 12839/12839 co-relation queries the response was YES. [2024-06-14 14:32:42,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 571 events. 325/571 cut-off events. For 12839/12839 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2210 event pairs, 57 based on Foata normal form. 3/573 useless extension candidates. Maximal degree in co-relation 3008. Up to 492 conditions per place. [2024-06-14 14:32:42,641 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 71 selfloop transitions, 20 changer transitions 0/93 dead transitions. [2024-06-14 14:32:42,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 93 transitions, 859 flow [2024-06-14 14:32:42,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:32:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:32:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 14:32:42,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 14:32:42,657 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 593 flow. Second operand 8 states and 99 transitions. [2024-06-14 14:32:42,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 93 transitions, 859 flow [2024-06-14 14:32:42,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 93 transitions, 811 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 14:32:42,674 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 590 flow [2024-06-14 14:32:42,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=590, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2024-06-14 14:32:42,675 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 66 predicate places. [2024-06-14 14:32:42,675 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 590 flow [2024-06-14 14:32:42,675 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-14 14:32:42,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:42,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:42,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 14:32:42,676 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-14 14:32:42,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash 948045911, now seen corresponding path program 4 times [2024-06-14 14:32:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:42,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498374756] [2024-06-14 14:32:42,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:42,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:49,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:49,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498374756] [2024-06-14 14:32:49,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498374756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:49,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:49,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:32:49,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470202604] [2024-06-14 14:32:49,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:49,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:32:49,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:49,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:32:49,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:32:49,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:32:49,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 590 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-14 14:32:49,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:49,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:32:49,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:49,763 INFO L124 PetriNetUnfolderBase]: 323/568 cut-off events. [2024-06-14 14:32:49,763 INFO L125 PetriNetUnfolderBase]: For 12942/12942 co-relation queries the response was YES. [2024-06-14 14:32:49,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3055 conditions, 568 events. 323/568 cut-off events. For 12942/12942 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2193 event pairs, 67 based on Foata normal form. 1/568 useless extension candidates. Maximal degree in co-relation 3008. Up to 547 conditions per place. [2024-06-14 14:32:49,772 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 72 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2024-06-14 14:32:49,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 86 transitions, 776 flow [2024-06-14 14:32:49,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:32:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:32:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-14 14:32:49,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3371212121212121 [2024-06-14 14:32:49,773 INFO L175 Difference]: Start difference. First operand has 98 places, 78 transitions, 590 flow. Second operand 8 states and 89 transitions. [2024-06-14 14:32:49,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 86 transitions, 776 flow [2024-06-14 14:32:49,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 86 transitions, 720 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 14:32:49,783 INFO L231 Difference]: Finished difference. Result has 99 places, 78 transitions, 563 flow [2024-06-14 14:32:49,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=563, PETRI_PLACES=99, PETRI_TRANSITIONS=78} [2024-06-14 14:32:49,784 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2024-06-14 14:32:49,784 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 78 transitions, 563 flow [2024-06-14 14:32:49,784 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-14 14:32:49,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:49,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:49,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 14:32:49,786 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-14 14:32:49,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:49,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1451572778, now seen corresponding path program 6 times [2024-06-14 14:32:49,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:49,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270435000] [2024-06-14 14:32:49,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:49,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:56,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:56,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270435000] [2024-06-14 14:32:56,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270435000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:56,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:56,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:32:56,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671545385] [2024-06-14 14:32:56,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:56,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:32:56,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:56,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:32:56,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:32:56,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:32:56,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 78 transitions, 563 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-14 14:32:56,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:56,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:32:56,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:57,305 INFO L124 PetriNetUnfolderBase]: 317/559 cut-off events. [2024-06-14 14:32:57,305 INFO L125 PetriNetUnfolderBase]: For 13558/13558 co-relation queries the response was YES. [2024-06-14 14:32:57,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 559 events. 317/559 cut-off events. For 13558/13558 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2159 event pairs, 61 based on Foata normal form. 3/561 useless extension candidates. Maximal degree in co-relation 2892. Up to 522 conditions per place. [2024-06-14 14:32:57,310 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 76 selfloop transitions, 12 changer transitions 0/90 dead transitions. [2024-06-14 14:32:57,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 90 transitions, 769 flow [2024-06-14 14:32:57,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:32:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:32:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-14 14:32:57,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-14 14:32:57,333 INFO L175 Difference]: Start difference. First operand has 99 places, 78 transitions, 563 flow. Second operand 8 states and 93 transitions. [2024-06-14 14:32:57,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 90 transitions, 769 flow [2024-06-14 14:32:57,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 90 transitions, 705 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 14:32:57,344 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 528 flow [2024-06-14 14:32:57,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=528, PETRI_PLACES=97, PETRI_TRANSITIONS=78} [2024-06-14 14:32:57,345 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 65 predicate places. [2024-06-14 14:32:57,345 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 528 flow [2024-06-14 14:32:57,345 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-14 14:32:57,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:57,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:57,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 14:32:57,346 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-14 14:32:57,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:57,346 INFO L85 PathProgramCache]: Analyzing trace with hash 948322617, now seen corresponding path program 1 times [2024-06-14 14:32:57,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:57,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183344424] [2024-06-14 14:32:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:57,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:04,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:04,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183344424] [2024-06-14 14:33:04,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183344424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:04,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:04,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:33:04,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680877758] [2024-06-14 14:33:04,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:04,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:33:04,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:04,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:33:04,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:33:04,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:33:04,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 78 transitions, 528 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-14 14:33:04,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:04,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:33:04,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:04,910 INFO L124 PetriNetUnfolderBase]: 286/526 cut-off events. [2024-06-14 14:33:04,910 INFO L125 PetriNetUnfolderBase]: For 13565/13565 co-relation queries the response was YES. [2024-06-14 14:33:04,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2739 conditions, 526 events. 286/526 cut-off events. For 13565/13565 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2095 event pairs, 57 based on Foata normal form. 2/527 useless extension candidates. Maximal degree in co-relation 2691. Up to 458 conditions per place. [2024-06-14 14:33:04,913 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 65 selfloop transitions, 12 changer transitions 0/90 dead transitions. [2024-06-14 14:33:04,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 90 transitions, 720 flow [2024-06-14 14:33:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:33:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:33:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 14:33:04,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3712121212121212 [2024-06-14 14:33:04,915 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 528 flow. Second operand 8 states and 98 transitions. [2024-06-14 14:33:04,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 90 transitions, 720 flow [2024-06-14 14:33:04,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 90 transitions, 680 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 14:33:04,924 INFO L231 Difference]: Finished difference. Result has 97 places, 80 transitions, 537 flow [2024-06-14 14:33:04,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=537, PETRI_PLACES=97, PETRI_TRANSITIONS=80} [2024-06-14 14:33:04,925 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 65 predicate places. [2024-06-14 14:33:04,925 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 80 transitions, 537 flow [2024-06-14 14:33:04,925 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-14 14:33:04,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:04,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:04,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 14:33:04,926 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-14 14:33:04,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:04,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1451911391, now seen corresponding path program 1 times [2024-06-14 14:33:04,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:04,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533846334] [2024-06-14 14:33:04,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:04,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:13,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:13,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533846334] [2024-06-14 14:33:13,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533846334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:13,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:13,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:33:13,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024439052] [2024-06-14 14:33:13,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:13,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:33:13,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:13,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:33:13,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:33:13,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:33:13,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 80 transitions, 537 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:13,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:13,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:33:13,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:13,944 INFO L124 PetriNetUnfolderBase]: 282/520 cut-off events. [2024-06-14 14:33:13,944 INFO L125 PetriNetUnfolderBase]: For 13745/13745 co-relation queries the response was YES. [2024-06-14 14:33:13,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2715 conditions, 520 events. 282/520 cut-off events. For 13745/13745 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2043 event pairs, 56 based on Foata normal form. 2/521 useless extension candidates. Maximal degree in co-relation 2666. Up to 455 conditions per place. [2024-06-14 14:33:13,947 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 66 selfloop transitions, 11 changer transitions 0/90 dead transitions. [2024-06-14 14:33:13,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 90 transitions, 713 flow [2024-06-14 14:33:13,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:33:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:33:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-14 14:33:13,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 14:33:13,949 INFO L175 Difference]: Start difference. First operand has 97 places, 80 transitions, 537 flow. Second operand 8 states and 96 transitions. [2024-06-14 14:33:13,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 90 transitions, 713 flow [2024-06-14 14:33:13,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 90 transitions, 677 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 14:33:13,959 INFO L231 Difference]: Finished difference. Result has 99 places, 80 transitions, 527 flow [2024-06-14 14:33:13,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=527, PETRI_PLACES=99, PETRI_TRANSITIONS=80} [2024-06-14 14:33:13,960 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2024-06-14 14:33:13,960 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 527 flow [2024-06-14 14:33:13,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:13,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:13,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:13,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 14:33:13,960 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-14 14:33:13,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:13,961 INFO L85 PathProgramCache]: Analyzing trace with hash 721998961, now seen corresponding path program 1 times [2024-06-14 14:33:13,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:13,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679728054] [2024-06-14 14:33:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:19,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-14 14:33:19,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:19,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679728054] [2024-06-14 14:33:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679728054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:19,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:19,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:33:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117254173] [2024-06-14 14:33:19,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:19,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:33:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:19,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:33:19,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:33:20,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:33:20,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 80 transitions, 527 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-14 14:33:20,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:20,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:33:20,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:20,489 INFO L124 PetriNetUnfolderBase]: 313/553 cut-off events. [2024-06-14 14:33:20,489 INFO L125 PetriNetUnfolderBase]: For 14413/14413 co-relation queries the response was YES. [2024-06-14 14:33:20,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2896 conditions, 553 events. 313/553 cut-off events. For 14413/14413 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2114 event pairs, 60 based on Foata normal form. 1/553 useless extension candidates. Maximal degree in co-relation 2846. Up to 505 conditions per place. [2024-06-14 14:33:20,492 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 87 selfloop transitions, 14 changer transitions 0/103 dead transitions. [2024-06-14 14:33:20,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 103 transitions, 795 flow [2024-06-14 14:33:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:33:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:33:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 14:33:20,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2024-06-14 14:33:20,494 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 527 flow. Second operand 9 states and 110 transitions. [2024-06-14 14:33:20,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 103 transitions, 795 flow [2024-06-14 14:33:20,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 103 transitions, 769 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 14:33:20,507 INFO L231 Difference]: Finished difference. Result has 102 places, 82 transitions, 552 flow [2024-06-14 14:33:20,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=552, PETRI_PLACES=102, PETRI_TRANSITIONS=82} [2024-06-14 14:33:20,509 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 70 predicate places. [2024-06-14 14:33:20,510 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 82 transitions, 552 flow [2024-06-14 14:33:20,510 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-14 14:33:20,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:20,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:20,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 14:33:20,510 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-14 14:33:20,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash 722118931, now seen corresponding path program 2 times [2024-06-14 14:33:20,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:20,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641259023] [2024-06-14 14:33:20,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:20,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:26,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:26,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641259023] [2024-06-14 14:33:26,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641259023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:26,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:26,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:33:26,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121898276] [2024-06-14 14:33:26,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:26,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:33:26,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:26,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:33:26,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:33:26,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:33:26,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 82 transitions, 552 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-14 14:33:26,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:26,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:33:26,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:27,279 INFO L124 PetriNetUnfolderBase]: 316/558 cut-off events. [2024-06-14 14:33:27,279 INFO L125 PetriNetUnfolderBase]: For 15381/15381 co-relation queries the response was YES. [2024-06-14 14:33:27,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 558 events. 316/558 cut-off events. For 15381/15381 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2163 event pairs, 61 based on Foata normal form. 1/558 useless extension candidates. Maximal degree in co-relation 2943. Up to 469 conditions per place. [2024-06-14 14:33:27,283 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 72 selfloop transitions, 31 changer transitions 0/105 dead transitions. [2024-06-14 14:33:27,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 105 transitions, 898 flow [2024-06-14 14:33:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:33:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:33:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 14:33:27,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-14 14:33:27,285 INFO L175 Difference]: Start difference. First operand has 102 places, 82 transitions, 552 flow. Second operand 9 states and 114 transitions. [2024-06-14 14:33:27,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 105 transitions, 898 flow [2024-06-14 14:33:27,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 105 transitions, 863 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 14:33:27,297 INFO L231 Difference]: Finished difference. Result has 104 places, 86 transitions, 624 flow [2024-06-14 14:33:27,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=624, PETRI_PLACES=104, PETRI_TRANSITIONS=86} [2024-06-14 14:33:27,297 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 72 predicate places. [2024-06-14 14:33:27,297 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 86 transitions, 624 flow [2024-06-14 14:33:27,297 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-14 14:33:27,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:27,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:27,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 14:33:27,298 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-14 14:33:27,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:27,298 INFO L85 PathProgramCache]: Analyzing trace with hash 722119117, now seen corresponding path program 1 times [2024-06-14 14:33:27,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:27,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259716352] [2024-06-14 14:33:27,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:27,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:33,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:33,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:33,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259716352] [2024-06-14 14:33:33,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259716352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:33,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:33,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:33:33,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327248874] [2024-06-14 14:33:33,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:33,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:33:33,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:33,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:33:33,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:33:33,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:33:33,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 86 transitions, 624 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:33,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:33,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:33:33,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:34,307 INFO L124 PetriNetUnfolderBase]: 335/589 cut-off events. [2024-06-14 14:33:34,307 INFO L125 PetriNetUnfolderBase]: For 18354/18354 co-relation queries the response was YES. [2024-06-14 14:33:34,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3239 conditions, 589 events. 335/589 cut-off events. For 18354/18354 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2324 event pairs, 52 based on Foata normal form. 3/591 useless extension candidates. Maximal degree in co-relation 3187. Up to 364 conditions per place. [2024-06-14 14:33:34,311 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 74 selfloop transitions, 41 changer transitions 0/117 dead transitions. [2024-06-14 14:33:34,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 117 transitions, 1012 flow [2024-06-14 14:33:34,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:33:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:33:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-14 14:33:34,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-06-14 14:33:34,312 INFO L175 Difference]: Start difference. First operand has 104 places, 86 transitions, 624 flow. Second operand 8 states and 126 transitions. [2024-06-14 14:33:34,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 117 transitions, 1012 flow [2024-06-14 14:33:34,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 117 transitions, 965 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 14:33:34,327 INFO L231 Difference]: Finished difference. Result has 107 places, 90 transitions, 696 flow [2024-06-14 14:33:34,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=696, PETRI_PLACES=107, PETRI_TRANSITIONS=90} [2024-06-14 14:33:34,328 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2024-06-14 14:33:34,328 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 90 transitions, 696 flow [2024-06-14 14:33:34,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:34,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:34,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:34,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 14:33:34,329 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-14 14:33:34,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:34,329 INFO L85 PathProgramCache]: Analyzing trace with hash 726767257, now seen corresponding path program 2 times [2024-06-14 14:33:34,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:34,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101591709] [2024-06-14 14:33:34,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:34,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:41,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:41,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101591709] [2024-06-14 14:33:41,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101591709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:41,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:41,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:33:41,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209262291] [2024-06-14 14:33:41,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:41,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:33:41,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:41,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:33:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:33:41,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:33:41,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 90 transitions, 696 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-14 14:33:41,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:41,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:33:41,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:42,130 INFO L124 PetriNetUnfolderBase]: 359/628 cut-off events. [2024-06-14 14:33:42,130 INFO L125 PetriNetUnfolderBase]: For 21221/21221 co-relation queries the response was YES. [2024-06-14 14:33:42,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3646 conditions, 628 events. 359/628 cut-off events. For 21221/21221 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2532 event pairs, 56 based on Foata normal form. 3/630 useless extension candidates. Maximal degree in co-relation 3593. Up to 384 conditions per place. [2024-06-14 14:33:42,134 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 77 selfloop transitions, 40 changer transitions 0/119 dead transitions. [2024-06-14 14:33:42,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 119 transitions, 1154 flow [2024-06-14 14:33:42,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:33:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:33:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-14 14:33:42,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-14 14:33:42,136 INFO L175 Difference]: Start difference. First operand has 107 places, 90 transitions, 696 flow. Second operand 9 states and 123 transitions. [2024-06-14 14:33:42,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 119 transitions, 1154 flow [2024-06-14 14:33:42,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 119 transitions, 1090 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 14:33:42,154 INFO L231 Difference]: Finished difference. Result has 112 places, 94 transitions, 753 flow [2024-06-14 14:33:42,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=753, PETRI_PLACES=112, PETRI_TRANSITIONS=94} [2024-06-14 14:33:42,154 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 80 predicate places. [2024-06-14 14:33:42,154 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 94 transitions, 753 flow [2024-06-14 14:33:42,155 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-14 14:33:42,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:42,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:42,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 14:33:42,155 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-14 14:33:42,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:42,155 INFO L85 PathProgramCache]: Analyzing trace with hash 726760747, now seen corresponding path program 3 times [2024-06-14 14:33:42,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:42,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312028171] [2024-06-14 14:33:42,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:42,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:48,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:48,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312028171] [2024-06-14 14:33:48,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312028171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:48,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:48,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:33:48,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116737486] [2024-06-14 14:33:48,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:48,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:33:48,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:48,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:33:48,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:33:48,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:33:48,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 94 transitions, 753 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:48,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:48,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:33:48,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:48,919 INFO L124 PetriNetUnfolderBase]: 353/619 cut-off events. [2024-06-14 14:33:48,919 INFO L125 PetriNetUnfolderBase]: For 21109/21109 co-relation queries the response was YES. [2024-06-14 14:33:48,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3626 conditions, 619 events. 353/619 cut-off events. For 21109/21109 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2490 event pairs, 54 based on Foata normal form. 3/621 useless extension candidates. Maximal degree in co-relation 3570. Up to 380 conditions per place. [2024-06-14 14:33:48,923 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 80 selfloop transitions, 38 changer transitions 0/120 dead transitions. [2024-06-14 14:33:48,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 120 transitions, 1121 flow [2024-06-14 14:33:48,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:33:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:33:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-14 14:33:48,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810606060606061 [2024-06-14 14:33:48,940 INFO L175 Difference]: Start difference. First operand has 112 places, 94 transitions, 753 flow. Second operand 8 states and 127 transitions. [2024-06-14 14:33:48,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 120 transitions, 1121 flow [2024-06-14 14:33:48,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 120 transitions, 1059 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 14:33:48,963 INFO L231 Difference]: Finished difference. Result has 115 places, 94 transitions, 772 flow [2024-06-14 14:33:48,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=772, PETRI_PLACES=115, PETRI_TRANSITIONS=94} [2024-06-14 14:33:48,964 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 83 predicate places. [2024-06-14 14:33:48,965 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 94 transitions, 772 flow [2024-06-14 14:33:48,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:48,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:48,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:48,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 14:33:48,965 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-14 14:33:48,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash 726760561, now seen corresponding path program 3 times [2024-06-14 14:33:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:48,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405133474] [2024-06-14 14:33:48,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:48,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:55,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:55,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405133474] [2024-06-14 14:33:55,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405133474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:55,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:55,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:33:55,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801847700] [2024-06-14 14:33:55,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:55,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:33:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:33:55,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:33:55,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:33:55,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 94 transitions, 772 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-14 14:33:55,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:55,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:33:55,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:55,498 INFO L124 PetriNetUnfolderBase]: 356/624 cut-off events. [2024-06-14 14:33:55,498 INFO L125 PetriNetUnfolderBase]: For 21369/21369 co-relation queries the response was YES. [2024-06-14 14:33:55,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3712 conditions, 624 events. 356/624 cut-off events. For 21369/21369 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2497 event pairs, 69 based on Foata normal form. 1/624 useless extension candidates. Maximal degree in co-relation 3656. Up to 534 conditions per place. [2024-06-14 14:33:55,502 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 79 selfloop transitions, 31 changer transitions 0/112 dead transitions. [2024-06-14 14:33:55,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 112 transitions, 1114 flow [2024-06-14 14:33:55,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:33:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:33:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 14:33:55,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3771043771043771 [2024-06-14 14:33:55,503 INFO L175 Difference]: Start difference. First operand has 115 places, 94 transitions, 772 flow. Second operand 9 states and 112 transitions. [2024-06-14 14:33:55,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 112 transitions, 1114 flow [2024-06-14 14:33:55,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 112 transitions, 1032 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-14 14:33:55,533 INFO L231 Difference]: Finished difference. Result has 117 places, 96 transitions, 775 flow [2024-06-14 14:33:55,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=775, PETRI_PLACES=117, PETRI_TRANSITIONS=96} [2024-06-14 14:33:55,534 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 85 predicate places. [2024-06-14 14:33:55,534 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 96 transitions, 775 flow [2024-06-14 14:33:55,534 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-14 14:33:55,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:55,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:55,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 14:33:55,535 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-14 14:33:55,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:55,535 INFO L85 PathProgramCache]: Analyzing trace with hash 899250637, now seen corresponding path program 4 times [2024-06-14 14:33:55,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:55,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126210449] [2024-06-14 14:33:55,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:55,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:02,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:02,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126210449] [2024-06-14 14:34:02,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126210449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:02,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:02,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:34:02,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200872444] [2024-06-14 14:34:02,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:02,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:34:02,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:02,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:34:02,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:34:02,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:34:02,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 96 transitions, 775 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:02,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:02,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:34:02,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:02,389 INFO L124 PetriNetUnfolderBase]: 380/663 cut-off events. [2024-06-14 14:34:02,389 INFO L125 PetriNetUnfolderBase]: For 25365/25365 co-relation queries the response was YES. [2024-06-14 14:34:02,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3931 conditions, 663 events. 380/663 cut-off events. For 25365/25365 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2711 event pairs, 70 based on Foata normal form. 3/665 useless extension candidates. Maximal degree in co-relation 3873. Up to 405 conditions per place. [2024-06-14 14:34:02,418 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 82 selfloop transitions, 40 changer transitions 0/124 dead transitions. [2024-06-14 14:34:02,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 124 transitions, 1249 flow [2024-06-14 14:34:02,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:34:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:34:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-14 14:34:02,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-06-14 14:34:02,419 INFO L175 Difference]: Start difference. First operand has 117 places, 96 transitions, 775 flow. Second operand 8 states and 126 transitions. [2024-06-14 14:34:02,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 124 transitions, 1249 flow [2024-06-14 14:34:02,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 124 transitions, 1193 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 14:34:02,441 INFO L231 Difference]: Finished difference. Result has 119 places, 100 transitions, 836 flow [2024-06-14 14:34:02,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=836, PETRI_PLACES=119, PETRI_TRANSITIONS=100} [2024-06-14 14:34:02,441 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 87 predicate places. [2024-06-14 14:34:02,442 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 100 transitions, 836 flow [2024-06-14 14:34:02,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:02,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:02,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:02,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 14:34:02,442 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-14 14:34:02,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:02,443 INFO L85 PathProgramCache]: Analyzing trace with hash -321120595, now seen corresponding path program 5 times [2024-06-14 14:34:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:02,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869835691] [2024-06-14 14:34:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:02,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:09,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869835691] [2024-06-14 14:34:09,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869835691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:09,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:09,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:34:09,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205862214] [2024-06-14 14:34:09,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:09,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:34:09,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:09,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:34:09,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:34:09,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:34:09,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 100 transitions, 836 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-14 14:34:09,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:09,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:34:09,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:10,151 INFO L124 PetriNetUnfolderBase]: 389/678 cut-off events. [2024-06-14 14:34:10,151 INFO L125 PetriNetUnfolderBase]: For 27015/27015 co-relation queries the response was YES. [2024-06-14 14:34:10,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4097 conditions, 678 events. 389/678 cut-off events. For 27015/27015 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2788 event pairs, 76 based on Foata normal form. 3/680 useless extension candidates. Maximal degree in co-relation 4039. Up to 413 conditions per place. [2024-06-14 14:34:10,156 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 77 selfloop transitions, 45 changer transitions 0/124 dead transitions. [2024-06-14 14:34:10,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 124 transitions, 1296 flow [2024-06-14 14:34:10,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:34:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:34:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-14 14:34:10,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-14 14:34:10,157 INFO L175 Difference]: Start difference. First operand has 119 places, 100 transitions, 836 flow. Second operand 9 states and 121 transitions. [2024-06-14 14:34:10,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 124 transitions, 1296 flow [2024-06-14 14:34:10,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 124 transitions, 1233 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 14:34:10,181 INFO L231 Difference]: Finished difference. Result has 124 places, 102 transitions, 888 flow [2024-06-14 14:34:10,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=888, PETRI_PLACES=124, PETRI_TRANSITIONS=102} [2024-06-14 14:34:10,181 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2024-06-14 14:34:10,182 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 102 transitions, 888 flow [2024-06-14 14:34:10,182 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-14 14:34:10,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:10,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:10,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 14:34:10,182 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-14 14:34:10,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:10,183 INFO L85 PathProgramCache]: Analyzing trace with hash -321351235, now seen corresponding path program 6 times [2024-06-14 14:34:10,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:10,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149981075] [2024-06-14 14:34:10,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:10,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:17,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:17,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149981075] [2024-06-14 14:34:17,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149981075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:17,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:17,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:34:17,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088911164] [2024-06-14 14:34:17,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:17,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:34:17,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:17,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:34:17,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:34:17,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:34:17,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 102 transitions, 888 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-14 14:34:17,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:17,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:34:17,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:18,055 INFO L124 PetriNetUnfolderBase]: 383/669 cut-off events. [2024-06-14 14:34:18,055 INFO L125 PetriNetUnfolderBase]: For 26651/26651 co-relation queries the response was YES. [2024-06-14 14:34:18,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4022 conditions, 669 events. 383/669 cut-off events. For 26651/26651 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2744 event pairs, 70 based on Foata normal form. 3/671 useless extension candidates. Maximal degree in co-relation 3962. Up to 409 conditions per place. [2024-06-14 14:34:18,060 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 81 selfloop transitions, 42 changer transitions 0/125 dead transitions. [2024-06-14 14:34:18,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 125 transitions, 1266 flow [2024-06-14 14:34:18,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:34:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:34:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-06-14 14:34:18,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4175084175084175 [2024-06-14 14:34:18,088 INFO L175 Difference]: Start difference. First operand has 124 places, 102 transitions, 888 flow. Second operand 9 states and 124 transitions. [2024-06-14 14:34:18,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 125 transitions, 1266 flow [2024-06-14 14:34:18,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 125 transitions, 1187 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 14:34:18,115 INFO L231 Difference]: Finished difference. Result has 127 places, 102 transitions, 898 flow [2024-06-14 14:34:18,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=898, PETRI_PLACES=127, PETRI_TRANSITIONS=102} [2024-06-14 14:34:18,116 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 95 predicate places. [2024-06-14 14:34:18,116 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 102 transitions, 898 flow [2024-06-14 14:34:18,117 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-14 14:34:18,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:18,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:18,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 14:34:18,117 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-14 14:34:18,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash -321357931, now seen corresponding path program 4 times [2024-06-14 14:34:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:18,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526505879] [2024-06-14 14:34:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:18,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:25,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:25,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526505879] [2024-06-14 14:34:25,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526505879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:25,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:25,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:34:25,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619401127] [2024-06-14 14:34:25,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:25,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:34:25,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:25,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:34:25,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:34:25,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:34:25,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 102 transitions, 898 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-14 14:34:25,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:25,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:34:25,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:26,068 INFO L124 PetriNetUnfolderBase]: 386/674 cut-off events. [2024-06-14 14:34:26,069 INFO L125 PetriNetUnfolderBase]: For 26865/26865 co-relation queries the response was YES. [2024-06-14 14:34:26,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4084 conditions, 674 events. 386/674 cut-off events. For 26865/26865 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2766 event pairs, 81 based on Foata normal form. 1/674 useless extension candidates. Maximal degree in co-relation 4023. Up to 583 conditions per place. [2024-06-14 14:34:26,089 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 83 selfloop transitions, 32 changer transitions 0/117 dead transitions. [2024-06-14 14:34:26,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 117 transitions, 1252 flow [2024-06-14 14:34:26,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:34:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:34:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 14:34:26,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2024-06-14 14:34:26,102 INFO L175 Difference]: Start difference. First operand has 127 places, 102 transitions, 898 flow. Second operand 9 states and 110 transitions. [2024-06-14 14:34:26,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 117 transitions, 1252 flow [2024-06-14 14:34:26,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 117 transitions, 1142 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-14 14:34:26,129 INFO L231 Difference]: Finished difference. Result has 127 places, 104 transitions, 877 flow [2024-06-14 14:34:26,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=877, PETRI_PLACES=127, PETRI_TRANSITIONS=104} [2024-06-14 14:34:26,129 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 95 predicate places. [2024-06-14 14:34:26,129 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 104 transitions, 877 flow [2024-06-14 14:34:26,129 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-14 14:34:26,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:26,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:26,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 14:34:26,130 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-14 14:34:26,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:26,130 INFO L85 PathProgramCache]: Analyzing trace with hash -894105845, now seen corresponding path program 7 times [2024-06-14 14:34:26,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:26,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793223840] [2024-06-14 14:34:26,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:26,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:33,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:33,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793223840] [2024-06-14 14:34:33,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793223840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:33,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:33,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:34:33,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34854016] [2024-06-14 14:34:33,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:33,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:34:33,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:33,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:34:33,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:34:33,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:34:33,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 104 transitions, 877 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:33,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:33,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:34:33,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:33,902 INFO L124 PetriNetUnfolderBase]: 410/713 cut-off events. [2024-06-14 14:34:33,902 INFO L125 PetriNetUnfolderBase]: For 31776/31776 co-relation queries the response was YES. [2024-06-14 14:34:33,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 713 events. 410/713 cut-off events. For 31776/31776 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2983 event pairs, 78 based on Foata normal form. 3/715 useless extension candidates. Maximal degree in co-relation 4228. Up to 585 conditions per place. [2024-06-14 14:34:33,907 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 101 selfloop transitions, 24 changer transitions 0/127 dead transitions. [2024-06-14 14:34:33,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 127 transitions, 1363 flow [2024-06-14 14:34:33,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:34:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:34:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 14:34:33,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-14 14:34:33,908 INFO L175 Difference]: Start difference. First operand has 127 places, 104 transitions, 877 flow. Second operand 9 states and 114 transitions. [2024-06-14 14:34:33,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 127 transitions, 1363 flow [2024-06-14 14:34:33,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 127 transitions, 1304 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 14:34:33,942 INFO L231 Difference]: Finished difference. Result has 130 places, 108 transitions, 907 flow [2024-06-14 14:34:33,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=907, PETRI_PLACES=130, PETRI_TRANSITIONS=108} [2024-06-14 14:34:33,944 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 98 predicate places. [2024-06-14 14:34:33,944 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 108 transitions, 907 flow [2024-06-14 14:34:33,944 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-14 14:34:33,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:33,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:33,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 14:34:33,945 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-14 14:34:33,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash -675346841, now seen corresponding path program 5 times [2024-06-14 14:34:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118917577] [2024-06-14 14:34:33,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:33,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:39,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:39,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118917577] [2024-06-14 14:34:39,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118917577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:39,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:39,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:34:39,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091270053] [2024-06-14 14:34:39,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:39,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:34:39,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:34:39,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:34:39,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:34:39,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 108 transitions, 907 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-14 14:34:39,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:39,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:34:39,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:40,255 INFO L124 PetriNetUnfolderBase]: 408/710 cut-off events. [2024-06-14 14:34:40,255 INFO L125 PetriNetUnfolderBase]: For 31285/31285 co-relation queries the response was YES. [2024-06-14 14:34:40,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4293 conditions, 710 events. 408/710 cut-off events. For 31285/31285 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2962 event pairs, 86 based on Foata normal form. 1/710 useless extension candidates. Maximal degree in co-relation 4230. Up to 686 conditions per place. [2024-06-14 14:34:40,260 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 101 selfloop transitions, 14 changer transitions 0/117 dead transitions. [2024-06-14 14:34:40,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 117 transitions, 1157 flow [2024-06-14 14:34:40,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:34:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:34:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 14:34:40,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32996632996632996 [2024-06-14 14:34:40,261 INFO L175 Difference]: Start difference. First operand has 130 places, 108 transitions, 907 flow. Second operand 9 states and 98 transitions. [2024-06-14 14:34:40,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 117 transitions, 1157 flow [2024-06-14 14:34:40,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 117 transitions, 1097 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 14:34:40,299 INFO L231 Difference]: Finished difference. Result has 133 places, 108 transitions, 880 flow [2024-06-14 14:34:40,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=880, PETRI_PLACES=133, PETRI_TRANSITIONS=108} [2024-06-14 14:34:40,300 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2024-06-14 14:34:40,300 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 108 transitions, 880 flow [2024-06-14 14:34:40,300 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-14 14:34:40,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:40,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:40,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 14:34:40,301 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-14 14:34:40,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:40,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1763747097, now seen corresponding path program 8 times [2024-06-14 14:34:40,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:40,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300094787] [2024-06-14 14:34:40,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:40,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:47,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:47,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300094787] [2024-06-14 14:34:47,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300094787] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:47,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:47,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:34:47,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541321114] [2024-06-14 14:34:47,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:47,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:34:47,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:47,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:34:47,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:34:47,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:34:47,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 108 transitions, 880 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-14 14:34:47,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:47,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:34:47,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:47,914 INFO L124 PetriNetUnfolderBase]: 417/725 cut-off events. [2024-06-14 14:34:47,914 INFO L125 PetriNetUnfolderBase]: For 34206/34206 co-relation queries the response was YES. [2024-06-14 14:34:47,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4315 conditions, 725 events. 417/725 cut-off events. For 34206/34206 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3055 event pairs, 66 based on Foata normal form. 3/727 useless extension candidates. Maximal degree in co-relation 4251. Up to 590 conditions per place. [2024-06-14 14:34:47,919 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 97 selfloop transitions, 29 changer transitions 0/128 dead transitions. [2024-06-14 14:34:47,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 128 transitions, 1274 flow [2024-06-14 14:34:47,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:34:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:34:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 14:34:47,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37373737373737376 [2024-06-14 14:34:47,920 INFO L175 Difference]: Start difference. First operand has 133 places, 108 transitions, 880 flow. Second operand 9 states and 111 transitions. [2024-06-14 14:34:47,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 128 transitions, 1274 flow [2024-06-14 14:34:47,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 1202 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 14:34:47,962 INFO L231 Difference]: Finished difference. Result has 132 places, 110 transitions, 887 flow [2024-06-14 14:34:47,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=887, PETRI_PLACES=132, PETRI_TRANSITIONS=110} [2024-06-14 14:34:47,962 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2024-06-14 14:34:47,962 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 110 transitions, 887 flow [2024-06-14 14:34:47,963 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-14 14:34:47,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:47,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:47,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 14:34:47,963 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-14 14:34:47,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:47,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1763753607, now seen corresponding path program 9 times [2024-06-14 14:34:47,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:47,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713413893] [2024-06-14 14:34:47,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:47,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:55,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-14 14:34:55,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:55,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713413893] [2024-06-14 14:34:55,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713413893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:55,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:55,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:34:55,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087058595] [2024-06-14 14:34:55,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:55,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:34:55,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:55,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:34:55,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:34:55,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:34:55,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 110 transitions, 887 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-14 14:34:55,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:55,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:34:55,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:55,660 INFO L124 PetriNetUnfolderBase]: 411/716 cut-off events. [2024-06-14 14:34:55,660 INFO L125 PetriNetUnfolderBase]: For 33318/33318 co-relation queries the response was YES. [2024-06-14 14:34:55,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4256 conditions, 716 events. 411/716 cut-off events. For 33318/33318 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3022 event pairs, 66 based on Foata normal form. 3/718 useless extension candidates. Maximal degree in co-relation 4191. Up to 586 conditions per place. [2024-06-14 14:34:55,665 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 99 selfloop transitions, 27 changer transitions 0/128 dead transitions. [2024-06-14 14:34:55,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 128 transitions, 1267 flow [2024-06-14 14:34:55,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:34:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:34:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 14:34:55,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3771043771043771 [2024-06-14 14:34:55,666 INFO L175 Difference]: Start difference. First operand has 132 places, 110 transitions, 887 flow. Second operand 9 states and 112 transitions. [2024-06-14 14:34:55,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 128 transitions, 1267 flow [2024-06-14 14:34:55,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 128 transitions, 1153 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 14:34:55,713 INFO L231 Difference]: Finished difference. Result has 133 places, 110 transitions, 832 flow [2024-06-14 14:34:55,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=832, PETRI_PLACES=133, PETRI_TRANSITIONS=110} [2024-06-14 14:34:55,714 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2024-06-14 14:34:55,714 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 110 transitions, 832 flow [2024-06-14 14:34:55,714 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-14 14:34:55,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:55,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:55,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 14:34:55,715 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-14 14:34:55,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:55,715 INFO L85 PathProgramCache]: Analyzing trace with hash -704766453, now seen corresponding path program 10 times [2024-06-14 14:34:55,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:55,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335340501] [2024-06-14 14:34:55,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:55,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:02,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:02,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:02,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335340501] [2024-06-14 14:35:02,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335340501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:02,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:02,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:35:02,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010897374] [2024-06-14 14:35:02,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:02,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:35:02,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:02,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:35:02,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:35:02,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:35:02,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 110 transitions, 832 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-14 14:35:02,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:02,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:35:02,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:03,254 INFO L124 PetriNetUnfolderBase]: 405/707 cut-off events. [2024-06-14 14:35:03,254 INFO L125 PetriNetUnfolderBase]: For 32172/32172 co-relation queries the response was YES. [2024-06-14 14:35:03,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4071 conditions, 707 events. 405/707 cut-off events. For 32172/32172 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2952 event pairs, 78 based on Foata normal form. 3/709 useless extension candidates. Maximal degree in co-relation 4005. Up to 657 conditions per place. [2024-06-14 14:35:03,259 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 109 selfloop transitions, 14 changer transitions 0/125 dead transitions. [2024-06-14 14:35:03,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 125 transitions, 1116 flow [2024-06-14 14:35:03,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:35:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:35:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-14 14:35:03,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3501683501683502 [2024-06-14 14:35:03,260 INFO L175 Difference]: Start difference. First operand has 133 places, 110 transitions, 832 flow. Second operand 9 states and 104 transitions. [2024-06-14 14:35:03,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 125 transitions, 1116 flow [2024-06-14 14:35:03,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 1063 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 14:35:03,306 INFO L231 Difference]: Finished difference. Result has 135 places, 110 transitions, 812 flow [2024-06-14 14:35:03,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=812, PETRI_PLACES=135, PETRI_TRANSITIONS=110} [2024-06-14 14:35:03,307 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 103 predicate places. [2024-06-14 14:35:03,308 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 110 transitions, 812 flow [2024-06-14 14:35:03,308 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-14 14:35:03,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:03,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:03,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 14:35:03,308 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-14 14:35:03,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:03,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1448339567, now seen corresponding path program 1 times [2024-06-14 14:35:03,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:03,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287272031] [2024-06-14 14:35:03,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:03,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:10,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:10,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287272031] [2024-06-14 14:35:10,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287272031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:10,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:10,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:35:10,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849102693] [2024-06-14 14:35:10,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:10,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:35:10,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:10,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:35:10,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:35:10,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:35:10,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 110 transitions, 812 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-14 14:35:10,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:10,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:35:10,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:11,028 INFO L124 PetriNetUnfolderBase]: 401/701 cut-off events. [2024-06-14 14:35:11,028 INFO L125 PetriNetUnfolderBase]: For 30907/30907 co-relation queries the response was YES. [2024-06-14 14:35:11,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3972 conditions, 701 events. 401/701 cut-off events. For 30907/30907 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2929 event pairs, 76 based on Foata normal form. 2/702 useless extension candidates. Maximal degree in co-relation 3905. Up to 664 conditions per place. [2024-06-14 14:35:11,033 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 107 selfloop transitions, 16 changer transitions 0/125 dead transitions. [2024-06-14 14:35:11,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 125 transitions, 1113 flow [2024-06-14 14:35:11,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:35:11,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:35:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 14:35:11,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32727272727272727 [2024-06-14 14:35:11,034 INFO L175 Difference]: Start difference. First operand has 135 places, 110 transitions, 812 flow. Second operand 10 states and 108 transitions. [2024-06-14 14:35:11,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 125 transitions, 1113 flow [2024-06-14 14:35:11,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 1050 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-14 14:35:11,081 INFO L231 Difference]: Finished difference. Result has 136 places, 114 transitions, 826 flow [2024-06-14 14:35:11,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=826, PETRI_PLACES=136, PETRI_TRANSITIONS=114} [2024-06-14 14:35:11,081 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 104 predicate places. [2024-06-14 14:35:11,081 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 114 transitions, 826 flow [2024-06-14 14:35:11,082 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-14 14:35:11,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:11,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:11,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 14:35:11,083 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-14 14:35:11,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:11,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1722887944, now seen corresponding path program 1 times [2024-06-14 14:35:11,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:11,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025016509] [2024-06-14 14:35:11,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:11,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:19,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:19,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025016509] [2024-06-14 14:35:19,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025016509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:19,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:19,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:35:19,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479080789] [2024-06-14 14:35:19,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:19,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:35:19,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:19,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:35:19,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:35:20,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:35:20,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 114 transitions, 826 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:20,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:20,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:35:20,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:20,637 INFO L124 PetriNetUnfolderBase]: 409/714 cut-off events. [2024-06-14 14:35:20,638 INFO L125 PetriNetUnfolderBase]: For 32116/32116 co-relation queries the response was YES. [2024-06-14 14:35:20,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 714 events. 409/714 cut-off events. For 32116/32116 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3015 event pairs, 82 based on Foata normal form. 1/714 useless extension candidates. Maximal degree in co-relation 4035. Up to 650 conditions per place. [2024-06-14 14:35:20,643 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 121 selfloop transitions, 21 changer transitions 0/144 dead transitions. [2024-06-14 14:35:20,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 144 transitions, 1308 flow [2024-06-14 14:35:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:35:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:35:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-14 14:35:20,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36639118457300274 [2024-06-14 14:35:20,647 INFO L175 Difference]: Start difference. First operand has 136 places, 114 transitions, 826 flow. Second operand 11 states and 133 transitions. [2024-06-14 14:35:20,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 144 transitions, 1308 flow [2024-06-14 14:35:20,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 144 transitions, 1265 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 14:35:20,700 INFO L231 Difference]: Finished difference. Result has 140 places, 118 transitions, 870 flow [2024-06-14 14:35:20,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=870, PETRI_PLACES=140, PETRI_TRANSITIONS=118} [2024-06-14 14:35:20,702 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2024-06-14 14:35:20,702 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 118 transitions, 870 flow [2024-06-14 14:35:20,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:20,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:20,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:20,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 14:35:20,703 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-14 14:35:20,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:20,703 INFO L85 PathProgramCache]: Analyzing trace with hash 907132332, now seen corresponding path program 2 times [2024-06-14 14:35:20,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:20,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650100808] [2024-06-14 14:35:20,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:20,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:28,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:28,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650100808] [2024-06-14 14:35:28,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650100808] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:28,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:28,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:35:28,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896467600] [2024-06-14 14:35:28,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:28,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:35:28,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:28,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:35:28,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:35:29,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:35:29,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 118 transitions, 870 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:29,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:29,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:35:29,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:29,562 INFO L124 PetriNetUnfolderBase]: 407/711 cut-off events. [2024-06-14 14:35:29,563 INFO L125 PetriNetUnfolderBase]: For 32654/32654 co-relation queries the response was YES. [2024-06-14 14:35:29,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4113 conditions, 711 events. 407/711 cut-off events. For 32654/32654 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2999 event pairs, 82 based on Foata normal form. 1/711 useless extension candidates. Maximal degree in co-relation 4043. Up to 660 conditions per place. [2024-06-14 14:35:29,602 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 120 selfloop transitions, 17 changer transitions 0/139 dead transitions. [2024-06-14 14:35:29,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 139 transitions, 1204 flow [2024-06-14 14:35:29,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:35:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:35:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-14 14:35:29,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3606060606060606 [2024-06-14 14:35:29,605 INFO L175 Difference]: Start difference. First operand has 140 places, 118 transitions, 870 flow. Second operand 10 states and 119 transitions. [2024-06-14 14:35:29,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 139 transitions, 1204 flow [2024-06-14 14:35:29,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 139 transitions, 1156 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 14:35:29,654 INFO L231 Difference]: Finished difference. Result has 143 places, 118 transitions, 861 flow [2024-06-14 14:35:29,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=861, PETRI_PLACES=143, PETRI_TRANSITIONS=118} [2024-06-14 14:35:29,654 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-14 14:35:29,654 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 118 transitions, 861 flow [2024-06-14 14:35:29,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:29,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:29,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:29,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 14:35:29,655 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-14 14:35:29,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:29,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1722978309, now seen corresponding path program 1 times [2024-06-14 14:35:29,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:29,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484005729] [2024-06-14 14:35:29,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:29,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484005729] [2024-06-14 14:35:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484005729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:37,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:37,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:35:37,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665091233] [2024-06-14 14:35:37,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:37,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:35:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:37,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:35:37,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:35:37,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:35:37,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 118 transitions, 861 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:37,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:37,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:35:37,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:38,026 INFO L124 PetriNetUnfolderBase]: 416/726 cut-off events. [2024-06-14 14:35:38,026 INFO L125 PetriNetUnfolderBase]: For 36350/36350 co-relation queries the response was YES. [2024-06-14 14:35:38,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4207 conditions, 726 events. 416/726 cut-off events. For 36350/36350 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3079 event pairs, 81 based on Foata normal form. 3/728 useless extension candidates. Maximal degree in co-relation 4135. Up to 669 conditions per place. [2024-06-14 14:35:38,031 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 124 selfloop transitions, 17 changer transitions 0/143 dead transitions. [2024-06-14 14:35:38,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 143 transitions, 1231 flow [2024-06-14 14:35:38,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:35:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:35:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 14:35:38,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-14 14:35:38,033 INFO L175 Difference]: Start difference. First operand has 143 places, 118 transitions, 861 flow. Second operand 10 states and 121 transitions. [2024-06-14 14:35:38,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 143 transitions, 1231 flow [2024-06-14 14:35:38,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 143 transitions, 1192 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-14 14:35:38,086 INFO L231 Difference]: Finished difference. Result has 144 places, 120 transitions, 887 flow [2024-06-14 14:35:38,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=887, PETRI_PLACES=144, PETRI_TRANSITIONS=120} [2024-06-14 14:35:38,087 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 112 predicate places. [2024-06-14 14:35:38,087 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 120 transitions, 887 flow [2024-06-14 14:35:38,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:38,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:38,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:38,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 14:35:38,088 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-14 14:35:38,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:38,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1726697224, now seen corresponding path program 3 times [2024-06-14 14:35:38,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:38,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372588630] [2024-06-14 14:35:38,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:38,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:46,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:46,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372588630] [2024-06-14 14:35:46,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372588630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:46,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:46,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:35:46,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771271693] [2024-06-14 14:35:46,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:46,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:35:46,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:46,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:35:46,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:35:46,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:35:46,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 120 transitions, 887 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:46,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:46,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:35:46,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:46,526 INFO L124 PetriNetUnfolderBase]: 419/731 cut-off events. [2024-06-14 14:35:46,527 INFO L125 PetriNetUnfolderBase]: For 35656/35656 co-relation queries the response was YES. [2024-06-14 14:35:46,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4302 conditions, 731 events. 419/731 cut-off events. For 35656/35656 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3113 event pairs, 82 based on Foata normal form. 1/731 useless extension candidates. Maximal degree in co-relation 4229. Up to 638 conditions per place. [2024-06-14 14:35:46,532 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 100 selfloop transitions, 38 changer transitions 0/140 dead transitions. [2024-06-14 14:35:46,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 140 transitions, 1235 flow [2024-06-14 14:35:46,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:35:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:35:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 14:35:46,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3696969696969697 [2024-06-14 14:35:46,533 INFO L175 Difference]: Start difference. First operand has 144 places, 120 transitions, 887 flow. Second operand 10 states and 122 transitions. [2024-06-14 14:35:46,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 140 transitions, 1235 flow [2024-06-14 14:35:46,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 140 transitions, 1186 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 14:35:46,589 INFO L231 Difference]: Finished difference. Result has 146 places, 122 transitions, 945 flow [2024-06-14 14:35:46,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=945, PETRI_PLACES=146, PETRI_TRANSITIONS=122} [2024-06-14 14:35:46,590 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 114 predicate places. [2024-06-14 14:35:46,590 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 122 transitions, 945 flow [2024-06-14 14:35:46,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:46,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:46,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:46,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 14:35:46,590 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-14 14:35:46,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash 910851557, now seen corresponding path program 2 times [2024-06-14 14:35:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:46,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475976335] [2024-06-14 14:35:46,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:46,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:52,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:52,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:52,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475976335] [2024-06-14 14:35:52,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475976335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:52,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:52,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:35:52,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197080707] [2024-06-14 14:35:52,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:52,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:35:52,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:52,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:35:52,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:35:53,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:35:53,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 122 transitions, 945 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-14 14:35:53,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:53,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:35:53,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:53,412 INFO L124 PetriNetUnfolderBase]: 453/786 cut-off events. [2024-06-14 14:35:53,412 INFO L125 PetriNetUnfolderBase]: For 45638/45638 co-relation queries the response was YES. [2024-06-14 14:35:53,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4867 conditions, 786 events. 453/786 cut-off events. For 45638/45638 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3425 event pairs, 52 based on Foata normal form. 3/788 useless extension candidates. Maximal degree in co-relation 4793. Up to 378 conditions per place. [2024-06-14 14:35:53,418 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 98 selfloop transitions, 60 changer transitions 0/160 dead transitions. [2024-06-14 14:35:53,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 160 transitions, 1621 flow [2024-06-14 14:35:53,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:35:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:35:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-14 14:35:53,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4882154882154882 [2024-06-14 14:35:53,428 INFO L175 Difference]: Start difference. First operand has 146 places, 122 transitions, 945 flow. Second operand 9 states and 145 transitions. [2024-06-14 14:35:53,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 160 transitions, 1621 flow [2024-06-14 14:35:53,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 160 transitions, 1530 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 14:35:53,488 INFO L231 Difference]: Finished difference. Result has 147 places, 128 transitions, 1061 flow [2024-06-14 14:35:53,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1061, PETRI_PLACES=147, PETRI_TRANSITIONS=128} [2024-06-14 14:35:53,488 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 115 predicate places. [2024-06-14 14:35:53,488 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 128 transitions, 1061 flow [2024-06-14 14:35:53,489 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-14 14:35:53,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:53,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:53,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 14:35:53,489 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-14 14:35:53,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1865231109, now seen corresponding path program 3 times [2024-06-14 14:35:53,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:53,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517232065] [2024-06-14 14:35:53,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:53,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:00,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:00,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517232065] [2024-06-14 14:36:00,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517232065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:00,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:00,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:36:00,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298684850] [2024-06-14 14:36:00,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:00,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:36:00,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:00,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:36:00,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:36:01,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:36:01,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 128 transitions, 1061 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:01,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:01,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:36:01,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:01,462 INFO L124 PetriNetUnfolderBase]: 447/777 cut-off events. [2024-06-14 14:36:01,462 INFO L125 PetriNetUnfolderBase]: For 44181/44181 co-relation queries the response was YES. [2024-06-14 14:36:01,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4843 conditions, 777 events. 447/777 cut-off events. For 44181/44181 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3376 event pairs, 52 based on Foata normal form. 3/779 useless extension candidates. Maximal degree in co-relation 4769. Up to 374 conditions per place. [2024-06-14 14:36:01,468 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 93 selfloop transitions, 62 changer transitions 0/157 dead transitions. [2024-06-14 14:36:01,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 157 transitions, 1551 flow [2024-06-14 14:36:01,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:36:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:36:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-14 14:36:01,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-14 14:36:01,469 INFO L175 Difference]: Start difference. First operand has 147 places, 128 transitions, 1061 flow. Second operand 10 states and 138 transitions. [2024-06-14 14:36:01,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 157 transitions, 1551 flow [2024-06-14 14:36:01,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 157 transitions, 1456 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-14 14:36:01,539 INFO L231 Difference]: Finished difference. Result has 153 places, 128 transitions, 1095 flow [2024-06-14 14:36:01,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1095, PETRI_PLACES=153, PETRI_TRANSITIONS=128} [2024-06-14 14:36:01,540 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 121 predicate places. [2024-06-14 14:36:01,540 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 128 transitions, 1095 flow [2024-06-14 14:36:01,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:01,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:01,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:01,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 14:36:01,541 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-14 14:36:01,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:01,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1054741932, now seen corresponding path program 4 times [2024-06-14 14:36:01,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:01,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093874164] [2024-06-14 14:36:01,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:01,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:09,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:09,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093874164] [2024-06-14 14:36:09,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093874164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:09,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:09,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:36:09,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928252478] [2024-06-14 14:36:09,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:09,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:36:09,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:09,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:36:09,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:36:09,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:36:09,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 128 transitions, 1095 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:09,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:09,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:36:09,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:09,526 INFO L124 PetriNetUnfolderBase]: 450/782 cut-off events. [2024-06-14 14:36:09,526 INFO L125 PetriNetUnfolderBase]: For 43258/43258 co-relation queries the response was YES. [2024-06-14 14:36:09,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4993 conditions, 782 events. 450/782 cut-off events. For 43258/43258 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3366 event pairs, 95 based on Foata normal form. 1/782 useless extension candidates. Maximal degree in co-relation 4916. Up to 689 conditions per place. [2024-06-14 14:36:09,535 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 107 selfloop transitions, 36 changer transitions 0/145 dead transitions. [2024-06-14 14:36:09,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 145 transitions, 1447 flow [2024-06-14 14:36:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:36:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:36:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 14:36:09,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 14:36:09,538 INFO L175 Difference]: Start difference. First operand has 153 places, 128 transitions, 1095 flow. Second operand 10 states and 120 transitions. [2024-06-14 14:36:09,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 145 transitions, 1447 flow [2024-06-14 14:36:09,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 145 transitions, 1318 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-14 14:36:09,620 INFO L231 Difference]: Finished difference. Result has 154 places, 130 transitions, 1073 flow [2024-06-14 14:36:09,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1073, PETRI_PLACES=154, PETRI_TRANSITIONS=130} [2024-06-14 14:36:09,621 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 122 predicate places. [2024-06-14 14:36:09,621 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 130 transitions, 1073 flow [2024-06-14 14:36:09,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:09,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:09,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:09,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 14:36:09,622 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-14 14:36:09,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:09,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1870795299, now seen corresponding path program 4 times [2024-06-14 14:36:09,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:09,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350883574] [2024-06-14 14:36:09,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:09,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:17,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:17,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350883574] [2024-06-14 14:36:17,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350883574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:17,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:17,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:36:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058031988] [2024-06-14 14:36:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:17,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:36:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:17,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:36:17,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:36:17,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:36:17,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 130 transitions, 1073 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:17,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:17,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:36:17,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:17,691 INFO L124 PetriNetUnfolderBase]: 474/821 cut-off events. [2024-06-14 14:36:17,692 INFO L125 PetriNetUnfolderBase]: For 51476/51476 co-relation queries the response was YES. [2024-06-14 14:36:17,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5276 conditions, 821 events. 474/821 cut-off events. For 51476/51476 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3612 event pairs, 64 based on Foata normal form. 3/823 useless extension candidates. Maximal degree in co-relation 5198. Up to 399 conditions per place. [2024-06-14 14:36:17,698 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 98 selfloop transitions, 61 changer transitions 0/161 dead transitions. [2024-06-14 14:36:17,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 161 transitions, 1721 flow [2024-06-14 14:36:17,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:36:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:36:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-14 14:36:17,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-14 14:36:17,722 INFO L175 Difference]: Start difference. First operand has 154 places, 130 transitions, 1073 flow. Second operand 10 states and 137 transitions. [2024-06-14 14:36:17,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 161 transitions, 1721 flow [2024-06-14 14:36:17,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 161 transitions, 1630 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 14:36:17,811 INFO L231 Difference]: Finished difference. Result has 156 places, 134 transitions, 1161 flow [2024-06-14 14:36:17,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1161, PETRI_PLACES=156, PETRI_TRANSITIONS=134} [2024-06-14 14:36:17,812 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 124 predicate places. [2024-06-14 14:36:17,812 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 134 transitions, 1161 flow [2024-06-14 14:36:17,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:17,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:17,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:17,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 14:36:17,812 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-14 14:36:17,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:17,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1870587909, now seen corresponding path program 5 times [2024-06-14 14:36:17,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:17,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749065264] [2024-06-14 14:36:17,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:17,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:25,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:25,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749065264] [2024-06-14 14:36:25,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749065264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:25,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:25,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:36:25,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639046617] [2024-06-14 14:36:25,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:25,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:36:25,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:25,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:36:25,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:36:25,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:36:25,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 134 transitions, 1161 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:25,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:25,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:36:25,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:25,850 INFO L124 PetriNetUnfolderBase]: 483/836 cut-off events. [2024-06-14 14:36:25,850 INFO L125 PetriNetUnfolderBase]: For 53759/53759 co-relation queries the response was YES. [2024-06-14 14:36:25,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5485 conditions, 836 events. 483/836 cut-off events. For 53759/53759 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3687 event pairs, 62 based on Foata normal form. 3/838 useless extension candidates. Maximal degree in co-relation 5406. Up to 407 conditions per place. [2024-06-14 14:36:25,856 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 102 selfloop transitions, 61 changer transitions 0/165 dead transitions. [2024-06-14 14:36:25,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 165 transitions, 1805 flow [2024-06-14 14:36:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:36:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:36:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-14 14:36:25,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 14:36:25,858 INFO L175 Difference]: Start difference. First operand has 156 places, 134 transitions, 1161 flow. Second operand 10 states and 140 transitions. [2024-06-14 14:36:25,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 165 transitions, 1805 flow [2024-06-14 14:36:25,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 165 transitions, 1706 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-14 14:36:25,958 INFO L231 Difference]: Finished difference. Result has 160 places, 136 transitions, 1219 flow [2024-06-14 14:36:25,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1219, PETRI_PLACES=160, PETRI_TRANSITIONS=136} [2024-06-14 14:36:25,959 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 128 predicate places. [2024-06-14 14:36:25,959 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 136 transitions, 1219 flow [2024-06-14 14:36:25,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:25,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:25,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:25,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 14:36:25,960 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-14 14:36:25,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:25,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1054747667, now seen corresponding path program 6 times [2024-06-14 14:36:25,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:25,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511672435] [2024-06-14 14:36:25,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:25,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:33,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:33,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511672435] [2024-06-14 14:36:33,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511672435] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:33,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:33,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:36:33,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183209339] [2024-06-14 14:36:33,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:33,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:36:33,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:33,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:36:33,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:36:33,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:36:33,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 136 transitions, 1219 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:33,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:33,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:36:33,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:33,823 INFO L124 PetriNetUnfolderBase]: 477/827 cut-off events. [2024-06-14 14:36:33,824 INFO L125 PetriNetUnfolderBase]: For 51781/51781 co-relation queries the response was YES. [2024-06-14 14:36:33,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5326 conditions, 827 events. 477/827 cut-off events. For 51781/51781 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3652 event pairs, 64 based on Foata normal form. 3/829 useless extension candidates. Maximal degree in co-relation 5246. Up to 403 conditions per place. [2024-06-14 14:36:33,831 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 102 selfloop transitions, 60 changer transitions 0/164 dead transitions. [2024-06-14 14:36:33,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 1727 flow [2024-06-14 14:36:33,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:36:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:36:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-14 14:36:33,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 14:36:33,832 INFO L175 Difference]: Start difference. First operand has 160 places, 136 transitions, 1219 flow. Second operand 10 states and 140 transitions. [2024-06-14 14:36:33,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 1727 flow [2024-06-14 14:36:33,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 164 transitions, 1585 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 14:36:33,923 INFO L231 Difference]: Finished difference. Result has 163 places, 136 transitions, 1202 flow [2024-06-14 14:36:33,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1202, PETRI_PLACES=163, PETRI_TRANSITIONS=136} [2024-06-14 14:36:33,924 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-14 14:36:33,924 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 136 transitions, 1202 flow [2024-06-14 14:36:33,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:33,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:33,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:33,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 14:36:33,925 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-14 14:36:33,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1982671877, now seen corresponding path program 7 times [2024-06-14 14:36:33,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:33,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897301714] [2024-06-14 14:36:33,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:33,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:41,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-14 14:36:41,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:41,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897301714] [2024-06-14 14:36:41,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897301714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:41,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:41,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:36:41,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718041397] [2024-06-14 14:36:41,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:41,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:36:41,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:41,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:36:41,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:36:41,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:36:41,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 136 transitions, 1202 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:41,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:41,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:36:41,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:41,914 INFO L124 PetriNetUnfolderBase]: 501/866 cut-off events. [2024-06-14 14:36:41,914 INFO L125 PetriNetUnfolderBase]: For 58237/58237 co-relation queries the response was YES. [2024-06-14 14:36:41,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5692 conditions, 866 events. 501/866 cut-off events. For 58237/58237 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3852 event pairs, 92 based on Foata normal form. 3/868 useless extension candidates. Maximal degree in co-relation 5611. Up to 423 conditions per place. [2024-06-14 14:36:41,921 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 100 selfloop transitions, 64 changer transitions 0/166 dead transitions. [2024-06-14 14:36:41,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 166 transitions, 1880 flow [2024-06-14 14:36:41,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:36:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:36:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-14 14:36:41,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-14 14:36:41,923 INFO L175 Difference]: Start difference. First operand has 163 places, 136 transitions, 1202 flow. Second operand 10 states and 138 transitions. [2024-06-14 14:36:41,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 166 transitions, 1880 flow [2024-06-14 14:36:42,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 166 transitions, 1726 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-14 14:36:42,021 INFO L231 Difference]: Finished difference. Result has 163 places, 140 transitions, 1245 flow [2024-06-14 14:36:42,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1245, PETRI_PLACES=163, PETRI_TRANSITIONS=140} [2024-06-14 14:36:42,022 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-14 14:36:42,022 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 140 transitions, 1245 flow [2024-06-14 14:36:42,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:42,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:42,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:42,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 14:36:42,023 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-14 14:36:42,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:42,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1982671722, now seen corresponding path program 5 times [2024-06-14 14:36:42,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:42,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181436589] [2024-06-14 14:36:42,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:42,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:50,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:50,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181436589] [2024-06-14 14:36:50,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181436589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:50,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:50,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:36:50,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94774177] [2024-06-14 14:36:50,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:50,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:36:50,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:50,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:36:50,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:36:50,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:36:50,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 140 transitions, 1245 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:50,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:50,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:36:50,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:50,873 INFO L124 PetriNetUnfolderBase]: 504/871 cut-off events. [2024-06-14 14:36:50,873 INFO L125 PetriNetUnfolderBase]: For 57123/57123 co-relation queries the response was YES. [2024-06-14 14:36:50,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 871 events. 504/871 cut-off events. For 57123/57123 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3877 event pairs, 109 based on Foata normal form. 1/871 useless extension candidates. Maximal degree in co-relation 5672. Up to 778 conditions per place. [2024-06-14 14:36:50,879 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 117 selfloop transitions, 35 changer transitions 0/154 dead transitions. [2024-06-14 14:36:50,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 154 transitions, 1609 flow [2024-06-14 14:36:50,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:36:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:36:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 14:36:50,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575757575757576 [2024-06-14 14:36:50,880 INFO L175 Difference]: Start difference. First operand has 163 places, 140 transitions, 1245 flow. Second operand 10 states and 118 transitions. [2024-06-14 14:36:50,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 154 transitions, 1609 flow [2024-06-14 14:36:50,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 154 transitions, 1493 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 14:36:50,988 INFO L231 Difference]: Finished difference. Result has 167 places, 142 transitions, 1238 flow [2024-06-14 14:36:50,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1238, PETRI_PLACES=167, PETRI_TRANSITIONS=142} [2024-06-14 14:36:50,989 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2024-06-14 14:36:50,989 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 142 transitions, 1238 flow [2024-06-14 14:36:50,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:50,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:50,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:50,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 14:36:50,990 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-14 14:36:50,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:50,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1372154513, now seen corresponding path program 8 times [2024-06-14 14:36:50,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:50,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579904115] [2024-06-14 14:36:50,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:50,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:58,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:58,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579904115] [2024-06-14 14:36:58,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579904115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:58,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:58,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:36:58,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77673189] [2024-06-14 14:36:58,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:58,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:36:58,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:58,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:36:58,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:36:58,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:36:58,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 142 transitions, 1238 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:58,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:58,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:36:58,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:59,264 INFO L124 PetriNetUnfolderBase]: 513/886 cut-off events. [2024-06-14 14:36:59,265 INFO L125 PetriNetUnfolderBase]: For 62196/62196 co-relation queries the response was YES. [2024-06-14 14:36:59,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5762 conditions, 886 events. 513/886 cut-off events. For 62196/62196 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3975 event pairs, 92 based on Foata normal form. 3/888 useless extension candidates. Maximal degree in co-relation 5679. Up to 436 conditions per place. [2024-06-14 14:36:59,271 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 104 selfloop transitions, 64 changer transitions 0/170 dead transitions. [2024-06-14 14:36:59,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 170 transitions, 1896 flow [2024-06-14 14:36:59,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:36:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:36:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-14 14:36:59,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2024-06-14 14:36:59,273 INFO L175 Difference]: Start difference. First operand has 167 places, 142 transitions, 1238 flow. Second operand 10 states and 139 transitions. [2024-06-14 14:36:59,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 170 transitions, 1896 flow [2024-06-14 14:36:59,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 170 transitions, 1803 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 14:36:59,378 INFO L231 Difference]: Finished difference. Result has 169 places, 144 transitions, 1306 flow [2024-06-14 14:36:59,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1306, PETRI_PLACES=169, PETRI_TRANSITIONS=144} [2024-06-14 14:36:59,378 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 137 predicate places. [2024-06-14 14:36:59,378 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 144 transitions, 1306 flow [2024-06-14 14:36:59,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:59,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:59,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:59,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 14:36:59,379 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-14 14:36:59,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:59,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1371952703, now seen corresponding path program 9 times [2024-06-14 14:36:59,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:59,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300788565] [2024-06-14 14:36:59,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:59,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:07,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:07,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300788565] [2024-06-14 14:37:07,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300788565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:07,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:07,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:37:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426617270] [2024-06-14 14:37:07,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:07,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:37:07,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:07,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:37:07,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:37:07,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:37:07,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 144 transitions, 1306 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:07,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:07,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:37:07,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:07,637 INFO L124 PetriNetUnfolderBase]: 522/901 cut-off events. [2024-06-14 14:37:07,637 INFO L125 PetriNetUnfolderBase]: For 64831/64831 co-relation queries the response was YES. [2024-06-14 14:37:07,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5985 conditions, 901 events. 522/901 cut-off events. For 64831/64831 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4038 event pairs, 96 based on Foata normal form. 3/903 useless extension candidates. Maximal degree in co-relation 5901. Up to 444 conditions per place. [2024-06-14 14:37:07,644 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 105 selfloop transitions, 65 changer transitions 0/172 dead transitions. [2024-06-14 14:37:07,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 172 transitions, 1976 flow [2024-06-14 14:37:07,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:37:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:37:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-14 14:37:07,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 14:37:07,645 INFO L175 Difference]: Start difference. First operand has 169 places, 144 transitions, 1306 flow. Second operand 10 states and 140 transitions. [2024-06-14 14:37:07,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 172 transitions, 1976 flow [2024-06-14 14:37:07,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 172 transitions, 1843 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 14:37:07,765 INFO L231 Difference]: Finished difference. Result has 172 places, 146 transitions, 1340 flow [2024-06-14 14:37:07,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1340, PETRI_PLACES=172, PETRI_TRANSITIONS=146} [2024-06-14 14:37:07,765 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 140 predicate places. [2024-06-14 14:37:07,765 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 146 transitions, 1340 flow [2024-06-14 14:37:07,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:07,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:07,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:07,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 14:37:07,766 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-14 14:37:07,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:07,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1364525816, now seen corresponding path program 1 times [2024-06-14 14:37:07,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:07,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293217215] [2024-06-14 14:37:07,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:07,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:15,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:15,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293217215] [2024-06-14 14:37:15,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293217215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:15,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:15,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:37:15,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114113715] [2024-06-14 14:37:15,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:15,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:37:15,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:15,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:37:15,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:37:15,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:37:15,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 146 transitions, 1340 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-14 14:37:15,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:15,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:37:15,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:16,410 INFO L124 PetriNetUnfolderBase]: 471/836 cut-off events. [2024-06-14 14:37:16,410 INFO L125 PetriNetUnfolderBase]: For 68606/68615 co-relation queries the response was YES. [2024-06-14 14:37:16,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5756 conditions, 836 events. 471/836 cut-off events. For 68606/68615 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3896 event pairs, 74 based on Foata normal form. 5/828 useless extension candidates. Maximal degree in co-relation 5671. Up to 736 conditions per place. [2024-06-14 14:37:16,417 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 129 selfloop transitions, 21 changer transitions 0/164 dead transitions. [2024-06-14 14:37:16,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 164 transitions, 1702 flow [2024-06-14 14:37:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:37:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:37:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 14:37:16,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39057239057239057 [2024-06-14 14:37:16,420 INFO L175 Difference]: Start difference. First operand has 172 places, 146 transitions, 1340 flow. Second operand 9 states and 116 transitions. [2024-06-14 14:37:16,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 164 transitions, 1702 flow [2024-06-14 14:37:16,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 164 transitions, 1568 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 14:37:16,530 INFO L231 Difference]: Finished difference. Result has 175 places, 149 transitions, 1283 flow [2024-06-14 14:37:16,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1283, PETRI_PLACES=175, PETRI_TRANSITIONS=149} [2024-06-14 14:37:16,531 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 143 predicate places. [2024-06-14 14:37:16,531 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 149 transitions, 1283 flow [2024-06-14 14:37:16,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:16,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:16,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:16,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 14:37:16,532 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-14 14:37:16,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1364802863, now seen corresponding path program 10 times [2024-06-14 14:37:16,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:16,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567119777] [2024-06-14 14:37:16,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:16,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:24,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:24,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567119777] [2024-06-14 14:37:24,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567119777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:24,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:24,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:37:24,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177381464] [2024-06-14 14:37:24,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:24,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:37:24,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:24,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:37:24,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:37:24,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:37:24,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 149 transitions, 1283 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:24,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:24,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:37:24,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:24,658 INFO L124 PetriNetUnfolderBase]: 520/900 cut-off events. [2024-06-14 14:37:24,658 INFO L125 PetriNetUnfolderBase]: For 63855/63855 co-relation queries the response was YES. [2024-06-14 14:37:24,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5790 conditions, 900 events. 520/900 cut-off events. For 63855/63855 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4081 event pairs, 104 based on Foata normal form. 3/902 useless extension candidates. Maximal degree in co-relation 5703. Up to 448 conditions per place. [2024-06-14 14:37:24,666 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 98 selfloop transitions, 72 changer transitions 0/172 dead transitions. [2024-06-14 14:37:24,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 172 transitions, 1813 flow [2024-06-14 14:37:24,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:37:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:37:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-14 14:37:24,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-14 14:37:24,667 INFO L175 Difference]: Start difference. First operand has 175 places, 149 transitions, 1283 flow. Second operand 10 states and 134 transitions. [2024-06-14 14:37:24,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 172 transitions, 1813 flow [2024-06-14 14:37:24,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 172 transitions, 1751 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 14:37:24,776 INFO L231 Difference]: Finished difference. Result has 179 places, 149 transitions, 1370 flow [2024-06-14 14:37:24,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1370, PETRI_PLACES=179, PETRI_TRANSITIONS=149} [2024-06-14 14:37:24,779 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 147 predicate places. [2024-06-14 14:37:24,779 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 149 transitions, 1370 flow [2024-06-14 14:37:24,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:24,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:24,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:24,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 14:37:24,779 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-14 14:37:24,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash 574223831, now seen corresponding path program 11 times [2024-06-14 14:37:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:24,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104212432] [2024-06-14 14:37:24,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:24,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:32,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:32,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104212432] [2024-06-14 14:37:32,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104212432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:32,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:32,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:37:32,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36352216] [2024-06-14 14:37:32,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:32,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:37:32,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:32,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:37:32,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:37:32,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:37:32,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 149 transitions, 1370 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:32,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:32,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:37:32,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:33,011 INFO L124 PetriNetUnfolderBase]: 544/939 cut-off events. [2024-06-14 14:37:33,012 INFO L125 PetriNetUnfolderBase]: For 72070/72070 co-relation queries the response was YES. [2024-06-14 14:37:33,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6333 conditions, 939 events. 544/939 cut-off events. For 72070/72070 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4306 event pairs, 86 based on Foata normal form. 3/941 useless extension candidates. Maximal degree in co-relation 6245. Up to 754 conditions per place. [2024-06-14 14:37:33,019 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 138 selfloop transitions, 34 changer transitions 0/174 dead transitions. [2024-06-14 14:37:33,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 174 transitions, 2086 flow [2024-06-14 14:37:33,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:37:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:37:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 14:37:33,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-14 14:37:33,021 INFO L175 Difference]: Start difference. First operand has 179 places, 149 transitions, 1370 flow. Second operand 10 states and 125 transitions. [2024-06-14 14:37:33,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 174 transitions, 2086 flow [2024-06-14 14:37:33,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 174 transitions, 1900 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-14 14:37:33,146 INFO L231 Difference]: Finished difference. Result has 178 places, 153 transitions, 1325 flow [2024-06-14 14:37:33,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1325, PETRI_PLACES=178, PETRI_TRANSITIONS=153} [2024-06-14 14:37:33,147 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 146 predicate places. [2024-06-14 14:37:33,147 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 153 transitions, 1325 flow [2024-06-14 14:37:33,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:33,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:33,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:33,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 14:37:33,148 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-14 14:37:33,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash -621083951, now seen corresponding path program 12 times [2024-06-14 14:37:33,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:33,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316802496] [2024-06-14 14:37:33,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:40,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:40,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316802496] [2024-06-14 14:37:40,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316802496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:40,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:40,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:37:40,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533259183] [2024-06-14 14:37:40,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:40,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:37:40,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:40,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:37:40,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:37:40,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:37:40,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 153 transitions, 1325 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:40,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:40,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:37:40,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:41,271 INFO L124 PetriNetUnfolderBase]: 568/978 cut-off events. [2024-06-14 14:37:41,271 INFO L125 PetriNetUnfolderBase]: For 80057/80057 co-relation queries the response was YES. [2024-06-14 14:37:41,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6619 conditions, 978 events. 568/978 cut-off events. For 80057/80057 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4523 event pairs, 114 based on Foata normal form. 3/980 useless extension candidates. Maximal degree in co-relation 6530. Up to 774 conditions per place. [2024-06-14 14:37:41,277 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 141 selfloop transitions, 35 changer transitions 0/178 dead transitions. [2024-06-14 14:37:41,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 178 transitions, 2053 flow [2024-06-14 14:37:41,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:37:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:37:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 14:37:41,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38484848484848483 [2024-06-14 14:37:41,278 INFO L175 Difference]: Start difference. First operand has 178 places, 153 transitions, 1325 flow. Second operand 10 states and 127 transitions. [2024-06-14 14:37:41,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 178 transitions, 2053 flow [2024-06-14 14:37:41,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 178 transitions, 1861 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 14:37:41,431 INFO L231 Difference]: Finished difference. Result has 179 places, 157 transitions, 1276 flow [2024-06-14 14:37:41,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1276, PETRI_PLACES=179, PETRI_TRANSITIONS=157} [2024-06-14 14:37:41,432 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 147 predicate places. [2024-06-14 14:37:41,432 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 157 transitions, 1276 flow [2024-06-14 14:37:41,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:41,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:41,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:41,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 14:37:41,433 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-14 14:37:41,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:41,434 INFO L85 PathProgramCache]: Analyzing trace with hash -620806904, now seen corresponding path program 2 times [2024-06-14 14:37:41,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:41,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155888713] [2024-06-14 14:37:41,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:41,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:49,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:49,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155888713] [2024-06-14 14:37:49,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155888713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:49,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:49,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:37:49,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103671375] [2024-06-14 14:37:49,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:49,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:37:49,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:49,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:37:49,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:37:49,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:37:49,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 157 transitions, 1276 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:49,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:49,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:37:49,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:50,458 INFO L124 PetriNetUnfolderBase]: 520/914 cut-off events. [2024-06-14 14:37:50,458 INFO L125 PetriNetUnfolderBase]: For 85050/85060 co-relation queries the response was YES. [2024-06-14 14:37:50,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6311 conditions, 914 events. 520/914 cut-off events. For 85050/85060 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4353 event pairs, 83 based on Foata normal form. 6/904 useless extension candidates. Maximal degree in co-relation 6221. Up to 830 conditions per place. [2024-06-14 14:37:50,466 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 142 selfloop transitions, 20 changer transitions 0/176 dead transitions. [2024-06-14 14:37:50,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 176 transitions, 1675 flow [2024-06-14 14:37:50,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:37:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:37:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 14:37:50,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3771043771043771 [2024-06-14 14:37:50,467 INFO L175 Difference]: Start difference. First operand has 179 places, 157 transitions, 1276 flow. Second operand 9 states and 112 transitions. [2024-06-14 14:37:50,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 176 transitions, 1675 flow [2024-06-14 14:37:50,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 176 transitions, 1614 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 14:37:50,626 INFO L231 Difference]: Finished difference. Result has 185 places, 164 transitions, 1333 flow [2024-06-14 14:37:50,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1333, PETRI_PLACES=185, PETRI_TRANSITIONS=164} [2024-06-14 14:37:50,627 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 153 predicate places. [2024-06-14 14:37:50,627 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 164 transitions, 1333 flow [2024-06-14 14:37:50,627 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-14 14:37:50,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:50,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:50,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 14:37:50,628 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-14 14:37:50,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1158212041, now seen corresponding path program 13 times [2024-06-14 14:37:50,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:50,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144570292] [2024-06-14 14:37:50,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:50,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144570292] [2024-06-14 14:37:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144570292] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:58,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:58,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:37:58,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133440573] [2024-06-14 14:37:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:58,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:37:58,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:58,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:37:58,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:37:58,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:37:58,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 164 transitions, 1333 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:58,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:58,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:37:58,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:58,674 INFO L124 PetriNetUnfolderBase]: 569/982 cut-off events. [2024-06-14 14:37:58,674 INFO L125 PetriNetUnfolderBase]: For 78554/78554 co-relation queries the response was YES. [2024-06-14 14:37:58,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6542 conditions, 982 events. 569/982 cut-off events. For 78554/78554 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4570 event pairs, 88 based on Foata normal form. 3/984 useless extension candidates. Maximal degree in co-relation 6448. Up to 783 conditions per place. [2024-06-14 14:37:58,681 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 146 selfloop transitions, 37 changer transitions 0/185 dead transitions. [2024-06-14 14:37:58,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 185 transitions, 2035 flow [2024-06-14 14:37:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:37:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:37:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 14:37:58,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2024-06-14 14:37:58,683 INFO L175 Difference]: Start difference. First operand has 185 places, 164 transitions, 1333 flow. Second operand 10 states and 126 transitions. [2024-06-14 14:37:58,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 185 transitions, 2035 flow [2024-06-14 14:37:58,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 185 transitions, 1999 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 14:37:58,836 INFO L231 Difference]: Finished difference. Result has 191 places, 164 transitions, 1376 flow [2024-06-14 14:37:58,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1376, PETRI_PLACES=191, PETRI_TRANSITIONS=164} [2024-06-14 14:37:58,836 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 159 predicate places. [2024-06-14 14:37:58,836 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 164 transitions, 1376 flow [2024-06-14 14:37:58,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:58,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:58,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:58,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 14:37:58,837 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-14 14:37:58,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:58,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1398919163, now seen corresponding path program 14 times [2024-06-14 14:37:58,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:58,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621395392] [2024-06-14 14:37:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:58,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:06,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:06,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621395392] [2024-06-14 14:38:06,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621395392] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:06,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:06,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:38:06,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185241763] [2024-06-14 14:38:06,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:06,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:38:06,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:06,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:38:06,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:38:06,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:38:06,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 164 transitions, 1376 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:06,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:06,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:38:06,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:07,094 INFO L124 PetriNetUnfolderBase]: 563/973 cut-off events. [2024-06-14 14:38:07,095 INFO L125 PetriNetUnfolderBase]: For 75081/75081 co-relation queries the response was YES. [2024-06-14 14:38:07,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6405 conditions, 973 events. 563/973 cut-off events. For 75081/75081 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4518 event pairs, 82 based on Foata normal form. 3/975 useless extension candidates. Maximal degree in co-relation 6310. Up to 779 conditions per place. [2024-06-14 14:38:07,103 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 140 selfloop transitions, 42 changer transitions 0/184 dead transitions. [2024-06-14 14:38:07,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 184 transitions, 1950 flow [2024-06-14 14:38:07,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:38:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:38:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 14:38:07,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-06-14 14:38:07,105 INFO L175 Difference]: Start difference. First operand has 191 places, 164 transitions, 1376 flow. Second operand 10 states and 123 transitions. [2024-06-14 14:38:07,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 184 transitions, 1950 flow [2024-06-14 14:38:07,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 184 transitions, 1849 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 14:38:07,258 INFO L231 Difference]: Finished difference. Result has 193 places, 164 transitions, 1364 flow [2024-06-14 14:38:07,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1364, PETRI_PLACES=193, PETRI_TRANSITIONS=164} [2024-06-14 14:38:07,258 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 161 predicate places. [2024-06-14 14:38:07,259 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 164 transitions, 1364 flow [2024-06-14 14:38:07,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:07,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:07,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:07,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 14:38:07,259 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-14 14:38:07,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash -628441336, now seen corresponding path program 6 times [2024-06-14 14:38:07,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:07,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132658470] [2024-06-14 14:38:07,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:07,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:15,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:15,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132658470] [2024-06-14 14:38:15,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132658470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:15,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:15,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:38:15,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662591156] [2024-06-14 14:38:15,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:15,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:38:15,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:15,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:38:15,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:38:15,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:38:15,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 164 transitions, 1364 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:15,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:15,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:38:15,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:15,601 INFO L124 PetriNetUnfolderBase]: 561/970 cut-off events. [2024-06-14 14:38:15,601 INFO L125 PetriNetUnfolderBase]: For 70801/70801 co-relation queries the response was YES. [2024-06-14 14:38:15,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6349 conditions, 970 events. 561/970 cut-off events. For 70801/70801 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4488 event pairs, 114 based on Foata normal form. 1/970 useless extension candidates. Maximal degree in co-relation 6253. Up to 943 conditions per place. [2024-06-14 14:38:15,609 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 156 selfloop transitions, 17 changer transitions 0/175 dead transitions. [2024-06-14 14:38:15,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 175 transitions, 1764 flow [2024-06-14 14:38:15,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:38:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:38:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 14:38:15,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3242424242424242 [2024-06-14 14:38:15,610 INFO L175 Difference]: Start difference. First operand has 193 places, 164 transitions, 1364 flow. Second operand 10 states and 107 transitions. [2024-06-14 14:38:15,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 175 transitions, 1764 flow [2024-06-14 14:38:15,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 175 transitions, 1688 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 14:38:15,795 INFO L231 Difference]: Finished difference. Result has 195 places, 166 transitions, 1365 flow [2024-06-14 14:38:15,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1365, PETRI_PLACES=195, PETRI_TRANSITIONS=166} [2024-06-14 14:38:15,795 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 163 predicate places. [2024-06-14 14:38:15,795 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 166 transitions, 1365 flow [2024-06-14 14:38:15,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:15,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:15,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:15,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 14:38:15,796 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-14 14:38:15,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash -372922573, now seen corresponding path program 15 times [2024-06-14 14:38:15,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:15,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701318874] [2024-06-14 14:38:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:15,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:23,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:23,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701318874] [2024-06-14 14:38:23,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701318874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:23,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:23,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:38:23,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707557115] [2024-06-14 14:38:23,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:23,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:38:23,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:23,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:38:23,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:38:23,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:38:23,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 166 transitions, 1365 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:23,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:23,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:38:23,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:23,607 INFO L124 PetriNetUnfolderBase]: 555/961 cut-off events. [2024-06-14 14:38:23,607 INFO L125 PetriNetUnfolderBase]: For 70592/70592 co-relation queries the response was YES. [2024-06-14 14:38:23,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6078 conditions, 961 events. 555/961 cut-off events. For 70592/70592 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4457 event pairs, 102 based on Foata normal form. 3/963 useless extension candidates. Maximal degree in co-relation 5981. Up to 898 conditions per place. [2024-06-14 14:38:23,615 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 164 selfloop transitions, 17 changer transitions 0/183 dead transitions. [2024-06-14 14:38:23,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 183 transitions, 1795 flow [2024-06-14 14:38:23,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:38:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:38:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 14:38:23,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-06-14 14:38:23,617 INFO L175 Difference]: Start difference. First operand has 195 places, 166 transitions, 1365 flow. Second operand 10 states and 115 transitions. [2024-06-14 14:38:23,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 183 transitions, 1795 flow [2024-06-14 14:38:23,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 183 transitions, 1720 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-14 14:38:23,761 INFO L231 Difference]: Finished difference. Result has 197 places, 166 transitions, 1329 flow [2024-06-14 14:38:23,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1329, PETRI_PLACES=197, PETRI_TRANSITIONS=166} [2024-06-14 14:38:23,762 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 165 predicate places. [2024-06-14 14:38:23,762 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 166 transitions, 1329 flow [2024-06-14 14:38:23,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:23,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:23,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:23,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 14:38:23,763 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-14 14:38:23,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash -371456234, now seen corresponding path program 3 times [2024-06-14 14:38:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930991462] [2024-06-14 14:38:23,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:23,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:32,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:32,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930991462] [2024-06-14 14:38:32,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930991462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:32,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:32,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:38:32,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821525341] [2024-06-14 14:38:32,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:32,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:38:32,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:32,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:38:32,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:38:32,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:38:32,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 166 transitions, 1329 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-14 14:38:32,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:32,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:38:32,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:32,996 INFO L124 PetriNetUnfolderBase]: 504/888 cut-off events. [2024-06-14 14:38:32,997 INFO L125 PetriNetUnfolderBase]: For 79173/79182 co-relation queries the response was YES. [2024-06-14 14:38:33,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5776 conditions, 888 events. 504/888 cut-off events. For 79173/79182 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4230 event pairs, 82 based on Foata normal form. 9/883 useless extension candidates. Maximal degree in co-relation 5678. Up to 820 conditions per place. [2024-06-14 14:38:33,011 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 149 selfloop transitions, 17 changer transitions 0/180 dead transitions. [2024-06-14 14:38:33,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 180 transitions, 1723 flow [2024-06-14 14:38:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:38:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:38:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 14:38:33,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2024-06-14 14:38:33,014 INFO L175 Difference]: Start difference. First operand has 197 places, 166 transitions, 1329 flow. Second operand 9 states and 110 transitions. [2024-06-14 14:38:33,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 180 transitions, 1723 flow [2024-06-14 14:38:33,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 180 transitions, 1628 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-14 14:38:33,170 INFO L231 Difference]: Finished difference. Result has 195 places, 169 transitions, 1316 flow [2024-06-14 14:38:33,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1316, PETRI_PLACES=195, PETRI_TRANSITIONS=169} [2024-06-14 14:38:33,170 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 163 predicate places. [2024-06-14 14:38:33,170 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 169 transitions, 1316 flow [2024-06-14 14:38:33,171 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-14 14:38:33,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:33,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:33,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 14:38:33,171 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-14 14:38:33,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:33,171 INFO L85 PathProgramCache]: Analyzing trace with hash -58946296, now seen corresponding path program 4 times [2024-06-14 14:38:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:33,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082352522] [2024-06-14 14:38:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:41,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:41,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082352522] [2024-06-14 14:38:41,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082352522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:41,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:41,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:38:41,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717454307] [2024-06-14 14:38:41,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:41,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:38:41,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:41,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:38:41,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:38:41,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:38:41,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 169 transitions, 1316 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-14 14:38:41,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:41,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:38:41,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:41,923 INFO L124 PetriNetUnfolderBase]: 508/896 cut-off events. [2024-06-14 14:38:41,923 INFO L125 PetriNetUnfolderBase]: For 80445/80453 co-relation queries the response was YES. [2024-06-14 14:38:41,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5872 conditions, 896 events. 508/896 cut-off events. For 80445/80453 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4281 event pairs, 84 based on Foata normal form. 8/888 useless extension candidates. Maximal degree in co-relation 5772. Up to 829 conditions per place. [2024-06-14 14:38:41,932 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 149 selfloop transitions, 17 changer transitions 0/180 dead transitions. [2024-06-14 14:38:41,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 180 transitions, 1688 flow [2024-06-14 14:38:41,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:38:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:38:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-14 14:38:41,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 14:38:41,934 INFO L175 Difference]: Start difference. First operand has 195 places, 169 transitions, 1316 flow. Second operand 9 states and 108 transitions. [2024-06-14 14:38:41,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 180 transitions, 1688 flow [2024-06-14 14:38:42,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 180 transitions, 1636 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-14 14:38:42,089 INFO L231 Difference]: Finished difference. Result has 198 places, 170 transitions, 1321 flow [2024-06-14 14:38:42,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1321, PETRI_PLACES=198, PETRI_TRANSITIONS=170} [2024-06-14 14:38:42,090 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 166 predicate places. [2024-06-14 14:38:42,090 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 170 transitions, 1321 flow [2024-06-14 14:38:42,090 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-14 14:38:42,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:42,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:42,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 14:38:42,091 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-14 14:38:42,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:42,091 INFO L85 PathProgramCache]: Analyzing trace with hash -588934466, now seen corresponding path program 1 times [2024-06-14 14:38:42,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:42,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640995324] [2024-06-14 14:38:42,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:42,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:49,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:49,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640995324] [2024-06-14 14:38:49,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640995324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:49,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:49,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:38:49,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811937727] [2024-06-14 14:38:49,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:49,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:38:49,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:49,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:38:49,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:38:49,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:38:49,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 170 transitions, 1321 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:49,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:49,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:38:49,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:50,050 INFO L124 PetriNetUnfolderBase]: 559/971 cut-off events. [2024-06-14 14:38:50,050 INFO L125 PetriNetUnfolderBase]: For 69948/69948 co-relation queries the response was YES. [2024-06-14 14:38:50,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6057 conditions, 971 events. 559/971 cut-off events. For 69948/69948 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4530 event pairs, 100 based on Foata normal form. 2/972 useless extension candidates. Maximal degree in co-relation 5956. Up to 923 conditions per place. [2024-06-14 14:38:50,058 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 162 selfloop transitions, 20 changer transitions 0/184 dead transitions. [2024-06-14 14:38:50,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 184 transitions, 1741 flow [2024-06-14 14:38:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:38:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:38:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-14 14:38:50,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33636363636363636 [2024-06-14 14:38:50,060 INFO L175 Difference]: Start difference. First operand has 198 places, 170 transitions, 1321 flow. Second operand 10 states and 111 transitions. [2024-06-14 14:38:50,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 184 transitions, 1741 flow [2024-06-14 14:38:50,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 184 transitions, 1696 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 14:38:50,212 INFO L231 Difference]: Finished difference. Result has 201 places, 172 transitions, 1349 flow [2024-06-14 14:38:50,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1349, PETRI_PLACES=201, PETRI_TRANSITIONS=172} [2024-06-14 14:38:50,213 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 169 predicate places. [2024-06-14 14:38:50,213 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 172 transitions, 1349 flow [2024-06-14 14:38:50,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:50,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:50,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:50,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 14:38:50,214 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-14 14:38:50,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:50,214 INFO L85 PathProgramCache]: Analyzing trace with hash -577496706, now seen corresponding path program 5 times [2024-06-14 14:38:50,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:50,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073865096] [2024-06-14 14:38:50,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:50,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073865096] [2024-06-14 14:38:58,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073865096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:58,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:58,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:38:58,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903840853] [2024-06-14 14:38:58,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:58,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:38:58,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:58,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:38:58,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:38:58,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:38:58,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 172 transitions, 1349 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-14 14:38:58,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:58,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:38:58,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:58,663 INFO L124 PetriNetUnfolderBase]: 501/891 cut-off events. [2024-06-14 14:38:58,663 INFO L125 PetriNetUnfolderBase]: For 74249/74254 co-relation queries the response was YES. [2024-06-14 14:38:58,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5609 conditions, 891 events. 501/891 cut-off events. For 74249/74254 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4281 event pairs, 80 based on Foata normal form. 7/887 useless extension candidates. Maximal degree in co-relation 5507. Up to 821 conditions per place. [2024-06-14 14:38:58,671 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 154 selfloop transitions, 14 changer transitions 0/182 dead transitions. [2024-06-14 14:38:58,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 182 transitions, 1707 flow [2024-06-14 14:38:58,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:38:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:38:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 14:38:58,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3569023569023569 [2024-06-14 14:38:58,674 INFO L175 Difference]: Start difference. First operand has 201 places, 172 transitions, 1349 flow. Second operand 9 states and 106 transitions. [2024-06-14 14:38:58,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 182 transitions, 1707 flow [2024-06-14 14:38:58,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 182 transitions, 1650 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 14:38:58,819 INFO L231 Difference]: Finished difference. Result has 202 places, 172 transitions, 1324 flow [2024-06-14 14:38:58,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1324, PETRI_PLACES=202, PETRI_TRANSITIONS=172} [2024-06-14 14:38:58,819 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 170 predicate places. [2024-06-14 14:38:58,819 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 172 transitions, 1324 flow [2024-06-14 14:38:58,820 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-14 14:38:58,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:58,820 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-14 14:38:58,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 14:38:58,820 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-14 14:38:58,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:58,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1946524688, now seen corresponding path program 1 times [2024-06-14 14:38:58,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:58,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949152462] [2024-06-14 14:38:58,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:58,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:07,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:07,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:07,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949152462] [2024-06-14 14:39:07,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949152462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:07,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:07,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:39:07,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960364891] [2024-06-14 14:39:07,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:07,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:39:07,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:07,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:39:07,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:39:08,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:39:08,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 172 transitions, 1324 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:08,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:08,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:39:08,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:08,754 INFO L124 PetriNetUnfolderBase]: 567/987 cut-off events. [2024-06-14 14:39:08,754 INFO L125 PetriNetUnfolderBase]: For 74176/74176 co-relation queries the response was YES. [2024-06-14 14:39:08,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6217 conditions, 987 events. 567/987 cut-off events. For 74176/74176 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4639 event pairs, 88 based on Foata normal form. 2/988 useless extension candidates. Maximal degree in co-relation 6114. Up to 887 conditions per place. [2024-06-14 14:39:08,763 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 178 selfloop transitions, 23 changer transitions 0/203 dead transitions. [2024-06-14 14:39:08,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 203 transitions, 1996 flow [2024-06-14 14:39:08,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:39:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:39:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2024-06-14 14:39:08,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35858585858585856 [2024-06-14 14:39:08,764 INFO L175 Difference]: Start difference. First operand has 202 places, 172 transitions, 1324 flow. Second operand 12 states and 142 transitions. [2024-06-14 14:39:08,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 203 transitions, 1996 flow [2024-06-14 14:39:08,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 203 transitions, 1931 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 14:39:08,931 INFO L231 Difference]: Finished difference. Result has 206 places, 174 transitions, 1359 flow [2024-06-14 14:39:08,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1359, PETRI_PLACES=206, PETRI_TRANSITIONS=174} [2024-06-14 14:39:08,932 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 174 predicate places. [2024-06-14 14:39:08,932 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 174 transitions, 1359 flow [2024-06-14 14:39:08,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:08,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:08,932 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-14 14:39:08,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 14:39:08,932 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-14 14:39:08,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:08,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1869919764, now seen corresponding path program 2 times [2024-06-14 14:39:08,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:08,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107342136] [2024-06-14 14:39:08,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:08,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:17,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:17,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107342136] [2024-06-14 14:39:17,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107342136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:17,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:17,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:39:17,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034538302] [2024-06-14 14:39:17,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:17,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:39:17,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:17,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:39:17,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:39:17,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:39:17,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 174 transitions, 1359 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:17,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:17,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:39:17,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:18,607 INFO L124 PetriNetUnfolderBase]: 571/995 cut-off events. [2024-06-14 14:39:18,607 INFO L125 PetriNetUnfolderBase]: For 76377/76377 co-relation queries the response was YES. [2024-06-14 14:39:18,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6311 conditions, 995 events. 571/995 cut-off events. For 76377/76377 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4714 event pairs, 105 based on Foata normal form. 2/996 useless extension candidates. Maximal degree in co-relation 6207. Up to 926 conditions per place. [2024-06-14 14:39:18,614 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 178 selfloop transitions, 22 changer transitions 0/202 dead transitions. [2024-06-14 14:39:18,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 202 transitions, 1861 flow [2024-06-14 14:39:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:39:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:39:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-14 14:39:18,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2024-06-14 14:39:18,616 INFO L175 Difference]: Start difference. First operand has 206 places, 174 transitions, 1359 flow. Second operand 12 states and 141 transitions. [2024-06-14 14:39:18,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 202 transitions, 1861 flow [2024-06-14 14:39:18,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 202 transitions, 1765 flow, removed 23 selfloop flow, removed 10 redundant places. [2024-06-14 14:39:18,771 INFO L231 Difference]: Finished difference. Result has 208 places, 175 transitions, 1339 flow [2024-06-14 14:39:18,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1273, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1339, PETRI_PLACES=208, PETRI_TRANSITIONS=175} [2024-06-14 14:39:18,772 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-14 14:39:18,772 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 175 transitions, 1339 flow [2024-06-14 14:39:18,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:18,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:18,773 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-14 14:39:18,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 14:39:18,773 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-14 14:39:18,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:18,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1869919888, now seen corresponding path program 1 times [2024-06-14 14:39:18,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:18,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350517352] [2024-06-14 14:39:18,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:28,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:28,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350517352] [2024-06-14 14:39:28,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350517352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:28,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:28,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:39:28,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091162055] [2024-06-14 14:39:28,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:28,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:39:28,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:28,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:39:28,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:39:28,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:39:28,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 175 transitions, 1339 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:28,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:28,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:39:28,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:28,915 INFO L124 PetriNetUnfolderBase]: 589/1024 cut-off events. [2024-06-14 14:39:28,915 INFO L125 PetriNetUnfolderBase]: For 84001/84001 co-relation queries the response was YES. [2024-06-14 14:39:28,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6605 conditions, 1024 events. 589/1024 cut-off events. For 84001/84001 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4872 event pairs, 104 based on Foata normal form. 1/1024 useless extension candidates. Maximal degree in co-relation 6501. Up to 932 conditions per place. [2024-06-14 14:39:28,924 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 182 selfloop transitions, 26 changer transitions 0/210 dead transitions. [2024-06-14 14:39:28,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 210 transitions, 2061 flow [2024-06-14 14:39:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:39:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:39:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2024-06-14 14:39:28,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37373737373737376 [2024-06-14 14:39:28,925 INFO L175 Difference]: Start difference. First operand has 208 places, 175 transitions, 1339 flow. Second operand 12 states and 148 transitions. [2024-06-14 14:39:28,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 210 transitions, 2061 flow [2024-06-14 14:39:29,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 210 transitions, 2007 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 14:39:29,106 INFO L231 Difference]: Finished difference. Result has 211 places, 180 transitions, 1425 flow [2024-06-14 14:39:29,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1425, PETRI_PLACES=211, PETRI_TRANSITIONS=180} [2024-06-14 14:39:29,106 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 179 predicate places. [2024-06-14 14:39:29,107 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 180 transitions, 1425 flow [2024-06-14 14:39:29,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:29,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:29,107 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-14 14:39:29,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 14:39:29,107 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-14 14:39:29,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:29,108 INFO L85 PathProgramCache]: Analyzing trace with hash -554574554, now seen corresponding path program 3 times [2024-06-14 14:39:29,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:29,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814865289] [2024-06-14 14:39:29,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:29,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:37,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:37,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814865289] [2024-06-14 14:39:37,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814865289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:37,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:37,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:39:37,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217450198] [2024-06-14 14:39:37,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:37,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:39:37,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:37,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:39:37,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:39:37,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:39:37,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 180 transitions, 1425 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:37,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:37,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:39:37,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:38,573 INFO L124 PetriNetUnfolderBase]: 586/1019 cut-off events. [2024-06-14 14:39:38,573 INFO L125 PetriNetUnfolderBase]: For 84136/84136 co-relation queries the response was YES. [2024-06-14 14:39:38,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6657 conditions, 1019 events. 586/1019 cut-off events. For 84136/84136 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4830 event pairs, 106 based on Foata normal form. 2/1020 useless extension candidates. Maximal degree in co-relation 6551. Up to 962 conditions per place. [2024-06-14 14:39:38,583 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 183 selfloop transitions, 18 changer transitions 0/203 dead transitions. [2024-06-14 14:39:38,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 203 transitions, 1891 flow [2024-06-14 14:39:38,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:39:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:39:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-14 14:39:38,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3526170798898072 [2024-06-14 14:39:38,585 INFO L175 Difference]: Start difference. First operand has 211 places, 180 transitions, 1425 flow. Second operand 11 states and 128 transitions. [2024-06-14 14:39:38,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 203 transitions, 1891 flow [2024-06-14 14:39:38,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 203 transitions, 1819 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-14 14:39:38,765 INFO L231 Difference]: Finished difference. Result has 214 places, 180 transitions, 1393 flow [2024-06-14 14:39:38,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1353, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1393, PETRI_PLACES=214, PETRI_TRANSITIONS=180} [2024-06-14 14:39:38,766 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 182 predicate places. [2024-06-14 14:39:38,766 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 180 transitions, 1393 flow [2024-06-14 14:39:38,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:38,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:38,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:38,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 14:39:38,774 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-14 14:39:38,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:38,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1872721048, now seen corresponding path program 2 times [2024-06-14 14:39:38,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:38,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663004706] [2024-06-14 14:39:38,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:38,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:47,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663004706] [2024-06-14 14:39:47,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663004706] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:47,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:47,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:39:47,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120054113] [2024-06-14 14:39:47,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:47,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:39:47,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:47,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:39:47,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:39:47,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:39:47,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 180 transitions, 1393 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:47,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:47,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:39:47,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:48,008 INFO L124 PetriNetUnfolderBase]: 585/1018 cut-off events. [2024-06-14 14:39:48,008 INFO L125 PetriNetUnfolderBase]: For 83302/83302 co-relation queries the response was YES. [2024-06-14 14:39:48,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6493 conditions, 1018 events. 585/1018 cut-off events. For 83302/83302 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4839 event pairs, 103 based on Foata normal form. 3/1020 useless extension candidates. Maximal degree in co-relation 6385. Up to 950 conditions per place. [2024-06-14 14:39:48,018 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 185 selfloop transitions, 20 changer transitions 0/207 dead transitions. [2024-06-14 14:39:48,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 207 transitions, 1909 flow [2024-06-14 14:39:48,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:39:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:39:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-14 14:39:48,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 14:39:48,019 INFO L175 Difference]: Start difference. First operand has 214 places, 180 transitions, 1393 flow. Second operand 11 states and 132 transitions. [2024-06-14 14:39:48,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 207 transitions, 1909 flow [2024-06-14 14:39:48,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 207 transitions, 1867 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-14 14:39:48,200 INFO L231 Difference]: Finished difference. Result has 215 places, 182 transitions, 1423 flow [2024-06-14 14:39:48,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1351, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1423, PETRI_PLACES=215, PETRI_TRANSITIONS=182} [2024-06-14 14:39:48,201 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 183 predicate places. [2024-06-14 14:39:48,201 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 182 transitions, 1423 flow [2024-06-14 14:39:48,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:48,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:48,201 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-14 14:39:48,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 14:39:48,201 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-14 14:39:48,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:48,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1872716398, now seen corresponding path program 3 times [2024-06-14 14:39:48,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:48,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415056714] [2024-06-14 14:39:48,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:48,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:56,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:56,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415056714] [2024-06-14 14:39:56,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415056714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:56,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:56,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:39:56,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954418743] [2024-06-14 14:39:56,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:56,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:39:56,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:56,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:39:56,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:39:56,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:39:56,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 182 transitions, 1423 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:56,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:56,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:39:56,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:57,434 INFO L124 PetriNetUnfolderBase]: 583/1015 cut-off events. [2024-06-14 14:39:57,434 INFO L125 PetriNetUnfolderBase]: For 76945/76945 co-relation queries the response was YES. [2024-06-14 14:39:57,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6441 conditions, 1015 events. 583/1015 cut-off events. For 76945/76945 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4819 event pairs, 105 based on Foata normal form. 1/1015 useless extension candidates. Maximal degree in co-relation 6332. Up to 955 conditions per place. [2024-06-14 14:39:57,445 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 183 selfloop transitions, 22 changer transitions 0/207 dead transitions. [2024-06-14 14:39:57,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 207 transitions, 1939 flow [2024-06-14 14:39:57,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:39:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:39:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-14 14:39:57,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3581267217630854 [2024-06-14 14:39:57,446 INFO L175 Difference]: Start difference. First operand has 215 places, 182 transitions, 1423 flow. Second operand 11 states and 130 transitions. [2024-06-14 14:39:57,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 207 transitions, 1939 flow [2024-06-14 14:39:57,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 207 transitions, 1859 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-14 14:39:57,683 INFO L231 Difference]: Finished difference. Result has 219 places, 185 transitions, 1452 flow [2024-06-14 14:39:57,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1452, PETRI_PLACES=219, PETRI_TRANSITIONS=185} [2024-06-14 14:39:57,699 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 187 predicate places. [2024-06-14 14:39:57,699 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 185 transitions, 1452 flow [2024-06-14 14:39:57,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:57,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:57,700 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-14 14:39:57,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 14:39:57,700 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-14 14:39:57,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:57,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1988012218, now seen corresponding path program 4 times [2024-06-14 14:39:57,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:57,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271995136] [2024-06-14 14:39:57,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:57,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:06,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:06,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271995136] [2024-06-14 14:40:06,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271995136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:06,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:06,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:40:06,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131554601] [2024-06-14 14:40:06,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:06,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:40:06,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:06,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:40:06,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:40:06,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:40:06,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 185 transitions, 1452 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:06,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:06,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:40:06,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:06,798 INFO L124 PetriNetUnfolderBase]: 586/1020 cut-off events. [2024-06-14 14:40:06,799 INFO L125 PetriNetUnfolderBase]: For 79321/79321 co-relation queries the response was YES. [2024-06-14 14:40:06,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6550 conditions, 1020 events. 586/1020 cut-off events. For 79321/79321 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4859 event pairs, 73 based on Foata normal form. 1/1020 useless extension candidates. Maximal degree in co-relation 6438. Up to 822 conditions per place. [2024-06-14 14:40:06,808 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 179 selfloop transitions, 60 changer transitions 0/241 dead transitions. [2024-06-14 14:40:06,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 241 transitions, 2276 flow [2024-06-14 14:40:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:40:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:40:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-14 14:40:06,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774104683195592 [2024-06-14 14:40:06,811 INFO L175 Difference]: Start difference. First operand has 219 places, 185 transitions, 1452 flow. Second operand 11 states and 137 transitions. [2024-06-14 14:40:06,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 241 transitions, 2276 flow [2024-06-14 14:40:06,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 241 transitions, 2212 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 14:40:06,984 INFO L231 Difference]: Finished difference. Result has 227 places, 213 transitions, 1853 flow [2024-06-14 14:40:06,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1853, PETRI_PLACES=227, PETRI_TRANSITIONS=213} [2024-06-14 14:40:06,984 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 195 predicate places. [2024-06-14 14:40:06,984 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 213 transitions, 1853 flow [2024-06-14 14:40:06,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:06,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:06,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:06,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 14:40:06,985 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-14 14:40:06,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1988007568, now seen corresponding path program 5 times [2024-06-14 14:40:06,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:06,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941983350] [2024-06-14 14:40:06,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:06,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:15,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:15,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941983350] [2024-06-14 14:40:15,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941983350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:15,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:15,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:40:15,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384780783] [2024-06-14 14:40:15,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:15,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:40:15,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:15,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:40:15,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:40:15,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:40:15,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 213 transitions, 1853 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:15,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:15,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:40:15,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:16,202 INFO L124 PetriNetUnfolderBase]: 594/1033 cut-off events. [2024-06-14 14:40:16,203 INFO L125 PetriNetUnfolderBase]: For 85201/85201 co-relation queries the response was YES. [2024-06-14 14:40:16,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7115 conditions, 1033 events. 594/1033 cut-off events. For 85201/85201 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4950 event pairs, 73 based on Foata normal form. 1/1033 useless extension candidates. Maximal degree in co-relation 6997. Up to 825 conditions per place. [2024-06-14 14:40:16,212 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 179 selfloop transitions, 65 changer transitions 0/246 dead transitions. [2024-06-14 14:40:16,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 246 transitions, 2686 flow [2024-06-14 14:40:16,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:40:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:40:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-14 14:40:16,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38292011019283745 [2024-06-14 14:40:16,214 INFO L175 Difference]: Start difference. First operand has 227 places, 213 transitions, 1853 flow. Second operand 11 states and 139 transitions. [2024-06-14 14:40:16,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 246 transitions, 2686 flow [2024-06-14 14:40:16,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 246 transitions, 2552 flow, removed 57 selfloop flow, removed 5 redundant places. [2024-06-14 14:40:16,401 INFO L231 Difference]: Finished difference. Result has 233 places, 217 transitions, 1930 flow [2024-06-14 14:40:16,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1930, PETRI_PLACES=233, PETRI_TRANSITIONS=217} [2024-06-14 14:40:16,401 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 201 predicate places. [2024-06-14 14:40:16,401 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 217 transitions, 1930 flow [2024-06-14 14:40:16,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:16,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:16,402 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-14 14:40:16,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 14:40:16,402 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-14 14:40:16,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1988007444, now seen corresponding path program 4 times [2024-06-14 14:40:16,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:16,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487420287] [2024-06-14 14:40:16,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:16,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:25,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:25,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487420287] [2024-06-14 14:40:25,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487420287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:25,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:25,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:40:25,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978045026] [2024-06-14 14:40:25,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:25,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:40:25,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:25,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:40:25,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:40:25,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:40:25,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 217 transitions, 1930 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:25,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:25,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:40:25,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:26,050 INFO L124 PetriNetUnfolderBase]: 598/1041 cut-off events. [2024-06-14 14:40:26,051 INFO L125 PetriNetUnfolderBase]: For 88955/88955 co-relation queries the response was YES. [2024-06-14 14:40:26,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6909 conditions, 1041 events. 598/1041 cut-off events. For 88955/88955 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5004 event pairs, 84 based on Foata normal form. 2/1042 useless extension candidates. Maximal degree in co-relation 6792. Up to 942 conditions per place. [2024-06-14 14:40:26,062 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 197 selfloop transitions, 39 changer transitions 0/238 dead transitions. [2024-06-14 14:40:26,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 238 transitions, 2480 flow [2024-06-14 14:40:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:40:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:40:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 14:40:26,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3608815426997245 [2024-06-14 14:40:26,064 INFO L175 Difference]: Start difference. First operand has 233 places, 217 transitions, 1930 flow. Second operand 11 states and 131 transitions. [2024-06-14 14:40:26,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 238 transitions, 2480 flow [2024-06-14 14:40:26,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 238 transitions, 2360 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-14 14:40:26,231 INFO L231 Difference]: Finished difference. Result has 237 places, 218 transitions, 1918 flow [2024-06-14 14:40:26,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1918, PETRI_PLACES=237, PETRI_TRANSITIONS=218} [2024-06-14 14:40:26,232 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 205 predicate places. [2024-06-14 14:40:26,232 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 218 transitions, 1918 flow [2024-06-14 14:40:26,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:26,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:26,232 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-14 14:40:26,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 14:40:26,233 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-14 14:40:26,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:26,233 INFO L85 PathProgramCache]: Analyzing trace with hash -331988742, now seen corresponding path program 6 times [2024-06-14 14:40:26,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:26,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698714072] [2024-06-14 14:40:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:26,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:35,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:35,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698714072] [2024-06-14 14:40:35,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698714072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:35,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:35,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:40:35,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076134288] [2024-06-14 14:40:35,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:35,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:40:35,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:35,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:40:35,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:40:35,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:40:35,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 218 transitions, 1918 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:35,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:35,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:40:35,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:35,674 INFO L124 PetriNetUnfolderBase]: 596/1038 cut-off events. [2024-06-14 14:40:35,674 INFO L125 PetriNetUnfolderBase]: For 84528/84528 co-relation queries the response was YES. [2024-06-14 14:40:35,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6832 conditions, 1038 events. 596/1038 cut-off events. For 84528/84528 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5011 event pairs, 73 based on Foata normal form. 1/1038 useless extension candidates. Maximal degree in co-relation 6713. Up to 840 conditions per place. [2024-06-14 14:40:35,685 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 183 selfloop transitions, 61 changer transitions 0/246 dead transitions. [2024-06-14 14:40:35,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 246 transitions, 2521 flow [2024-06-14 14:40:35,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:40:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:40:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 14:40:35,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3746556473829201 [2024-06-14 14:40:35,686 INFO L175 Difference]: Start difference. First operand has 237 places, 218 transitions, 1918 flow. Second operand 11 states and 136 transitions. [2024-06-14 14:40:35,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 246 transitions, 2521 flow [2024-06-14 14:40:35,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 246 transitions, 2413 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-14 14:40:35,861 INFO L231 Difference]: Finished difference. Result has 239 places, 218 transitions, 1937 flow [2024-06-14 14:40:35,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1937, PETRI_PLACES=239, PETRI_TRANSITIONS=218} [2024-06-14 14:40:35,862 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 207 predicate places. [2024-06-14 14:40:35,862 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 218 transitions, 1937 flow [2024-06-14 14:40:35,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:35,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:35,863 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-14 14:40:35,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 14:40:35,863 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-14 14:40:35,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:35,863 INFO L85 PathProgramCache]: Analyzing trace with hash 366671434, now seen corresponding path program 7 times [2024-06-14 14:40:35,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:35,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256539152] [2024-06-14 14:40:35,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:35,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:44,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:44,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256539152] [2024-06-14 14:40:44,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256539152] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:44,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:44,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:40:44,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156219657] [2024-06-14 14:40:44,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:44,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:40:44,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:44,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:40:44,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:40:44,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:40:44,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 218 transitions, 1937 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:44,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:44,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:40:44,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:45,130 INFO L124 PetriNetUnfolderBase]: 604/1051 cut-off events. [2024-06-14 14:40:45,131 INFO L125 PetriNetUnfolderBase]: For 89880/89880 co-relation queries the response was YES. [2024-06-14 14:40:45,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7079 conditions, 1051 events. 604/1051 cut-off events. For 89880/89880 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5093 event pairs, 63 based on Foata normal form. 1/1051 useless extension candidates. Maximal degree in co-relation 6959. Up to 842 conditions per place. [2024-06-14 14:40:45,141 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 189 selfloop transitions, 60 changer transitions 0/251 dead transitions. [2024-06-14 14:40:45,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 251 transitions, 2792 flow [2024-06-14 14:40:45,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:40:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:40:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-14 14:40:45,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774104683195592 [2024-06-14 14:40:45,144 INFO L175 Difference]: Start difference. First operand has 239 places, 218 transitions, 1937 flow. Second operand 11 states and 137 transitions. [2024-06-14 14:40:45,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 251 transitions, 2792 flow [2024-06-14 14:40:45,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 251 transitions, 2622 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 14:40:45,332 INFO L231 Difference]: Finished difference. Result has 241 places, 227 transitions, 2008 flow [2024-06-14 14:40:45,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2008, PETRI_PLACES=241, PETRI_TRANSITIONS=227} [2024-06-14 14:40:45,332 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 209 predicate places. [2024-06-14 14:40:45,332 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 227 transitions, 2008 flow [2024-06-14 14:40:45,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:45,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:45,333 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-14 14:40:45,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 14:40:45,333 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-14 14:40:45,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:45,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1662737424, now seen corresponding path program 5 times [2024-06-14 14:40:45,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:45,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865176792] [2024-06-14 14:40:45,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:45,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:54,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:54,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865176792] [2024-06-14 14:40:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865176792] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:54,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:54,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:40:54,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204603778] [2024-06-14 14:40:54,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:54,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:40:54,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:54,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:40:54,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:40:54,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:40:54,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 227 transitions, 2008 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:54,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:54,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:40:54,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:54,895 INFO L124 PetriNetUnfolderBase]: 608/1059 cut-off events. [2024-06-14 14:40:54,896 INFO L125 PetriNetUnfolderBase]: For 95906/95906 co-relation queries the response was YES. [2024-06-14 14:40:54,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7084 conditions, 1059 events. 608/1059 cut-off events. For 95906/95906 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5138 event pairs, 78 based on Foata normal form. 2/1060 useless extension candidates. Maximal degree in co-relation 6963. Up to 960 conditions per place. [2024-06-14 14:40:54,907 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 206 selfloop transitions, 37 changer transitions 0/245 dead transitions. [2024-06-14 14:40:54,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 245 transitions, 2564 flow [2024-06-14 14:40:54,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:40:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:40:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-14 14:40:54,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35537190082644626 [2024-06-14 14:40:54,908 INFO L175 Difference]: Start difference. First operand has 241 places, 227 transitions, 2008 flow. Second operand 11 states and 129 transitions. [2024-06-14 14:40:54,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 245 transitions, 2564 flow [2024-06-14 14:40:55,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 245 transitions, 2501 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-14 14:40:55,110 INFO L231 Difference]: Finished difference. Result has 249 places, 228 transitions, 2051 flow [2024-06-14 14:40:55,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1945, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2051, PETRI_PLACES=249, PETRI_TRANSITIONS=228} [2024-06-14 14:40:55,111 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 217 predicate places. [2024-06-14 14:40:55,111 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 228 transitions, 2051 flow [2024-06-14 14:40:55,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:55,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:55,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:55,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 14:40:55,112 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-14 14:40:55,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:55,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1662732650, now seen corresponding path program 8 times [2024-06-14 14:40:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:55,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430758223] [2024-06-14 14:40:55,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:55,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:03,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:03,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430758223] [2024-06-14 14:41:03,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430758223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:03,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:03,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:41:03,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299563014] [2024-06-14 14:41:03,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:03,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:41:03,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:03,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:41:03,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:41:04,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:41:04,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 228 transitions, 2051 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:04,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:04,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:41:04,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:04,641 INFO L124 PetriNetUnfolderBase]: 617/1074 cut-off events. [2024-06-14 14:41:04,656 INFO L125 PetriNetUnfolderBase]: For 101808/101808 co-relation queries the response was YES. [2024-06-14 14:41:04,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7251 conditions, 1074 events. 617/1074 cut-off events. For 101808/101808 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5224 event pairs, 71 based on Foata normal form. 3/1076 useless extension candidates. Maximal degree in co-relation 7128. Up to 588 conditions per place. [2024-06-14 14:41:04,665 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 152 selfloop transitions, 102 changer transitions 0/256 dead transitions. [2024-06-14 14:41:04,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 256 transitions, 2700 flow [2024-06-14 14:41:04,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:41:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:41:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-14 14:41:04,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-14 14:41:04,681 INFO L175 Difference]: Start difference. First operand has 249 places, 228 transitions, 2051 flow. Second operand 11 states and 149 transitions. [2024-06-14 14:41:04,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 256 transitions, 2700 flow [2024-06-14 14:41:04,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 256 transitions, 2604 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-14 14:41:04,928 INFO L231 Difference]: Finished difference. Result has 251 places, 232 transitions, 2239 flow [2024-06-14 14:41:04,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1955, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2239, PETRI_PLACES=251, PETRI_TRANSITIONS=232} [2024-06-14 14:41:04,929 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 219 predicate places. [2024-06-14 14:41:04,929 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 232 transitions, 2239 flow [2024-06-14 14:41:04,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:04,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:04,930 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-14 14:41:04,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 14:41:04,930 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-14 14:41:04,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:04,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2141142964, now seen corresponding path program 9 times [2024-06-14 14:41:04,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:04,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051584552] [2024-06-14 14:41:04,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:04,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:13,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:13,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051584552] [2024-06-14 14:41:13,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051584552] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:13,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:13,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:41:13,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764298037] [2024-06-14 14:41:13,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:13,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:41:13,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:13,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:41:13,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:41:13,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:41:13,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 232 transitions, 2239 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:13,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:13,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:41:13,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:14,219 INFO L124 PetriNetUnfolderBase]: 626/1089 cut-off events. [2024-06-14 14:41:14,219 INFO L125 PetriNetUnfolderBase]: For 104563/104563 co-relation queries the response was YES. [2024-06-14 14:41:14,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7565 conditions, 1089 events. 626/1089 cut-off events. For 104563/104563 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5320 event pairs, 63 based on Foata normal form. 3/1091 useless extension candidates. Maximal degree in co-relation 7441. Up to 603 conditions per place. [2024-06-14 14:41:14,230 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 160 selfloop transitions, 100 changer transitions 0/262 dead transitions. [2024-06-14 14:41:14,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 262 transitions, 2923 flow [2024-06-14 14:41:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:41:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:41:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-14 14:41:14,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-14 14:41:14,231 INFO L175 Difference]: Start difference. First operand has 251 places, 232 transitions, 2239 flow. Second operand 11 states and 150 transitions. [2024-06-14 14:41:14,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 262 transitions, 2923 flow [2024-06-14 14:41:14,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 262 transitions, 2675 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-14 14:41:14,446 INFO L231 Difference]: Finished difference. Result has 253 places, 236 transitions, 2279 flow [2024-06-14 14:41:14,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2279, PETRI_PLACES=253, PETRI_TRANSITIONS=236} [2024-06-14 14:41:14,446 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 221 predicate places. [2024-06-14 14:41:14,446 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 236 transitions, 2279 flow [2024-06-14 14:41:14,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:14,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:14,447 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-14 14:41:14,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 14:41:14,447 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-14 14:41:14,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash 373351438, now seen corresponding path program 1 times [2024-06-14 14:41:14,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:14,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414728034] [2024-06-14 14:41:14,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:14,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:22,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:22,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414728034] [2024-06-14 14:41:22,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414728034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:22,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:22,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:41:22,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693412204] [2024-06-14 14:41:22,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:22,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:41:22,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:22,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:41:22,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:41:22,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:41:22,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 236 transitions, 2279 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:22,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:22,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:41:22,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:23,354 INFO L124 PetriNetUnfolderBase]: 630/1097 cut-off events. [2024-06-14 14:41:23,354 INFO L125 PetriNetUnfolderBase]: For 103180/103180 co-relation queries the response was YES. [2024-06-14 14:41:23,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7599 conditions, 1097 events. 630/1097 cut-off events. For 103180/103180 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5365 event pairs, 69 based on Foata normal form. 2/1098 useless extension candidates. Maximal degree in co-relation 7474. Up to 950 conditions per place. [2024-06-14 14:41:23,365 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 209 selfloop transitions, 45 changer transitions 0/256 dead transitions. [2024-06-14 14:41:23,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 256 transitions, 2851 flow [2024-06-14 14:41:23,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:41:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:41:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 14:41:23,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-14 14:41:23,367 INFO L175 Difference]: Start difference. First operand has 253 places, 236 transitions, 2279 flow. Second operand 10 states and 124 transitions. [2024-06-14 14:41:23,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 256 transitions, 2851 flow [2024-06-14 14:41:23,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 256 transitions, 2599 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-06-14 14:41:23,611 INFO L231 Difference]: Finished difference. Result has 254 places, 237 transitions, 2133 flow [2024-06-14 14:41:23,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2027, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2133, PETRI_PLACES=254, PETRI_TRANSITIONS=237} [2024-06-14 14:41:23,612 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 222 predicate places. [2024-06-14 14:41:23,612 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 237 transitions, 2133 flow [2024-06-14 14:41:23,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:23,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:23,612 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-14 14:41:23,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 14:41:23,613 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-14 14:41:23,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:23,613 INFO L85 PathProgramCache]: Analyzing trace with hash 373105174, now seen corresponding path program 10 times [2024-06-14 14:41:23,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:23,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881832677] [2024-06-14 14:41:23,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:23,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:32,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:32,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881832677] [2024-06-14 14:41:32,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881832677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:32,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:32,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:41:32,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191554058] [2024-06-14 14:41:32,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:32,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:41:32,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:32,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:41:32,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:41:32,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:41:32,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 237 transitions, 2133 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:32,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:32,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:41:32,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:32,663 INFO L124 PetriNetUnfolderBase]: 628/1094 cut-off events. [2024-06-14 14:41:32,664 INFO L125 PetriNetUnfolderBase]: For 97581/97581 co-relation queries the response was YES. [2024-06-14 14:41:32,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 1094 events. 628/1094 cut-off events. For 97581/97581 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5362 event pairs, 73 based on Foata normal form. 1/1094 useless extension candidates. Maximal degree in co-relation 7201. Up to 896 conditions per place. [2024-06-14 14:41:32,674 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 199 selfloop transitions, 61 changer transitions 0/262 dead transitions. [2024-06-14 14:41:32,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 262 transitions, 2759 flow [2024-06-14 14:41:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:41:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:41:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 14:41:32,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3691460055096419 [2024-06-14 14:41:32,676 INFO L175 Difference]: Start difference. First operand has 254 places, 237 transitions, 2133 flow. Second operand 11 states and 134 transitions. [2024-06-14 14:41:32,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 262 transitions, 2759 flow [2024-06-14 14:41:32,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 262 transitions, 2636 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 14:41:32,920 INFO L231 Difference]: Finished difference. Result has 257 places, 239 transitions, 2152 flow [2024-06-14 14:41:32,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2010, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2152, PETRI_PLACES=257, PETRI_TRANSITIONS=239} [2024-06-14 14:41:32,921 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 225 predicate places. [2024-06-14 14:41:32,921 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 239 transitions, 2152 flow [2024-06-14 14:41:32,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:32,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:32,921 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-14 14:41:32,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 14:41:32,922 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-14 14:41:32,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash 649075062, now seen corresponding path program 2 times [2024-06-14 14:41:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:32,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292575204] [2024-06-14 14:41:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:41,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:41,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292575204] [2024-06-14 14:41:41,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292575204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:41,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:41,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:41:41,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558121024] [2024-06-14 14:41:41,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:41,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:41:41,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:41,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:41:41,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:41:41,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:41:41,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 239 transitions, 2152 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:41,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:41,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:41:41,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:41,745 INFO L124 PetriNetUnfolderBase]: 638/1112 cut-off events. [2024-06-14 14:41:41,745 INFO L125 PetriNetUnfolderBase]: For 103641/103641 co-relation queries the response was YES. [2024-06-14 14:41:41,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7457 conditions, 1112 events. 638/1112 cut-off events. For 103641/103641 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5485 event pairs, 67 based on Foata normal form. 2/1113 useless extension candidates. Maximal degree in co-relation 7330. Up to 961 conditions per place. [2024-06-14 14:41:41,757 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 213 selfloop transitions, 44 changer transitions 0/259 dead transitions. [2024-06-14 14:41:41,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 259 transitions, 2747 flow [2024-06-14 14:41:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:41:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:41:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 14:41:41,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3696969696969697 [2024-06-14 14:41:41,758 INFO L175 Difference]: Start difference. First operand has 257 places, 239 transitions, 2152 flow. Second operand 10 states and 122 transitions. [2024-06-14 14:41:41,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 259 transitions, 2747 flow [2024-06-14 14:41:42,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 259 transitions, 2641 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 14:41:42,017 INFO L231 Difference]: Finished difference. Result has 262 places, 243 transitions, 2188 flow [2024-06-14 14:41:42,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2188, PETRI_PLACES=262, PETRI_TRANSITIONS=243} [2024-06-14 14:41:42,018 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 230 predicate places. [2024-06-14 14:41:42,018 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 243 transitions, 2188 flow [2024-06-14 14:41:42,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:42,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:42,018 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-14 14:41:42,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 14:41:42,018 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-14 14:41:42,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash 419386452, now seen corresponding path program 3 times [2024-06-14 14:41:42,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:42,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997548162] [2024-06-14 14:41:42,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:42,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:50,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997548162] [2024-06-14 14:41:50,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997548162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:50,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:50,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:41:50,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508929743] [2024-06-14 14:41:50,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:50,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:41:50,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:50,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:41:50,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:41:51,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:41:51,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 243 transitions, 2188 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:51,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:51,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:41:51,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:51,639 INFO L124 PetriNetUnfolderBase]: 642/1120 cut-off events. [2024-06-14 14:41:51,639 INFO L125 PetriNetUnfolderBase]: For 105923/105923 co-relation queries the response was YES. [2024-06-14 14:41:51,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7505 conditions, 1120 events. 642/1120 cut-off events. For 105923/105923 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5529 event pairs, 69 based on Foata normal form. 2/1121 useless extension candidates. Maximal degree in co-relation 7376. Up to 969 conditions per place. [2024-06-14 14:41:51,650 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 218 selfloop transitions, 42 changer transitions 0/262 dead transitions. [2024-06-14 14:41:51,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 262 transitions, 2780 flow [2024-06-14 14:41:51,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:41:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:41:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 14:41:51,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-14 14:41:51,651 INFO L175 Difference]: Start difference. First operand has 262 places, 243 transitions, 2188 flow. Second operand 10 states and 125 transitions. [2024-06-14 14:41:51,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 262 transitions, 2780 flow [2024-06-14 14:41:51,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 262 transitions, 2701 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 14:41:51,918 INFO L231 Difference]: Finished difference. Result has 268 places, 245 transitions, 2228 flow [2024-06-14 14:41:51,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2228, PETRI_PLACES=268, PETRI_TRANSITIONS=245} [2024-06-14 14:41:51,919 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 236 predicate places. [2024-06-14 14:41:51,919 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 245 transitions, 2228 flow [2024-06-14 14:41:51,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:51,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:51,919 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-14 14:41:51,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 14:41:51,920 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-14 14:41:51,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:51,920 INFO L85 PathProgramCache]: Analyzing trace with hash 897723482, now seen corresponding path program 11 times [2024-06-14 14:41:51,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:51,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083691917] [2024-06-14 14:41:51,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:51,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:58,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-14 14:41:58,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:58,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083691917] [2024-06-14 14:41:58,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083691917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:58,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:58,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:41:58,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497887956] [2024-06-14 14:41:58,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:58,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:41:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:58,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:41:58,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:41:58,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:41:58,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 245 transitions, 2228 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:58,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:58,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:41:58,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:59,126 INFO L124 PetriNetUnfolderBase]: 645/1125 cut-off events. [2024-06-14 14:41:59,127 INFO L125 PetriNetUnfolderBase]: For 104619/104619 co-relation queries the response was YES. [2024-06-14 14:41:59,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7576 conditions, 1125 events. 645/1125 cut-off events. For 104619/104619 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5588 event pairs, 73 based on Foata normal form. 1/1125 useless extension candidates. Maximal degree in co-relation 7445. Up to 927 conditions per place. [2024-06-14 14:41:59,139 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 208 selfloop transitions, 61 changer transitions 0/271 dead transitions. [2024-06-14 14:41:59,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 271 transitions, 2915 flow [2024-06-14 14:41:59,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:41:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:41:59,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 14:41:59,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371900826446281 [2024-06-14 14:41:59,141 INFO L175 Difference]: Start difference. First operand has 268 places, 245 transitions, 2228 flow. Second operand 11 states and 135 transitions. [2024-06-14 14:41:59,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 271 transitions, 2915 flow [2024-06-14 14:41:59,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 271 transitions, 2823 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 14:41:59,414 INFO L231 Difference]: Finished difference. Result has 273 places, 252 transitions, 2347 flow [2024-06-14 14:41:59,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2136, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2347, PETRI_PLACES=273, PETRI_TRANSITIONS=252} [2024-06-14 14:41:59,414 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 241 predicate places. [2024-06-14 14:41:59,414 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 252 transitions, 2347 flow [2024-06-14 14:41:59,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:59,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:59,415 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-14 14:41:59,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 14:41:59,415 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-14 14:41:59,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:59,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1333282290, now seen corresponding path program 6 times [2024-06-14 14:41:59,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:59,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609775673] [2024-06-14 14:41:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:59,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:08,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:08,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609775673] [2024-06-14 14:42:08,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609775673] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:08,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:08,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:42:08,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755998177] [2024-06-14 14:42:08,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:08,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:42:08,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:08,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:42:08,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:42:08,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:42:08,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 252 transitions, 2347 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:08,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:08,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:42:08,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:09,170 INFO L124 PetriNetUnfolderBase]: 649/1133 cut-off events. [2024-06-14 14:42:09,171 INFO L125 PetriNetUnfolderBase]: For 111304/111304 co-relation queries the response was YES. [2024-06-14 14:42:09,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7735 conditions, 1133 events. 649/1133 cut-off events. For 111304/111304 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5639 event pairs, 78 based on Foata normal form. 2/1134 useless extension candidates. Maximal degree in co-relation 7602. Up to 1034 conditions per place. [2024-06-14 14:42:09,182 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 229 selfloop transitions, 36 changer transitions 0/267 dead transitions. [2024-06-14 14:42:09,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 267 transitions, 2939 flow [2024-06-14 14:42:09,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:42:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:42:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-14 14:42:09,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.349862258953168 [2024-06-14 14:42:09,184 INFO L175 Difference]: Start difference. First operand has 273 places, 252 transitions, 2347 flow. Second operand 11 states and 127 transitions. [2024-06-14 14:42:09,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 267 transitions, 2939 flow [2024-06-14 14:42:09,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 267 transitions, 2809 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-14 14:42:09,522 INFO L231 Difference]: Finished difference. Result has 278 places, 253 transitions, 2323 flow [2024-06-14 14:42:09,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2217, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2323, PETRI_PLACES=278, PETRI_TRANSITIONS=253} [2024-06-14 14:42:09,522 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 246 predicate places. [2024-06-14 14:42:09,522 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 253 transitions, 2323 flow [2024-06-14 14:42:09,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:09,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:09,523 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-14 14:42:09,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 14:42:09,523 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-14 14:42:09,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash 891294392, now seen corresponding path program 12 times [2024-06-14 14:42:09,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:09,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30534506] [2024-06-14 14:42:09,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:18,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:18,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30534506] [2024-06-14 14:42:18,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30534506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:18,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:18,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:42:18,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454791323] [2024-06-14 14:42:18,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:18,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:42:18,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:18,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:42:18,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:42:18,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:42:18,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 253 transitions, 2323 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:18,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:18,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:42:18,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:18,887 INFO L124 PetriNetUnfolderBase]: 658/1148 cut-off events. [2024-06-14 14:42:18,887 INFO L125 PetriNetUnfolderBase]: For 118121/118121 co-relation queries the response was YES. [2024-06-14 14:42:18,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7802 conditions, 1148 events. 658/1148 cut-off events. For 118121/118121 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5736 event pairs, 67 based on Foata normal form. 3/1150 useless extension candidates. Maximal degree in co-relation 7670. Up to 654 conditions per place. [2024-06-14 14:42:18,899 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 177 selfloop transitions, 100 changer transitions 0/279 dead transitions. [2024-06-14 14:42:18,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 279 transitions, 3029 flow [2024-06-14 14:42:18,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:42:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:42:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-14 14:42:18,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-14 14:42:18,900 INFO L175 Difference]: Start difference. First operand has 278 places, 253 transitions, 2323 flow. Second operand 11 states and 147 transitions. [2024-06-14 14:42:18,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 279 transitions, 3029 flow [2024-06-14 14:42:19,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 279 transitions, 2933 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-14 14:42:19,188 INFO L231 Difference]: Finished difference. Result has 280 places, 256 transitions, 2508 flow [2024-06-14 14:42:19,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2227, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2508, PETRI_PLACES=280, PETRI_TRANSITIONS=256} [2024-06-14 14:42:19,188 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 248 predicate places. [2024-06-14 14:42:19,188 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 256 transitions, 2508 flow [2024-06-14 14:42:19,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:19,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:19,189 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-14 14:42:19,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 14:42:19,189 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-14 14:42:19,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:19,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1127956886, now seen corresponding path program 4 times [2024-06-14 14:42:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:19,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499963405] [2024-06-14 14:42:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:19,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:26,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:26,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499963405] [2024-06-14 14:42:26,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499963405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:26,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:26,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:42:26,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89210255] [2024-06-14 14:42:26,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:26,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:42:26,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:26,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:42:26,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:42:27,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:42:27,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 256 transitions, 2508 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:27,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:27,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:42:27,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:27,612 INFO L124 PetriNetUnfolderBase]: 672/1174 cut-off events. [2024-06-14 14:42:27,612 INFO L125 PetriNetUnfolderBase]: For 125143/125143 co-relation queries the response was YES. [2024-06-14 14:42:27,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8314 conditions, 1174 events. 672/1174 cut-off events. For 125143/125143 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5873 event pairs, 64 based on Foata normal form. 2/1175 useless extension candidates. Maximal degree in co-relation 8181. Up to 971 conditions per place. [2024-06-14 14:42:27,625 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 222 selfloop transitions, 53 changer transitions 0/277 dead transitions. [2024-06-14 14:42:27,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 277 transitions, 3328 flow [2024-06-14 14:42:27,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:42:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:42:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 14:42:27,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-14 14:42:27,627 INFO L175 Difference]: Start difference. First operand has 280 places, 256 transitions, 2508 flow. Second operand 10 states and 124 transitions. [2024-06-14 14:42:27,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 277 transitions, 3328 flow [2024-06-14 14:42:27,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 277 transitions, 3071 flow, removed 31 selfloop flow, removed 9 redundant places. [2024-06-14 14:42:27,963 INFO L231 Difference]: Finished difference. Result has 282 places, 260 transitions, 2432 flow [2024-06-14 14:42:27,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2432, PETRI_PLACES=282, PETRI_TRANSITIONS=260} [2024-06-14 14:42:27,963 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 250 predicate places. [2024-06-14 14:42:27,963 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 260 transitions, 2432 flow [2024-06-14 14:42:27,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:27,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:27,964 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-14 14:42:27,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 14:42:27,964 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-14 14:42:27,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash 891289742, now seen corresponding path program 13 times [2024-06-14 14:42:27,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:27,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311409710] [2024-06-14 14:42:27,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:27,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:37,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:37,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311409710] [2024-06-14 14:42:37,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311409710] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:37,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:37,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:42:37,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194958088] [2024-06-14 14:42:37,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:37,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:42:37,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:37,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:42:37,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:42:37,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:42:37,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 260 transitions, 2432 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:37,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:37,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:42:37,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:38,134 INFO L124 PetriNetUnfolderBase]: 690/1203 cut-off events. [2024-06-14 14:42:38,134 INFO L125 PetriNetUnfolderBase]: For 136526/136526 co-relation queries the response was YES. [2024-06-14 14:42:38,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8750 conditions, 1203 events. 690/1203 cut-off events. For 136526/136526 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6078 event pairs, 68 based on Foata normal form. 1/1203 useless extension candidates. Maximal degree in co-relation 8615. Up to 675 conditions per place. [2024-06-14 14:42:38,149 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 180 selfloop transitions, 109 changer transitions 0/291 dead transitions. [2024-06-14 14:42:38,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 291 transitions, 3410 flow [2024-06-14 14:42:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:42:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:42:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2024-06-14 14:42:38,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-14 14:42:38,150 INFO L175 Difference]: Start difference. First operand has 282 places, 260 transitions, 2432 flow. Second operand 12 states and 160 transitions. [2024-06-14 14:42:38,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 291 transitions, 3410 flow [2024-06-14 14:42:38,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 291 transitions, 3353 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 14:42:38,572 INFO L231 Difference]: Finished difference. Result has 290 places, 265 transitions, 2745 flow [2024-06-14 14:42:38,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2375, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2745, PETRI_PLACES=290, PETRI_TRANSITIONS=265} [2024-06-14 14:42:38,573 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 258 predicate places. [2024-06-14 14:42:38,573 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 265 transitions, 2745 flow [2024-06-14 14:42:38,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:38,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:38,574 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-14 14:42:38,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 14:42:38,574 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-14 14:42:38,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:38,574 INFO L85 PathProgramCache]: Analyzing trace with hash 412884078, now seen corresponding path program 14 times [2024-06-14 14:42:38,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:38,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438683477] [2024-06-14 14:42:38,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:38,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:47,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:47,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438683477] [2024-06-14 14:42:47,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438683477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:47,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:47,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:42:47,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51703895] [2024-06-14 14:42:47,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:47,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:42:47,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:47,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:42:47,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:42:47,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:42:47,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 265 transitions, 2745 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:47,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:47,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:42:47,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:48,078 INFO L124 PetriNetUnfolderBase]: 699/1218 cut-off events. [2024-06-14 14:42:48,078 INFO L125 PetriNetUnfolderBase]: For 149588/149588 co-relation queries the response was YES. [2024-06-14 14:42:48,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9253 conditions, 1218 events. 699/1218 cut-off events. For 149588/149588 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6163 event pairs, 60 based on Foata normal form. 3/1220 useless extension candidates. Maximal degree in co-relation 9115. Up to 724 conditions per place. [2024-06-14 14:42:48,091 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 190 selfloop transitions, 97 changer transitions 0/289 dead transitions. [2024-06-14 14:42:48,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 289 transitions, 3470 flow [2024-06-14 14:42:48,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:42:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:42:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-14 14:42:48,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-14 14:42:48,092 INFO L175 Difference]: Start difference. First operand has 290 places, 265 transitions, 2745 flow. Second operand 11 states and 148 transitions. [2024-06-14 14:42:48,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 289 transitions, 3470 flow [2024-06-14 14:42:48,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 289 transitions, 3255 flow, removed 47 selfloop flow, removed 8 redundant places. [2024-06-14 14:42:48,498 INFO L231 Difference]: Finished difference. Result has 293 places, 268 transitions, 2820 flow [2024-06-14 14:42:48,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2556, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2820, PETRI_PLACES=293, PETRI_TRANSITIONS=268} [2024-06-14 14:42:48,499 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 261 predicate places. [2024-06-14 14:42:48,499 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 268 transitions, 2820 flow [2024-06-14 14:42:48,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:48,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:48,499 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-14 14:42:48,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 14:42:48,500 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-14 14:42:48,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:48,500 INFO L85 PathProgramCache]: Analyzing trace with hash 640785228, now seen corresponding path program 15 times [2024-06-14 14:42:48,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:48,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996025285] [2024-06-14 14:42:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:48,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:57,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:57,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:57,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996025285] [2024-06-14 14:42:57,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996025285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:57,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:57,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:42:57,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603775524] [2024-06-14 14:42:57,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:57,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:42:57,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:57,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:42:57,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:42:57,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:42:57,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 268 transitions, 2820 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:57,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:57,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:42:57,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:57,768 INFO L124 PetriNetUnfolderBase]: 697/1215 cut-off events. [2024-06-14 14:42:57,768 INFO L125 PetriNetUnfolderBase]: For 138321/138321 co-relation queries the response was YES. [2024-06-14 14:42:57,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9211 conditions, 1215 events. 697/1215 cut-off events. For 138321/138321 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6151 event pairs, 74 based on Foata normal form. 1/1215 useless extension candidates. Maximal degree in co-relation 9071. Up to 1017 conditions per place. [2024-06-14 14:42:57,782 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 219 selfloop transitions, 68 changer transitions 0/289 dead transitions. [2024-06-14 14:42:57,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 289 transitions, 3505 flow [2024-06-14 14:42:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:42:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:42:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-14 14:42:57,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 14:42:57,783 INFO L175 Difference]: Start difference. First operand has 293 places, 268 transitions, 2820 flow. Second operand 11 states and 132 transitions. [2024-06-14 14:42:57,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 289 transitions, 3505 flow [2024-06-14 14:42:58,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 289 transitions, 3272 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-14 14:42:58,201 INFO L231 Difference]: Finished difference. Result has 296 places, 271 transitions, 2779 flow [2024-06-14 14:42:58,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2589, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2779, PETRI_PLACES=296, PETRI_TRANSITIONS=271} [2024-06-14 14:42:58,201 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 264 predicate places. [2024-06-14 14:42:58,201 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 271 transitions, 2779 flow [2024-06-14 14:42:58,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:58,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:58,202 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-14 14:42:58,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 14:42:58,202 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:42:58,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:58,202 INFO L85 PathProgramCache]: Analyzing trace with hash 641031492, now seen corresponding path program 5 times [2024-06-14 14:42:58,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:58,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600964641] [2024-06-14 14:42:58,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:58,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:06,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:06,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600964641] [2024-06-14 14:43:06,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600964641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:06,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:06,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:43:06,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465502355] [2024-06-14 14:43:06,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:06,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:43:06,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:06,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:43:06,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:43:07,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:43:07,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 271 transitions, 2779 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:07,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:07,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:43:07,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:07,584 INFO L124 PetriNetUnfolderBase]: 694/1210 cut-off events. [2024-06-14 14:43:07,585 INFO L125 PetriNetUnfolderBase]: For 136063/136063 co-relation queries the response was YES. [2024-06-14 14:43:07,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8892 conditions, 1210 events. 694/1210 cut-off events. For 136063/136063 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6106 event pairs, 64 based on Foata normal form. 2/1211 useless extension candidates. Maximal degree in co-relation 8750. Up to 1059 conditions per place. [2024-06-14 14:43:07,598 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 243 selfloop transitions, 43 changer transitions 0/288 dead transitions. [2024-06-14 14:43:07,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 288 transitions, 3399 flow [2024-06-14 14:43:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:07,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 14:43:07,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-14 14:43:07,599 INFO L175 Difference]: Start difference. First operand has 296 places, 271 transitions, 2779 flow. Second operand 10 states and 124 transitions. [2024-06-14 14:43:07,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 288 transitions, 3399 flow [2024-06-14 14:43:07,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 288 transitions, 3221 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 14:43:07,983 INFO L231 Difference]: Finished difference. Result has 298 places, 271 transitions, 2691 flow [2024-06-14 14:43:07,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2601, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2691, PETRI_PLACES=298, PETRI_TRANSITIONS=271} [2024-06-14 14:43:07,984 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 266 predicate places. [2024-06-14 14:43:07,984 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 271 transitions, 2691 flow [2024-06-14 14:43:07,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:07,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:07,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:07,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 14:43:07,985 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:07,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash 848971748, now seen corresponding path program 16 times [2024-06-14 14:43:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:07,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788419658] [2024-06-14 14:43:07,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:07,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:17,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:17,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788419658] [2024-06-14 14:43:17,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788419658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:17,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:17,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:43:17,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952293061] [2024-06-14 14:43:17,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:17,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:43:17,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:17,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:43:17,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:43:17,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:43:17,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 271 transitions, 2691 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:17,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:17,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:43:17,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:18,043 INFO L124 PetriNetUnfolderBase]: 703/1225 cut-off events. [2024-06-14 14:43:18,044 INFO L125 PetriNetUnfolderBase]: For 143826/143826 co-relation queries the response was YES. [2024-06-14 14:43:18,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8990 conditions, 1225 events. 703/1225 cut-off events. For 143826/143826 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6208 event pairs, 75 based on Foata normal form. 3/1227 useless extension candidates. Maximal degree in co-relation 8847. Up to 1025 conditions per place. [2024-06-14 14:43:18,058 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 248 selfloop transitions, 45 changer transitions 0/295 dead transitions. [2024-06-14 14:43:18,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 295 transitions, 3441 flow [2024-06-14 14:43:18,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:43:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:43:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 14:43:18,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3746556473829201 [2024-06-14 14:43:18,060 INFO L175 Difference]: Start difference. First operand has 298 places, 271 transitions, 2691 flow. Second operand 11 states and 136 transitions. [2024-06-14 14:43:18,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 295 transitions, 3441 flow [2024-06-14 14:43:18,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 295 transitions, 3325 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 14:43:18,477 INFO L231 Difference]: Finished difference. Result has 299 places, 274 transitions, 2756 flow [2024-06-14 14:43:18,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2756, PETRI_PLACES=299, PETRI_TRANSITIONS=274} [2024-06-14 14:43:18,492 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 267 predicate places. [2024-06-14 14:43:18,493 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 274 transitions, 2756 flow [2024-06-14 14:43:18,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:18,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:18,493 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-14 14:43:18,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 14:43:18,493 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:18,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:18,494 INFO L85 PathProgramCache]: Analyzing trace with hash -239894634, now seen corresponding path program 6 times [2024-06-14 14:43:18,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:18,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667585933] [2024-06-14 14:43:18,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:18,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:26,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:26,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667585933] [2024-06-14 14:43:26,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667585933] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:26,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:26,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:43:26,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396173866] [2024-06-14 14:43:26,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:26,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:43:26,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:26,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:43:26,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:43:26,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:43:26,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 274 transitions, 2756 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:26,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:26,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:43:26,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:27,563 INFO L124 PetriNetUnfolderBase]: 713/1243 cut-off events. [2024-06-14 14:43:27,563 INFO L125 PetriNetUnfolderBase]: For 141855/141855 co-relation queries the response was YES. [2024-06-14 14:43:27,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9151 conditions, 1243 events. 713/1243 cut-off events. For 141855/141855 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6335 event pairs, 79 based on Foata normal form. 2/1244 useless extension candidates. Maximal degree in co-relation 9007. Up to 1159 conditions per place. [2024-06-14 14:43:27,579 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 263 selfloop transitions, 28 changer transitions 0/293 dead transitions. [2024-06-14 14:43:27,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 293 transitions, 3437 flow [2024-06-14 14:43:27,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 14:43:27,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575757575757576 [2024-06-14 14:43:27,580 INFO L175 Difference]: Start difference. First operand has 299 places, 274 transitions, 2756 flow. Second operand 10 states and 118 transitions. [2024-06-14 14:43:27,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 293 transitions, 3437 flow [2024-06-14 14:43:27,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 293 transitions, 3276 flow, removed 36 selfloop flow, removed 9 redundant places. [2024-06-14 14:43:27,972 INFO L231 Difference]: Finished difference. Result has 301 places, 278 transitions, 2718 flow [2024-06-14 14:43:27,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2599, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2718, PETRI_PLACES=301, PETRI_TRANSITIONS=278} [2024-06-14 14:43:27,973 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 269 predicate places. [2024-06-14 14:43:27,973 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 278 transitions, 2718 flow [2024-06-14 14:43:27,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:27,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:27,974 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-14 14:43:27,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 14:43:27,974 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:27,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1544833882, now seen corresponding path program 17 times [2024-06-14 14:43:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:27,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537461439] [2024-06-14 14:43:27,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:27,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:37,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:37,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537461439] [2024-06-14 14:43:37,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537461439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:37,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:37,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:43:37,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064567597] [2024-06-14 14:43:37,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:37,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:43:37,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:37,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:43:37,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:43:37,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:43:37,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 278 transitions, 2718 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:37,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:37,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:43:37,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:38,031 INFO L124 PetriNetUnfolderBase]: 722/1258 cut-off events. [2024-06-14 14:43:38,031 INFO L125 PetriNetUnfolderBase]: For 149596/149596 co-relation queries the response was YES. [2024-06-14 14:43:38,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9202 conditions, 1258 events. 722/1258 cut-off events. For 149596/149596 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6417 event pairs, 71 based on Foata normal form. 3/1260 useless extension candidates. Maximal degree in co-relation 9056. Up to 1050 conditions per place. [2024-06-14 14:43:38,045 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 251 selfloop transitions, 48 changer transitions 0/301 dead transitions. [2024-06-14 14:43:38,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 301 transitions, 3480 flow [2024-06-14 14:43:38,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:43:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:43:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 14:43:38,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371900826446281 [2024-06-14 14:43:38,047 INFO L175 Difference]: Start difference. First operand has 301 places, 278 transitions, 2718 flow. Second operand 11 states and 135 transitions. [2024-06-14 14:43:38,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 301 transitions, 3480 flow [2024-06-14 14:43:38,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 301 transitions, 3410 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 14:43:38,474 INFO L231 Difference]: Finished difference. Result has 305 places, 281 transitions, 2841 flow [2024-06-14 14:43:38,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2648, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2841, PETRI_PLACES=305, PETRI_TRANSITIONS=281} [2024-06-14 14:43:38,474 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 273 predicate places. [2024-06-14 14:43:38,474 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 281 transitions, 2841 flow [2024-06-14 14:43:38,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:38,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:38,475 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-14 14:43:38,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 14:43:38,475 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:38,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1551089992, now seen corresponding path program 18 times [2024-06-14 14:43:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:38,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859375135] [2024-06-14 14:43:38,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:38,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:47,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:47,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859375135] [2024-06-14 14:43:47,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859375135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:47,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:47,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:43:47,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174746057] [2024-06-14 14:43:47,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:47,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:43:47,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:47,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:43:47,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:43:47,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:43:47,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 281 transitions, 2841 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:47,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:47,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:43:47,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:47,878 INFO L124 PetriNetUnfolderBase]: 725/1263 cut-off events. [2024-06-14 14:43:47,878 INFO L125 PetriNetUnfolderBase]: For 142664/142664 co-relation queries the response was YES. [2024-06-14 14:43:47,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9360 conditions, 1263 events. 725/1263 cut-off events. For 142664/142664 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6439 event pairs, 79 based on Foata normal form. 1/1263 useless extension candidates. Maximal degree in co-relation 9213. Up to 1191 conditions per place. [2024-06-14 14:43:47,889 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 264 selfloop transitions, 33 changer transitions 0/299 dead transitions. [2024-06-14 14:43:47,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 299 transitions, 3561 flow [2024-06-14 14:43:47,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:43:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:43:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-14 14:43:47,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33608815426997246 [2024-06-14 14:43:47,891 INFO L175 Difference]: Start difference. First operand has 305 places, 281 transitions, 2841 flow. Second operand 11 states and 122 transitions. [2024-06-14 14:43:47,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 299 transitions, 3561 flow [2024-06-14 14:43:48,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 299 transitions, 3390 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-06-14 14:43:48,348 INFO L231 Difference]: Finished difference. Result has 308 places, 286 transitions, 2835 flow [2024-06-14 14:43:48,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2672, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2835, PETRI_PLACES=308, PETRI_TRANSITIONS=286} [2024-06-14 14:43:48,348 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 276 predicate places. [2024-06-14 14:43:48,349 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 286 transitions, 2835 flow [2024-06-14 14:43:48,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:48,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:48,349 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-14 14:43:48,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 14:43:48,349 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:48,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:48,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1314610708, now seen corresponding path program 7 times [2024-06-14 14:43:48,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:48,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681761169] [2024-06-14 14:43:48,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:48,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15