./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.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-06-19_11-23-25.files/mutex-meet-rel/mix021_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb4cb34f 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/mix021_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix021_power.oepc_pso.oepc_rmo.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-eb4cb34-m [2024-06-21 18:41:43,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-21 18:41:43,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-21 18:41:43,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-21 18:41:43,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-21 18:41:43,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-21 18:41:43,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-21 18:41:43,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-21 18:41:43,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-21 18:41:43,885 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-21 18:41:43,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-21 18:41:43,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-21 18:41:43,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-21 18:41:43,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-21 18:41:43,888 INFO L153 SettingsManager]: * Use SBE=true [2024-06-21 18:41:43,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-21 18:41:43,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-21 18:41:43,889 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-21 18:41:43,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-21 18:41:43,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-21 18:41:43,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-21 18:41:43,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-21 18:41:43,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-21 18:41:43,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-21 18:41:43,891 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-21 18:41:43,891 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-21 18:41:43,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-21 18:41:43,892 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-21 18:41:43,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-21 18:41:43,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-21 18:41:43,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-21 18:41:43,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-21 18:41:43,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-21 18:41:43,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-21 18:41:43,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-21 18:41:43,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-21 18:41:43,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-21 18:41:43,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-21 18:41:43,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-21 18:41:43,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-21 18:41:43,896 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-21 18:41:43,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-21 18:41:43,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-21 18:41:43,896 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-21 18:41:44,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-21 18:41:44,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-21 18:41:44,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-21 18:41:44,161 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-21 18:41:44,162 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-21 18:41:44,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix021_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-21 18:41:44,282 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-21 18:41:44,283 INFO L274 PluginConnector]: CDTParser initialized [2024-06-21 18:41:44,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2024-06-21 18:41:45,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-21 18:41:45,734 INFO L384 CDTParser]: Found 1 translation units. [2024-06-21 18:41:45,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2024-06-21 18:41:45,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe0b8a92/1368d3c6aea9463aaeb56801150dda1e/FLAG621eec018 [2024-06-21 18:41:45,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe0b8a92/1368d3c6aea9463aaeb56801150dda1e [2024-06-21 18:41:45,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-21 18:41:45,771 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-21 18:41:45,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-21 18:41:45,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-21 18:41:45,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-21 18:41:45,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 06:41:44" (1/2) ... [2024-06-21 18:41:45,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8372d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:41:45, skipping insertion in model container [2024-06-21 18:41:45,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 06:41:44" (1/2) ... [2024-06-21 18:41:45,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7df99a90 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 06:41:45, skipping insertion in model container [2024-06-21 18:41:45,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 06:41:45" (2/2) ... [2024-06-21 18:41:45,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8372d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:45, skipping insertion in model container [2024-06-21 18:41:45,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 06:41:45" (2/2) ... [2024-06-21 18:41:45,787 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-21 18:41:45,821 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-21 18:41:45,822 INFO L97 edCorrectnessWitness]: Location invariant before [L869-L869] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-21 18:41:45,823 INFO L97 edCorrectnessWitness]: Location invariant before [L871-L871] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-21 18:41:45,823 INFO L97 edCorrectnessWitness]: Location invariant before [L867-L867] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-21 18:41:45,823 INFO L97 edCorrectnessWitness]: Location invariant before [L872-L872] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-21 18:41:45,824 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-21 18:41:45,824 INFO L106 edCorrectnessWitness]: ghost_update [L865-L865] multithreaded = 1; [2024-06-21 18:41:45,872 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-21 18:41:46,279 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-21 18:41:46,294 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-21 18:41:46,597 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-21 18:41:46,636 INFO L206 MainTranslator]: Completed translation [2024-06-21 18:41:46,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:46 WrapperNode [2024-06-21 18:41:46,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-21 18:41:46,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-21 18:41:46,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-21 18:41:46,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-21 18:41:46,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:46" (1/1) ... [2024-06-21 18:41:46,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:46" (1/1) ... [2024-06-21 18:41:46,747 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-06-21 18:41:46,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-21 18:41:46,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-21 18:41:46,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-21 18:41:46,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-21 18:41:46,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:46" (1/1) ... [2024-06-21 18:41:46,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:46" (1/1) ... [2024-06-21 18:41:46,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:46" (1/1) ... [2024-06-21 18:41:46,820 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-21 18:41:46,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:46" (1/1) ... [2024-06-21 18:41:46,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:46" (1/1) ... [2024-06-21 18:41:46,846 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:46" (1/1) ... [2024-06-21 18:41:46,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:46" (1/1) ... [2024-06-21 18:41:46,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:46" (1/1) ... [2024-06-21 18:41:46,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:46" (1/1) ... [2024-06-21 18:41:46,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-21 18:41:46,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-21 18:41:46,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-21 18:41:46,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-21 18:41:46,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:46" (1/1) ... [2024-06-21 18:41:46,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-21 18:41:46,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-21 18:41:46,913 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-21 18:41:46,924 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-21 18:41:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-21 18:41:46,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-21 18:41:46,957 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-21 18:41:46,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-21 18:41:46,958 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-21 18:41:46,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-21 18:41:46,958 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-21 18:41:46,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-21 18:41:46,958 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-21 18:41:46,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-21 18:41:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-21 18:41:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-21 18:41:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-21 18:41:46,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-21 18:41:46,962 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-21 18:41:47,121 INFO L244 CfgBuilder]: Building ICFG [2024-06-21 18:41:47,123 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-21 18:41:47,817 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-21 18:41:47,817 INFO L293 CfgBuilder]: Performing block encoding [2024-06-21 18:41:48,016 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-21 18:41:48,017 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-21 18:41:48,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 06:41:48 BoogieIcfgContainer [2024-06-21 18:41:48,018 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-21 18:41:48,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-21 18:41:48,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-21 18:41:48,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-21 18:41:48,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 06:41:44" (1/4) ... [2024-06-21 18:41:48,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3957ecca and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 21.06 06:41:48, skipping insertion in model container [2024-06-21 18:41:48,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.06 06:41:45" (2/4) ... [2024-06-21 18:41:48,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3957ecca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 06:41:48, skipping insertion in model container [2024-06-21 18:41:48,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 06:41:46" (3/4) ... [2024-06-21 18:41:48,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3957ecca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 06:41:48, skipping insertion in model container [2024-06-21 18:41:48,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 06:41:48" (4/4) ... [2024-06-21 18:41:48,030 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2024-06-21 18:41:48,048 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-21 18:41:48,048 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-21 18:41:48,048 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-21 18:41:48,133 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-21 18:41:48,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 52 transitions, 120 flow [2024-06-21 18:41:48,222 INFO L124 PetriNetUnfolderBase]: 0/48 cut-off events. [2024-06-21 18:41:48,222 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-21 18:41:48,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 0/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-21 18:41:48,226 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 52 transitions, 120 flow [2024-06-21 18:41:48,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 42 transitions, 96 flow [2024-06-21 18:41:48,247 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-21 18:41:48,256 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;@104525f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-21 18:41:48,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-21 18:41:48,262 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-21 18:41:48,262 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-21 18:41:48,262 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-21 18:41:48,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:41:48,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-21 18:41:48,264 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:41:48,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:41:48,272 INFO L85 PathProgramCache]: Analyzing trace with hash 400592535, now seen corresponding path program 1 times [2024-06-21 18:41:48,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:41:48,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779068315] [2024-06-21 18:41:48,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:41:48,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:41:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:41:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:41:50,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:41:50,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779068315] [2024-06-21 18:41:50,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779068315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:41:50,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:41:50,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-21 18:41:50,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331776111] [2024-06-21 18:41:50,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:41:50,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-21 18:41:50,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:41:50,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-21 18:41:50,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-21 18:41:50,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-21 18:41:50,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:41:50,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:41:50,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-21 18:41:50,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:41:53,860 INFO L124 PetriNetUnfolderBase]: 14075/18998 cut-off events. [2024-06-21 18:41:53,860 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2024-06-21 18:41:53,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38514 conditions, 18998 events. 14075/18998 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 99024 event pairs, 11070 based on Foata normal form. 1/18739 useless extension candidates. Maximal degree in co-relation 38501. Up to 18981 conditions per place. [2024-06-21 18:41:53,982 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 45 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2024-06-21 18:41:53,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 233 flow [2024-06-21 18:41:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-21 18:41:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-21 18:41:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-06-21 18:41:53,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2024-06-21 18:41:53,996 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 96 flow. Second operand 3 states and 93 transitions. [2024-06-21 18:41:53,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 233 flow [2024-06-21 18:41:54,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 226 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-21 18:41:54,006 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 131 flow [2024-06-21 18:41:54,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-21 18:41:54,010 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2024-06-21 18:41:54,011 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 131 flow [2024-06-21 18:41:54,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:41:54,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:41:54,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:41:54,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-21 18:41:54,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:41:54,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:41:54,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1577601866, now seen corresponding path program 1 times [2024-06-21 18:41:54,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:41:54,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7333514] [2024-06-21 18:41:54,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:41:54,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:41:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:41:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:41:55,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:41:55,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7333514] [2024-06-21 18:41:55,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7333514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:41:55,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:41:55,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-21 18:41:55,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352586898] [2024-06-21 18:41:55,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:41:55,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-21 18:41:55,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:41:55,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-21 18:41:55,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-21 18:41:55,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-21 18:41:55,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:41:55,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:41:55,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-21 18:41:55,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:41:58,931 INFO L124 PetriNetUnfolderBase]: 14065/18984 cut-off events. [2024-06-21 18:41:58,931 INFO L125 PetriNetUnfolderBase]: For 3511/3526 co-relation queries the response was YES. [2024-06-21 18:41:58,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43117 conditions, 18984 events. 14065/18984 cut-off events. For 3511/3526 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 98579 event pairs, 10115 based on Foata normal form. 7/18987 useless extension candidates. Maximal degree in co-relation 43105. Up to 18946 conditions per place. [2024-06-21 18:41:59,028 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 55 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2024-06-21 18:41:59,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 325 flow [2024-06-21 18:41:59,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-21 18:41:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-21 18:41:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-06-21 18:41:59,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2024-06-21 18:41:59,034 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 131 flow. Second operand 4 states and 120 transitions. [2024-06-21 18:41:59,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 325 flow [2024-06-21 18:41:59,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-21 18:41:59,040 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 179 flow [2024-06-21 18:41:59,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-06-21 18:41:59,041 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2024-06-21 18:41:59,042 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 179 flow [2024-06-21 18:41:59,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:41:59,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:41:59,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:41:59,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-21 18:41:59,046 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:41:59,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:41:59,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1661016634, now seen corresponding path program 1 times [2024-06-21 18:41:59,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:41:59,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277109323] [2024-06-21 18:41:59,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:41:59,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:41:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:42:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:42:00,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:42:00,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277109323] [2024-06-21 18:42:00,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277109323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:42:00,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:42:00,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-21 18:42:00,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875207302] [2024-06-21 18:42:00,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:42:00,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-21 18:42:00,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:42:00,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-21 18:42:00,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-21 18:42:01,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-21 18:42:01,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:42:01,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:42:01,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-21 18:42:01,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:42:03,321 INFO L124 PetriNetUnfolderBase]: 14083/19012 cut-off events. [2024-06-21 18:42:03,321 INFO L125 PetriNetUnfolderBase]: For 10006/10033 co-relation queries the response was YES. [2024-06-21 18:42:03,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47793 conditions, 19012 events. 14083/19012 cut-off events. For 10006/10033 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 98563 event pairs, 8523 based on Foata normal form. 13/19017 useless extension candidates. Maximal degree in co-relation 47779. Up to 18867 conditions per place. [2024-06-21 18:42:03,620 INFO L140 encePairwiseOnDemand]: 40/52 looper letters, 73 selfloop transitions, 21 changer transitions 0/100 dead transitions. [2024-06-21 18:42:03,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 541 flow [2024-06-21 18:42:03,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-21 18:42:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-21 18:42:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2024-06-21 18:42:03,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6038461538461538 [2024-06-21 18:42:03,625 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 179 flow. Second operand 5 states and 157 transitions. [2024-06-21 18:42:03,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 541 flow [2024-06-21 18:42:03,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 100 transitions, 522 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-21 18:42:03,632 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 310 flow [2024-06-21 18:42:03,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2024-06-21 18:42:03,634 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2024-06-21 18:42:03,634 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 310 flow [2024-06-21 18:42:03,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:42:03,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:42:03,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:42:03,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-21 18:42:03,635 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:42:03,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:42:03,636 INFO L85 PathProgramCache]: Analyzing trace with hash 131209775, now seen corresponding path program 1 times [2024-06-21 18:42:03,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:42:03,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696839398] [2024-06-21 18:42:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:42:03,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:42:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:42:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:42:06,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:42:06,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696839398] [2024-06-21 18:42:06,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696839398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:42:06,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:42:06,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:42:06,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227675204] [2024-06-21 18:42:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:42:06,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:42:06,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:42:06,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:42:06,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:42:06,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-21 18:42:06,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-21 18:42:06,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:42:06,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-21 18:42:06,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:42:08,960 INFO L124 PetriNetUnfolderBase]: 14101/19037 cut-off events. [2024-06-21 18:42:08,960 INFO L125 PetriNetUnfolderBase]: For 23431/23493 co-relation queries the response was YES. [2024-06-21 18:42:08,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55055 conditions, 19037 events. 14101/19037 cut-off events. For 23431/23493 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 98762 event pairs, 7568 based on Foata normal form. 23/19052 useless extension candidates. Maximal degree in co-relation 55038. Up to 18853 conditions per place. [2024-06-21 18:42:09,097 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 83 selfloop transitions, 26 changer transitions 0/115 dead transitions. [2024-06-21 18:42:09,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 115 transitions, 710 flow [2024-06-21 18:42:09,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 18:42:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 18:42:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2024-06-21 18:42:09,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.592948717948718 [2024-06-21 18:42:09,103 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 310 flow. Second operand 6 states and 185 transitions. [2024-06-21 18:42:09,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 115 transitions, 710 flow [2024-06-21 18:42:09,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 115 transitions, 698 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-21 18:42:09,120 INFO L231 Difference]: Finished difference. Result has 68 places, 69 transitions, 404 flow [2024-06-21 18:42:09,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=68, PETRI_TRANSITIONS=69} [2024-06-21 18:42:09,122 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places. [2024-06-21 18:42:09,122 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 404 flow [2024-06-21 18:42:09,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-21 18:42:09,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:42:09,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:42:09,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-21 18:42:09,123 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:42:09,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:42:09,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1490880453, now seen corresponding path program 1 times [2024-06-21 18:42:09,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:42:09,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29806093] [2024-06-21 18:42:09,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:42:09,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:42:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:42:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:42:11,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:42:11,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29806093] [2024-06-21 18:42:11,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29806093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:42:11,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:42:11,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 18:42:11,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347004826] [2024-06-21 18:42:11,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:42:11,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 18:42:11,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:42:11,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 18:42:11,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-21 18:42:12,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-21 18:42:12,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 404 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:42:12,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:42:12,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-21 18:42:12,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:42:14,451 INFO L124 PetriNetUnfolderBase]: 14130/19080 cut-off events. [2024-06-21 18:42:14,451 INFO L125 PetriNetUnfolderBase]: For 37240/37298 co-relation queries the response was YES. [2024-06-21 18:42:14,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60721 conditions, 19080 events. 14130/19080 cut-off events. For 37240/37298 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 99058 event pairs, 6467 based on Foata normal form. 30/19102 useless extension candidates. Maximal degree in co-relation 60700. Up to 18818 conditions per place. [2024-06-21 18:42:14,592 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 90 selfloop transitions, 31 changer transitions 0/126 dead transitions. [2024-06-21 18:42:14,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 126 transitions, 856 flow [2024-06-21 18:42:14,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:42:14,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:42:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2024-06-21 18:42:14,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168269230769231 [2024-06-21 18:42:14,598 INFO L175 Difference]: Start difference. First operand has 68 places, 69 transitions, 404 flow. Second operand 8 states and 215 transitions. [2024-06-21 18:42:14,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 126 transitions, 856 flow [2024-06-21 18:42:14,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 126 transitions, 790 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-21 18:42:14,615 INFO L231 Difference]: Finished difference. Result has 71 places, 72 transitions, 445 flow [2024-06-21 18:42:14,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=445, PETRI_PLACES=71, PETRI_TRANSITIONS=72} [2024-06-21 18:42:14,619 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2024-06-21 18:42:14,620 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 72 transitions, 445 flow [2024-06-21 18:42:14,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:42:14,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:42:14,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:42:14,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-21 18:42:14,621 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:42:14,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:42:14,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1084653298, now seen corresponding path program 1 times [2024-06-21 18:42:14,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:42:14,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071309214] [2024-06-21 18:42:14,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:42:14,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:42:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:42:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:42:16,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:42:16,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071309214] [2024-06-21 18:42:16,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071309214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:42:16,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:42:16,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-21 18:42:16,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125565945] [2024-06-21 18:42:16,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:42:16,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-21 18:42:16,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:42:16,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-21 18:42:16,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-21 18:42:16,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-21 18:42:16,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 72 transitions, 445 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:42:16,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:42:16,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-21 18:42:16,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:42:19,140 INFO L124 PetriNetUnfolderBase]: 14121/19065 cut-off events. [2024-06-21 18:42:19,140 INFO L125 PetriNetUnfolderBase]: For 52680/52714 co-relation queries the response was YES. [2024-06-21 18:42:19,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65138 conditions, 19065 events. 14121/19065 cut-off events. For 52680/52714 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 99015 event pairs, 7483 based on Foata normal form. 14/19076 useless extension candidates. Maximal degree in co-relation 65115. Up to 19033 conditions per place. [2024-06-21 18:42:19,286 INFO L140 encePairwiseOnDemand]: 41/52 looper letters, 73 selfloop transitions, 12 changer transitions 0/90 dead transitions. [2024-06-21 18:42:19,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 671 flow [2024-06-21 18:42:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-21 18:42:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-21 18:42:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-06-21 18:42:19,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-06-21 18:42:19,291 INFO L175 Difference]: Start difference. First operand has 71 places, 72 transitions, 445 flow. Second operand 5 states and 120 transitions. [2024-06-21 18:42:19,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 671 flow [2024-06-21 18:42:19,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 90 transitions, 580 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-21 18:42:19,310 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 410 flow [2024-06-21 18:42:19,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2024-06-21 18:42:19,314 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2024-06-21 18:42:19,314 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 410 flow [2024-06-21 18:42:19,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:42:19,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:42:19,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:42:19,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-21 18:42:19,315 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:42:19,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:42:19,315 INFO L85 PathProgramCache]: Analyzing trace with hash -736436588, now seen corresponding path program 1 times [2024-06-21 18:42:19,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:42:19,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730218249] [2024-06-21 18:42:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:42:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:42:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:42:21,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-21 18:42:21,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:42:21,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730218249] [2024-06-21 18:42:21,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730218249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:42:21,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:42:21,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:42:21,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790210087] [2024-06-21 18:42:21,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:42:21,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:42:21,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:42:21,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:42:21,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:42:21,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-21 18:42:21,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 410 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-21 18:42:21,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:42:21,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-21 18:42:21,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:42:24,233 INFO L124 PetriNetUnfolderBase]: 14145/19099 cut-off events. [2024-06-21 18:42:24,233 INFO L125 PetriNetUnfolderBase]: For 58256/58269 co-relation queries the response was YES. [2024-06-21 18:42:24,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66259 conditions, 19099 events. 14145/19099 cut-off events. For 58256/58269 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 98617 event pairs, 7102 based on Foata normal form. 19/19112 useless extension candidates. Maximal degree in co-relation 66233. Up to 18955 conditions per place. [2024-06-21 18:42:24,356 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 88 selfloop transitions, 24 changer transitions 0/117 dead transitions. [2024-06-21 18:42:24,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 117 transitions, 850 flow [2024-06-21 18:42:24,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 18:42:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 18:42:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-06-21 18:42:24,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2024-06-21 18:42:24,359 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 410 flow. Second operand 6 states and 152 transitions. [2024-06-21 18:42:24,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 117 transitions, 850 flow [2024-06-21 18:42:24,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 117 transitions, 835 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-21 18:42:24,384 INFO L231 Difference]: Finished difference. Result has 77 places, 88 transitions, 587 flow [2024-06-21 18:42:24,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=587, PETRI_PLACES=77, PETRI_TRANSITIONS=88} [2024-06-21 18:42:24,385 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 22 predicate places. [2024-06-21 18:42:24,385 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 88 transitions, 587 flow [2024-06-21 18:42:24,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-21 18:42:24,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:42:24,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:42:24,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-21 18:42:24,386 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:42:24,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:42:24,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2047968495, now seen corresponding path program 1 times [2024-06-21 18:42:24,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:42:24,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608013038] [2024-06-21 18:42:24,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:42:24,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:42:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:42:26,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-21 18:42:26,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:42:26,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608013038] [2024-06-21 18:42:26,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608013038] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:42:26,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:42:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:42:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091525189] [2024-06-21 18:42:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:42:26,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:42:26,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:42:26,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:42:26,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:42:26,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-21 18:42:26,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 88 transitions, 587 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-21 18:42:26,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:42:26,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-21 18:42:26,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:42:28,778 INFO L124 PetriNetUnfolderBase]: 14294/19322 cut-off events. [2024-06-21 18:42:28,778 INFO L125 PetriNetUnfolderBase]: For 85349/85470 co-relation queries the response was YES. [2024-06-21 18:42:28,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74188 conditions, 19322 events. 14294/19322 cut-off events. For 85349/85470 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 99527 event pairs, 7290 based on Foata normal form. 33/19343 useless extension candidates. Maximal degree in co-relation 74157. Up to 19162 conditions per place. [2024-06-21 18:42:28,915 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 101 selfloop transitions, 27 changer transitions 0/133 dead transitions. [2024-06-21 18:42:28,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 133 transitions, 1076 flow [2024-06-21 18:42:28,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 18:42:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 18:42:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-06-21 18:42:28,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2024-06-21 18:42:28,917 INFO L175 Difference]: Start difference. First operand has 77 places, 88 transitions, 587 flow. Second operand 6 states and 150 transitions. [2024-06-21 18:42:28,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 133 transitions, 1076 flow [2024-06-21 18:42:28,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 133 transitions, 1059 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-21 18:42:28,977 INFO L231 Difference]: Finished difference. Result has 83 places, 104 transitions, 782 flow [2024-06-21 18:42:28,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=782, PETRI_PLACES=83, PETRI_TRANSITIONS=104} [2024-06-21 18:42:28,977 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 28 predicate places. [2024-06-21 18:42:28,978 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 104 transitions, 782 flow [2024-06-21 18:42:28,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-21 18:42:28,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:42:28,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:42:28,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-21 18:42:28,978 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:42:28,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:42:28,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1325211631, now seen corresponding path program 2 times [2024-06-21 18:42:28,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:42:28,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178745519] [2024-06-21 18:42:28,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:42:28,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:42:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:42:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:42:30,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:42:30,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178745519] [2024-06-21 18:42:30,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178745519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:42:30,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:42:30,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:42:30,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712919067] [2024-06-21 18:42:30,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:42:30,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:42:30,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:42:30,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:42:30,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:42:30,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-21 18:42:30,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 104 transitions, 782 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-21 18:42:30,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:42:30,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-21 18:42:30,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:42:33,208 INFO L124 PetriNetUnfolderBase]: 14279/19297 cut-off events. [2024-06-21 18:42:33,208 INFO L125 PetriNetUnfolderBase]: For 93863/93921 co-relation queries the response was YES. [2024-06-21 18:42:33,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75227 conditions, 19297 events. 14279/19297 cut-off events. For 93863/93921 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 99518 event pairs, 7283 based on Foata normal form. 26/19315 useless extension candidates. Maximal degree in co-relation 75192. Up to 19234 conditions per place. [2024-06-21 18:42:33,341 INFO L140 encePairwiseOnDemand]: 40/52 looper letters, 107 selfloop transitions, 16 changer transitions 0/128 dead transitions. [2024-06-21 18:42:33,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 128 transitions, 1098 flow [2024-06-21 18:42:33,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 18:42:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 18:42:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-06-21 18:42:33,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551282051282051 [2024-06-21 18:42:33,343 INFO L175 Difference]: Start difference. First operand has 83 places, 104 transitions, 782 flow. Second operand 6 states and 142 transitions. [2024-06-21 18:42:33,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 128 transitions, 1098 flow [2024-06-21 18:42:33,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 128 transitions, 1071 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-21 18:42:33,429 INFO L231 Difference]: Finished difference. Result has 87 places, 105 transitions, 810 flow [2024-06-21 18:42:33,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=810, PETRI_PLACES=87, PETRI_TRANSITIONS=105} [2024-06-21 18:42:33,430 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places. [2024-06-21 18:42:33,431 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 105 transitions, 810 flow [2024-06-21 18:42:33,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-21 18:42:33,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:42:33,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:42:33,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-21 18:42:33,431 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:42:33,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:42:33,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2046645299, now seen corresponding path program 3 times [2024-06-21 18:42:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:42:33,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918213397] [2024-06-21 18:42:33,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:42:33,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:42:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:42:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:42:35,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:42:35,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918213397] [2024-06-21 18:42:35,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918213397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:42:35,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:42:35,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 18:42:35,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740670352] [2024-06-21 18:42:35,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:42:35,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 18:42:35,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:42:35,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 18:42:35,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-21 18:42:35,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-21 18:42:35,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 105 transitions, 810 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-21 18:42:35,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:42:35,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-21 18:42:35,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:42:38,132 INFO L124 PetriNetUnfolderBase]: 14384/19448 cut-off events. [2024-06-21 18:42:38,132 INFO L125 PetriNetUnfolderBase]: For 107598/107765 co-relation queries the response was YES. [2024-06-21 18:42:38,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77611 conditions, 19448 events. 14384/19448 cut-off events. For 107598/107765 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 100252 event pairs, 7267 based on Foata normal form. 51/19483 useless extension candidates. Maximal degree in co-relation 77574. Up to 19128 conditions per place. [2024-06-21 18:42:38,246 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 99 selfloop transitions, 59 changer transitions 0/163 dead transitions. [2024-06-21 18:42:38,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 163 transitions, 1441 flow [2024-06-21 18:42:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 18:42:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 18:42:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2024-06-21 18:42:38,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2024-06-21 18:42:38,248 INFO L175 Difference]: Start difference. First operand has 87 places, 105 transitions, 810 flow. Second operand 6 states and 162 transitions. [2024-06-21 18:42:38,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 163 transitions, 1441 flow [2024-06-21 18:42:38,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 163 transitions, 1390 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-21 18:42:38,328 INFO L231 Difference]: Finished difference. Result has 91 places, 129 transitions, 1162 flow [2024-06-21 18:42:38,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1162, PETRI_PLACES=91, PETRI_TRANSITIONS=129} [2024-06-21 18:42:38,329 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 36 predicate places. [2024-06-21 18:42:38,329 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 129 transitions, 1162 flow [2024-06-21 18:42:38,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-21 18:42:38,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:42:38,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:42:38,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-21 18:42:38,330 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:42:38,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:42:38,331 INFO L85 PathProgramCache]: Analyzing trace with hash -937485163, now seen corresponding path program 1 times [2024-06-21 18:42:38,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:42:38,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597072934] [2024-06-21 18:42:38,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:42:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:42:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:42:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:42:40,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:42:40,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597072934] [2024-06-21 18:42:40,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597072934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:42:40,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:42:40,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:42:40,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277343918] [2024-06-21 18:42:40,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:42:40,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:42:40,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:42:40,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:42:40,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:42:40,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-21 18:42:40,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 129 transitions, 1162 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-21 18:42:40,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:42:40,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-21 18:42:40,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:42:43,027 INFO L124 PetriNetUnfolderBase]: 14762/19981 cut-off events. [2024-06-21 18:42:43,027 INFO L125 PetriNetUnfolderBase]: For 126212/126292 co-relation queries the response was YES. [2024-06-21 18:42:43,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82282 conditions, 19981 events. 14762/19981 cut-off events. For 126212/126292 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 103112 event pairs, 6749 based on Foata normal form. 33/19982 useless extension candidates. Maximal degree in co-relation 82243. Up to 19237 conditions per place. [2024-06-21 18:42:43,154 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 134 selfloop transitions, 58 changer transitions 0/197 dead transitions. [2024-06-21 18:42:43,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 197 transitions, 2030 flow [2024-06-21 18:42:43,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:42:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:42:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-06-21 18:42:43,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054945054945055 [2024-06-21 18:42:43,156 INFO L175 Difference]: Start difference. First operand has 91 places, 129 transitions, 1162 flow. Second operand 7 states and 184 transitions. [2024-06-21 18:42:43,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 197 transitions, 2030 flow [2024-06-21 18:42:43,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 197 transitions, 1924 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-21 18:42:43,265 INFO L231 Difference]: Finished difference. Result has 98 places, 153 transitions, 1461 flow [2024-06-21 18:42:43,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1461, PETRI_PLACES=98, PETRI_TRANSITIONS=153} [2024-06-21 18:42:43,266 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 43 predicate places. [2024-06-21 18:42:43,266 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 153 transitions, 1461 flow [2024-06-21 18:42:43,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-21 18:42:43,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:42:43,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:42:43,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-21 18:42:43,267 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:42:43,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:42:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1868113331, now seen corresponding path program 2 times [2024-06-21 18:42:43,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:42:43,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578493441] [2024-06-21 18:42:43,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:42:43,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:42:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:42:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:42:44,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:42:44,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578493441] [2024-06-21 18:42:44,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578493441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:42:44,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:42:44,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:42:44,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776788661] [2024-06-21 18:42:44,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:42:44,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:42:44,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:42:44,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:42:44,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:42:45,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-21 18:42:45,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 153 transitions, 1461 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-21 18:42:45,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:42:45,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-21 18:42:45,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:42:47,778 INFO L124 PetriNetUnfolderBase]: 14805/20026 cut-off events. [2024-06-21 18:42:47,778 INFO L125 PetriNetUnfolderBase]: For 164376/164428 co-relation queries the response was YES. [2024-06-21 18:42:47,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91899 conditions, 20026 events. 14805/20026 cut-off events. For 164376/164428 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 103569 event pairs, 6817 based on Foata normal form. 13/20012 useless extension candidates. Maximal degree in co-relation 91854. Up to 19751 conditions per place. [2024-06-21 18:42:47,952 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 164 selfloop transitions, 35 changer transitions 0/204 dead transitions. [2024-06-21 18:42:47,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 204 transitions, 2265 flow [2024-06-21 18:42:47,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:42:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:42:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2024-06-21 18:42:47,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48626373626373626 [2024-06-21 18:42:47,954 INFO L175 Difference]: Start difference. First operand has 98 places, 153 transitions, 1461 flow. Second operand 7 states and 177 transitions. [2024-06-21 18:42:47,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 204 transitions, 2265 flow [2024-06-21 18:42:48,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 204 transitions, 2210 flow, removed 26 selfloop flow, removed 1 redundant places. [2024-06-21 18:42:48,124 INFO L231 Difference]: Finished difference. Result has 105 places, 163 transitions, 1622 flow [2024-06-21 18:42:48,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1622, PETRI_PLACES=105, PETRI_TRANSITIONS=163} [2024-06-21 18:42:48,125 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 50 predicate places. [2024-06-21 18:42:48,125 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 163 transitions, 1622 flow [2024-06-21 18:42:48,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-21 18:42:48,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:42:48,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:42:48,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-21 18:42:48,126 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:42:48,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:42:48,127 INFO L85 PathProgramCache]: Analyzing trace with hash 954064691, now seen corresponding path program 3 times [2024-06-21 18:42:48,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:42:48,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006942826] [2024-06-21 18:42:48,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:42:48,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:42:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:42:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:42:49,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:42:49,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006942826] [2024-06-21 18:42:49,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006942826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:42:49,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:42:49,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:42:49,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704774697] [2024-06-21 18:42:49,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:42:49,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:42:49,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:42:49,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:42:49,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:42:49,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-21 18:42:49,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 163 transitions, 1622 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-21 18:42:49,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:42:49,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-21 18:42:49,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:42:52,658 INFO L124 PetriNetUnfolderBase]: 14817/20042 cut-off events. [2024-06-21 18:42:52,658 INFO L125 PetriNetUnfolderBase]: For 194799/194851 co-relation queries the response was YES. [2024-06-21 18:42:52,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96005 conditions, 20042 events. 14817/20042 cut-off events. For 194799/194851 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 103462 event pairs, 6817 based on Foata normal form. 13/20028 useless extension candidates. Maximal degree in co-relation 95956. Up to 19866 conditions per place. [2024-06-21 18:42:52,827 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 170 selfloop transitions, 29 changer transitions 0/204 dead transitions. [2024-06-21 18:42:52,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 204 transitions, 2300 flow [2024-06-21 18:42:52,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:42:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:42:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-06-21 18:42:52,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47527472527472525 [2024-06-21 18:42:52,828 INFO L175 Difference]: Start difference. First operand has 105 places, 163 transitions, 1622 flow. Second operand 7 states and 173 transitions. [2024-06-21 18:42:52,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 204 transitions, 2300 flow [2024-06-21 18:42:53,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 204 transitions, 2231 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-21 18:42:53,033 INFO L231 Difference]: Finished difference. Result has 110 places, 170 transitions, 1726 flow [2024-06-21 18:42:53,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1726, PETRI_PLACES=110, PETRI_TRANSITIONS=170} [2024-06-21 18:42:53,034 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 55 predicate places. [2024-06-21 18:42:53,034 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 170 transitions, 1726 flow [2024-06-21 18:42:53,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-21 18:42:53,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:42:53,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:42:53,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-21 18:42:53,035 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:42:53,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:42:53,036 INFO L85 PathProgramCache]: Analyzing trace with hash -978504239, now seen corresponding path program 4 times [2024-06-21 18:42:53,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:42:53,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237572734] [2024-06-21 18:42:53,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:42:53,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:42:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:42:55,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:42:55,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:42:55,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237572734] [2024-06-21 18:42:55,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237572734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:42:55,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:42:55,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:42:55,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136135922] [2024-06-21 18:42:55,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:42:55,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:42:55,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:42:55,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:42:55,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:42:55,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-21 18:42:55,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 170 transitions, 1726 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-21 18:42:55,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:42:55,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-21 18:42:55,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:42:58,777 INFO L124 PetriNetUnfolderBase]: 15488/20950 cut-off events. [2024-06-21 18:42:58,777 INFO L125 PetriNetUnfolderBase]: For 225345/225554 co-relation queries the response was YES. [2024-06-21 18:42:58,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103316 conditions, 20950 events. 15488/20950 cut-off events. For 225345/225554 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 108513 event pairs, 6733 based on Foata normal form. 58/20968 useless extension candidates. Maximal degree in co-relation 103263. Up to 19533 conditions per place. [2024-06-21 18:42:58,949 INFO L140 encePairwiseOnDemand]: 35/52 looper letters, 162 selfloop transitions, 123 changer transitions 0/290 dead transitions. [2024-06-21 18:42:58,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 290 transitions, 3400 flow [2024-06-21 18:42:58,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:42:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:42:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2024-06-21 18:42:58,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168269230769231 [2024-06-21 18:42:58,951 INFO L175 Difference]: Start difference. First operand has 110 places, 170 transitions, 1726 flow. Second operand 8 states and 215 transitions. [2024-06-21 18:42:58,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 290 transitions, 3400 flow [2024-06-21 18:42:59,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 290 transitions, 3285 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-06-21 18:42:59,137 INFO L231 Difference]: Finished difference. Result has 117 places, 223 transitions, 2530 flow [2024-06-21 18:42:59,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1648, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2530, PETRI_PLACES=117, PETRI_TRANSITIONS=223} [2024-06-21 18:42:59,138 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 62 predicate places. [2024-06-21 18:42:59,138 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 223 transitions, 2530 flow [2024-06-21 18:42:59,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-21 18:42:59,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:42:59,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:42:59,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-21 18:42:59,139 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:42:59,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:42:59,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1868359409, now seen corresponding path program 1 times [2024-06-21 18:42:59,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:42:59,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520292669] [2024-06-21 18:42:59,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:42:59,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:42:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:43:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:43:01,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:43:01,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520292669] [2024-06-21 18:43:01,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520292669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:43:01,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:43:01,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:43:01,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532027143] [2024-06-21 18:43:01,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:43:01,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:43:01,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:43:01,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:43:01,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:43:02,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-21 18:43:02,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 223 transitions, 2530 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:43:02,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:43:02,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-21 18:43:02,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:43:06,307 INFO L124 PetriNetUnfolderBase]: 15508/20987 cut-off events. [2024-06-21 18:43:06,308 INFO L125 PetriNetUnfolderBase]: For 282939/283123 co-relation queries the response was YES. [2024-06-21 18:43:06,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114322 conditions, 20987 events. 15508/20987 cut-off events. For 282939/283123 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 108551 event pairs, 6741 based on Foata normal form. 18/20962 useless extension candidates. Maximal degree in co-relation 114265. Up to 20708 conditions per place. [2024-06-21 18:43:06,462 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 222 selfloop transitions, 35 changer transitions 0/262 dead transitions. [2024-06-21 18:43:06,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 262 transitions, 3330 flow [2024-06-21 18:43:06,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 18:43:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 18:43:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-06-21 18:43:06,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44711538461538464 [2024-06-21 18:43:06,464 INFO L175 Difference]: Start difference. First operand has 117 places, 223 transitions, 2530 flow. Second operand 8 states and 186 transitions. [2024-06-21 18:43:06,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 262 transitions, 3330 flow [2024-06-21 18:43:06,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 262 transitions, 3260 flow, removed 34 selfloop flow, removed 1 redundant places. [2024-06-21 18:43:06,741 INFO L231 Difference]: Finished difference. Result has 124 places, 227 transitions, 2603 flow [2024-06-21 18:43:06,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2464, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2603, PETRI_PLACES=124, PETRI_TRANSITIONS=227} [2024-06-21 18:43:06,742 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 69 predicate places. [2024-06-21 18:43:06,742 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 227 transitions, 2603 flow [2024-06-21 18:43:06,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:43:06,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:43:06,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:43:06,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-21 18:43:06,742 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:43:06,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:43:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1137705497, now seen corresponding path program 1 times [2024-06-21 18:43:06,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:43:06,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510796405] [2024-06-21 18:43:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:43:06,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:43:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:43:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:43:08,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:43:08,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510796405] [2024-06-21 18:43:08,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510796405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:43:08,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:43:08,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-21 18:43:08,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082456253] [2024-06-21 18:43:08,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:43:08,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-21 18:43:08,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:43:08,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-21 18:43:08,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-21 18:43:08,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-21 18:43:08,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 227 transitions, 2603 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-21 18:43:08,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:43:08,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-21 18:43:08,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:43:12,275 INFO L124 PetriNetUnfolderBase]: 15501/20976 cut-off events. [2024-06-21 18:43:12,275 INFO L125 PetriNetUnfolderBase]: For 299860/300003 co-relation queries the response was YES. [2024-06-21 18:43:12,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115626 conditions, 20976 events. 15501/20976 cut-off events. For 299860/300003 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 108625 event pairs, 6901 based on Foata normal form. 19/20955 useless extension candidates. Maximal degree in co-relation 115566. Up to 20867 conditions per place. [2024-06-21 18:43:12,596 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 223 selfloop transitions, 12 changer transitions 0/240 dead transitions. [2024-06-21 18:43:12,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 240 transitions, 3119 flow [2024-06-21 18:43:12,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-21 18:43:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-21 18:43:12,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-21 18:43:12,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2024-06-21 18:43:12,598 INFO L175 Difference]: Start difference. First operand has 124 places, 227 transitions, 2603 flow. Second operand 5 states and 116 transitions. [2024-06-21 18:43:12,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 240 transitions, 3119 flow [2024-06-21 18:43:12,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 240 transitions, 2972 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-21 18:43:12,826 INFO L231 Difference]: Finished difference. Result has 123 places, 227 transitions, 2491 flow [2024-06-21 18:43:12,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2456, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2491, PETRI_PLACES=123, PETRI_TRANSITIONS=227} [2024-06-21 18:43:12,826 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 68 predicate places. [2024-06-21 18:43:12,827 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 227 transitions, 2491 flow [2024-06-21 18:43:12,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-21 18:43:12,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:43:12,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:43:12,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-21 18:43:12,827 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:43:12,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:43:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash 998916750, now seen corresponding path program 1 times [2024-06-21 18:43:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:43:12,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908755998] [2024-06-21 18:43:12,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:43:12,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:43:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:43:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:43:15,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:43:15,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908755998] [2024-06-21 18:43:15,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908755998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:43:15,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:43:15,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:43:15,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712979319] [2024-06-21 18:43:15,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:43:15,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:43:15,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:43:15,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:43:15,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:43:15,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-21 18:43:15,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 227 transitions, 2491 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:43:15,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:43:15,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-21 18:43:15,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:43:18,940 INFO L124 PetriNetUnfolderBase]: 15599/21123 cut-off events. [2024-06-21 18:43:18,940 INFO L125 PetriNetUnfolderBase]: For 322390/322657 co-relation queries the response was YES. [2024-06-21 18:43:19,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117342 conditions, 21123 events. 15599/21123 cut-off events. For 322390/322657 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 109075 event pairs, 6713 based on Foata normal form. 56/21132 useless extension candidates. Maximal degree in co-relation 117281. Up to 20728 conditions per place. [2024-06-21 18:43:19,092 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 216 selfloop transitions, 54 changer transitions 0/275 dead transitions. [2024-06-21 18:43:19,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 275 transitions, 3396 flow [2024-06-21 18:43:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:43:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:43:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-06-21 18:43:19,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47527472527472525 [2024-06-21 18:43:19,094 INFO L175 Difference]: Start difference. First operand has 123 places, 227 transitions, 2491 flow. Second operand 7 states and 173 transitions. [2024-06-21 18:43:19,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 275 transitions, 3396 flow [2024-06-21 18:43:19,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 275 transitions, 3379 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-21 18:43:19,308 INFO L231 Difference]: Finished difference. Result has 128 places, 240 transitions, 2771 flow [2024-06-21 18:43:19,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2474, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2771, PETRI_PLACES=128, PETRI_TRANSITIONS=240} [2024-06-21 18:43:19,308 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 73 predicate places. [2024-06-21 18:43:19,309 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 240 transitions, 2771 flow [2024-06-21 18:43:19,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:43:19,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:43:19,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:43:19,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-21 18:43:19,309 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:43:19,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:43:19,310 INFO L85 PathProgramCache]: Analyzing trace with hash 999006960, now seen corresponding path program 2 times [2024-06-21 18:43:19,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:43:19,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984085499] [2024-06-21 18:43:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:43:19,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:43:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:43:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:43:21,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:43:21,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984085499] [2024-06-21 18:43:21,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984085499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:43:21,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:43:21,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:43:21,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757494882] [2024-06-21 18:43:21,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:43:21,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:43:21,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:43:21,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:43:21,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:43:21,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-21 18:43:21,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 240 transitions, 2771 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:43:21,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:43:21,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-21 18:43:21,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 18:43:25,423 INFO L124 PetriNetUnfolderBase]: 15590/21113 cut-off events. [2024-06-21 18:43:25,423 INFO L125 PetriNetUnfolderBase]: For 364211/364436 co-relation queries the response was YES. [2024-06-21 18:43:25,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122105 conditions, 21113 events. 15590/21113 cut-off events. For 364211/364436 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 109194 event pairs, 6707 based on Foata normal form. 54/21122 useless extension candidates. Maximal degree in co-relation 122041. Up to 20778 conditions per place. [2024-06-21 18:43:25,559 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 216 selfloop transitions, 51 changer transitions 0/272 dead transitions. [2024-06-21 18:43:25,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 272 transitions, 3434 flow [2024-06-21 18:43:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 18:43:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 18:43:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-06-21 18:43:25,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-21 18:43:25,561 INFO L175 Difference]: Start difference. First operand has 128 places, 240 transitions, 2771 flow. Second operand 7 states and 169 transitions. [2024-06-21 18:43:25,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 272 transitions, 3434 flow [2024-06-21 18:43:25,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 272 transitions, 3289 flow, removed 50 selfloop flow, removed 3 redundant places. [2024-06-21 18:43:25,943 INFO L231 Difference]: Finished difference. Result has 132 places, 240 transitions, 2741 flow [2024-06-21 18:43:25,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2626, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2741, PETRI_PLACES=132, PETRI_TRANSITIONS=240} [2024-06-21 18:43:25,944 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 77 predicate places. [2024-06-21 18:43:25,944 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 240 transitions, 2741 flow [2024-06-21 18:43:25,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:43:25,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 18:43:25,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 18:43:25,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-21 18:43:25,945 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 18:43:25,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 18:43:25,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1766398569, now seen corresponding path program 1 times [2024-06-21 18:43:25,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 18:43:25,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360784890] [2024-06-21 18:43:25,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 18:43:25,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 18:43:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 18:43:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 18:43:27,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 18:43:27,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360784890] [2024-06-21 18:43:27,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360784890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 18:43:27,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 18:43:27,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 18:43:27,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768666763] [2024-06-21 18:43:27,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 18:43:27,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 18:43:27,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 18:43:27,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 18:43:27,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 18:43:27,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-21 18:43:27,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 240 transitions, 2741 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 18:43:27,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 18:43:27,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-21 18:43:27,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand