./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix055_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/mix055_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/mix055_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix055_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-7724a2d-m [2024-06-27 23:58:35,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:58:35,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:58:35,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:58:35,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:58:35,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:58:35,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:58:35,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:58:35,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:58:35,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:58:35,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:58:35,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:58:35,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:58:35,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:58:35,597 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:58:35,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:58:35,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:58:35,599 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:58:35,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:58:35,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:58:35,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:58:35,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:58:35,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:58:35,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:58:35,604 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:58:35,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:58:35,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:58:35,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:58:35,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:58:35,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:58:35,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:58:35,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:58:35,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:58:35,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:58:35,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:58:35,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:58:35,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:58:35,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:58:35,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:58:35,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:58:35,613 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:58:35,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:58:35,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:58:35,614 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-27 23:58:35,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:58:35,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:58:35,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:58:35,892 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:58:35,892 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:58:35,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:58:36,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:58:37,124 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:58:37,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:58:37,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c3f4ba5/3dc9d5f7c07446e5b9670dcfa5424a66/FLAG997709201 [2024-06-27 23:58:37,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c3f4ba5/3dc9d5f7c07446e5b9670dcfa5424a66 [2024-06-27 23:58:37,151 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:58:37,157 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:58:37,158 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/mix055_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 23:58:37,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:58:37,250 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:58:37,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:58:37,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:58:37,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:58:37,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:58:37" (1/2) ... [2024-06-27 23:58:37,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a43a868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:58:37, skipping insertion in model container [2024-06-27 23:58:37,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:58:37" (1/2) ... [2024-06-27 23:58:37,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6da16856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:58:37, skipping insertion in model container [2024-06-27 23:58:37,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:58:37" (2/2) ... [2024-06-27 23:58:37,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a43a868 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37, skipping insertion in model container [2024-06-27 23:58:37,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:58:37" (2/2) ... [2024-06-27 23:58:37,260 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:58:37,288 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:58:37,289 INFO L97 edCorrectnessWitness]: Location invariant before [L864-L864] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (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_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_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 )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_EAX - (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-27 23:58:37,289 INFO L97 edCorrectnessWitness]: Location invariant before [L866-L866] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (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_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_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 )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_EAX - (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-27 23:58:37,291 INFO L97 edCorrectnessWitness]: Location invariant before [L867-L867] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (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_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_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 )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_EAX - (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-27 23:58:37,292 INFO L97 edCorrectnessWitness]: Location invariant before [L862-L862] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (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_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_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 )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_EAX - (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-27 23:58:37,292 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:58:37,292 INFO L106 edCorrectnessWitness]: ghost_update [L860-L860] multithreaded = 1; [2024-06-27 23:58:37,329 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:58:37,570 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:58:37,580 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-27 23:58:37,834 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:58:37,867 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:58:37,868 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37 WrapperNode [2024-06-27 23:58:37,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:58:37,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:58:37,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:58:37,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:58:37,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37" (1/1) ... [2024-06-27 23:58:37,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37" (1/1) ... [2024-06-27 23:58:37,982 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-06-27 23:58:37,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:58:37,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:58:37,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:58:37,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:58:37,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37" (1/1) ... [2024-06-27 23:58:37,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37" (1/1) ... [2024-06-27 23:58:37,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37" (1/1) ... [2024-06-27 23:58:38,038 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-27 23:58:38,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37" (1/1) ... [2024-06-27 23:58:38,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37" (1/1) ... [2024-06-27 23:58:38,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37" (1/1) ... [2024-06-27 23:58:38,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37" (1/1) ... [2024-06-27 23:58:38,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37" (1/1) ... [2024-06-27 23:58:38,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37" (1/1) ... [2024-06-27 23:58:38,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:58:38,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:58:38,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:58:38,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:58:38,209 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37" (1/1) ... [2024-06-27 23:58:38,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:58:38,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:58:38,241 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-27 23:58:38,274 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-27 23:58:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:58:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:58:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:58:38,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:58:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:58:38,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:58:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:58:38,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:58:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 23:58:38,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 23:58:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:58:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:58:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:58:38,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:58:38,291 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 23:58:38,424 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:58:38,426 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:58:38,956 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:58:38,957 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:58:39,140 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:58:39,140 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:58:39,141 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:58:39 BoogieIcfgContainer [2024-06-27 23:58:39,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:58:39,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:58:39,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:58:39,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:58:39,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:58:37" (1/4) ... [2024-06-27 23:58:39,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45610a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:58:39, skipping insertion in model container [2024-06-27 23:58:39,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:58:37" (2/4) ... [2024-06-27 23:58:39,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45610a3e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:58:39, skipping insertion in model container [2024-06-27 23:58:39,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:58:37" (3/4) ... [2024-06-27 23:58:39,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45610a3e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:58:39, skipping insertion in model container [2024-06-27 23:58:39,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:58:39" (4/4) ... [2024-06-27 23:58:39,150 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:58:39,162 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:58:39,162 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 23:58:39,162 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:58:39,222 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:58:39,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 51 transitions, 118 flow [2024-06-27 23:58:39,286 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2024-06-27 23:58:39,286 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:58:39,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 23:58:39,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 51 transitions, 118 flow [2024-06-27 23:58:39,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 41 transitions, 94 flow [2024-06-27 23:58:39,304 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:58:39,309 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;@2899f9d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:58:39,309 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 23:58:39,313 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:58:39,313 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 23:58:39,313 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:58:39,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:58:39,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:58:39,314 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-27 23:58:39,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:58:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash 394003208, now seen corresponding path program 1 times [2024-06-27 23:58:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:58:39,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927721542] [2024-06-27 23:58:39,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:58:39,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:58:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:58:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:58:40,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:58:40,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927721542] [2024-06-27 23:58:40,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927721542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:58:40,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:58:40,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:58:40,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110677310] [2024-06-27 23:58:40,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:58:40,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:58:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:58:40,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:58:40,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:58:40,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-06-27 23:58:40,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 94 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-27 23:58:40,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:58:40,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-06-27 23:58:40,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:58:42,794 INFO L124 PetriNetUnfolderBase]: 11595/15741 cut-off events. [2024-06-27 23:58:42,794 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2024-06-27 23:58:42,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31877 conditions, 15741 events. 11595/15741 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 82008 event pairs, 9068 based on Foata normal form. 1/15520 useless extension candidates. Maximal degree in co-relation 31864. Up to 15685 conditions per place. [2024-06-27 23:58:42,892 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 44 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-06-27 23:58:42,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 229 flow [2024-06-27 23:58:42,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:58:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:58:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-06-27 23:58:42,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013071895424836 [2024-06-27 23:58:42,903 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 94 flow. Second operand 3 states and 92 transitions. [2024-06-27 23:58:42,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 229 flow [2024-06-27 23:58:42,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 23:58:42,925 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 129 flow [2024-06-27 23:58:42,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2024-06-27 23:58:42,930 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2024-06-27 23:58:42,930 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 129 flow [2024-06-27 23:58:42,931 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-27 23:58:42,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:58:42,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:58:42,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:58:42,932 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-27 23:58:42,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:58:42,932 INFO L85 PathProgramCache]: Analyzing trace with hash 680618781, now seen corresponding path program 1 times [2024-06-27 23:58:42,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:58:42,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957607520] [2024-06-27 23:58:42,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:58:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:58:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:58:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:58:44,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:58:44,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957607520] [2024-06-27 23:58:44,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957607520] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:58:44,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:58:44,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:58:44,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094743740] [2024-06-27 23:58:44,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:58:44,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:58:44,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:58:44,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:58:44,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:58:44,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-06-27 23:58:44,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 129 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-27 23:58:44,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:58:44,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-06-27 23:58:44,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:58:45,970 INFO L124 PetriNetUnfolderBase]: 11585/15735 cut-off events. [2024-06-27 23:58:45,970 INFO L125 PetriNetUnfolderBase]: For 2898/2898 co-relation queries the response was YES. [2024-06-27 23:58:45,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35854 conditions, 15735 events. 11585/15735 cut-off events. For 2898/2898 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 81878 event pairs, 8249 based on Foata normal form. 4/15738 useless extension candidates. Maximal degree in co-relation 35842. Up to 15650 conditions per place. [2024-06-27 23:58:46,038 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 54 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2024-06-27 23:58:46,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 321 flow [2024-06-27 23:58:46,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:58:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:58:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-06-27 23:58:46,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-27 23:58:46,042 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 129 flow. Second operand 4 states and 119 transitions. [2024-06-27 23:58:46,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 321 flow [2024-06-27 23:58:46,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:58:46,046 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 177 flow [2024-06-27 23:58:46,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-06-27 23:58:46,047 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2024-06-27 23:58:46,048 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 177 flow [2024-06-27 23:58:46,050 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-27 23:58:46,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:58:46,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:58:46,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:58:46,051 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-27 23:58:46,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:58:46,056 INFO L85 PathProgramCache]: Analyzing trace with hash -375652567, now seen corresponding path program 1 times [2024-06-27 23:58:46,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:58:46,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369540019] [2024-06-27 23:58:46,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:58:46,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:58:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:58:47,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-27 23:58:47,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:58:47,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369540019] [2024-06-27 23:58:47,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369540019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:58:47,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:58:47,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:58:47,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040829347] [2024-06-27 23:58:47,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:58:47,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:58:47,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:58:47,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:58:47,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:58:47,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-06-27 23:58:47,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 177 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-27 23:58:47,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:58:47,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-06-27 23:58:47,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:58:49,253 INFO L124 PetriNetUnfolderBase]: 11693/15878 cut-off events. [2024-06-27 23:58:49,253 INFO L125 PetriNetUnfolderBase]: For 8562/8562 co-relation queries the response was YES. [2024-06-27 23:58:49,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40229 conditions, 15878 events. 11693/15878 cut-off events. For 8562/8562 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 83028 event pairs, 6700 based on Foata normal form. 10/15886 useless extension candidates. Maximal degree in co-relation 40215. Up to 15623 conditions per place. [2024-06-27 23:58:49,309 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 74 selfloop transitions, 21 changer transitions 0/101 dead transitions. [2024-06-27 23:58:49,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 101 transitions, 545 flow [2024-06-27 23:58:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:58:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:58:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-06-27 23:58:49,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6196078431372549 [2024-06-27 23:58:49,311 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 177 flow. Second operand 5 states and 158 transitions. [2024-06-27 23:58:49,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 101 transitions, 545 flow [2024-06-27 23:58:49,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 101 transitions, 526 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 23:58:49,315 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 310 flow [2024-06-27 23:58:49,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2024-06-27 23:58:49,316 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2024-06-27 23:58:49,316 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 310 flow [2024-06-27 23:58:49,316 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-27 23:58:49,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:58:49,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:58:49,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:58:49,317 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-27 23:58:49,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:58:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash 657855814, now seen corresponding path program 1 times [2024-06-27 23:58:49,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:58:49,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640669388] [2024-06-27 23:58:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:58:49,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:58:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:58:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:58:50,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:58:50,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640669388] [2024-06-27 23:58:50,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640669388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:58:50,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:58:50,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:58:50,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935347976] [2024-06-27 23:58:50,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:58:50,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:58:50,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:58:50,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:58:50,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:58:50,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-06-27 23:58:50,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 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-27 23:58:50,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:58:50,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-06-27 23:58:50,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:58:53,011 INFO L124 PetriNetUnfolderBase]: 11739/15944 cut-off events. [2024-06-27 23:58:53,012 INFO L125 PetriNetUnfolderBase]: For 20683/20685 co-relation queries the response was YES. [2024-06-27 23:58:53,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47691 conditions, 15944 events. 11739/15944 cut-off events. For 20683/20685 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 83230 event pairs, 5599 based on Foata normal form. 10/15952 useless extension candidates. Maximal degree in co-relation 47674. Up to 15545 conditions per place. [2024-06-27 23:58:53,115 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 89 selfloop transitions, 37 changer transitions 0/132 dead transitions. [2024-06-27 23:58:53,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 132 transitions, 856 flow [2024-06-27 23:58:53,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:58:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:58:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2024-06-27 23:58:53,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6241830065359477 [2024-06-27 23:58:53,119 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 310 flow. Second operand 6 states and 191 transitions. [2024-06-27 23:58:53,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 132 transitions, 856 flow [2024-06-27 23:58:53,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 132 transitions, 844 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-27 23:58:53,134 INFO L231 Difference]: Finished difference. Result has 70 places, 80 transitions, 548 flow [2024-06-27 23:58:53,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=548, PETRI_PLACES=70, PETRI_TRANSITIONS=80} [2024-06-27 23:58:53,136 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places. [2024-06-27 23:58:53,136 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 80 transitions, 548 flow [2024-06-27 23:58:53,136 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-27 23:58:53,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:58:53,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:58:53,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:58:53,137 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-27 23:58:53,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:58:53,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1081304482, now seen corresponding path program 1 times [2024-06-27 23:58:53,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:58:53,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600896617] [2024-06-27 23:58:53,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:58:53,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:58:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:58:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:58:54,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:58:54,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600896617] [2024-06-27 23:58:54,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600896617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:58:54,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:58:54,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:58:54,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257466652] [2024-06-27 23:58:54,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:58:54,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:58:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:58:54,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:58:54,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:58:54,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-06-27 23:58:54,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 80 transitions, 548 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:58:54,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:58:54,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-06-27 23:58:54,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:58:57,059 INFO L124 PetriNetUnfolderBase]: 11926/16233 cut-off events. [2024-06-27 23:58:57,059 INFO L125 PetriNetUnfolderBase]: For 39110/39115 co-relation queries the response was YES. [2024-06-27 23:58:57,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56038 conditions, 16233 events. 11926/16233 cut-off events. For 39110/39115 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 85424 event pairs, 4656 based on Foata normal form. 40/16271 useless extension candidates. Maximal degree in co-relation 56015. Up to 15546 conditions per place. [2024-06-27 23:58:57,155 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 100 selfloop transitions, 40 changer transitions 0/146 dead transitions. [2024-06-27 23:58:57,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 146 transitions, 1090 flow [2024-06-27 23:58:57,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:58:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:58:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 218 transitions. [2024-06-27 23:58:57,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6106442577030813 [2024-06-27 23:58:57,158 INFO L175 Difference]: Start difference. First operand has 70 places, 80 transitions, 548 flow. Second operand 7 states and 218 transitions. [2024-06-27 23:58:57,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 146 transitions, 1090 flow [2024-06-27 23:58:57,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 146 transitions, 1068 flow, removed 11 selfloop flow, removed 0 redundant places. [2024-06-27 23:58:57,175 INFO L231 Difference]: Finished difference. Result has 76 places, 82 transitions, 643 flow [2024-06-27 23:58:57,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=643, PETRI_PLACES=76, PETRI_TRANSITIONS=82} [2024-06-27 23:58:57,178 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 22 predicate places. [2024-06-27 23:58:57,178 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 82 transitions, 643 flow [2024-06-27 23:58:57,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:58:57,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:58:57,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:58:57,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:58:57,179 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-27 23:58:57,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:58:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2090783415, now seen corresponding path program 1 times [2024-06-27 23:58:57,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:58:57,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578798755] [2024-06-27 23:58:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:58:57,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:58:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:58:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:58:58,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:58:58,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578798755] [2024-06-27 23:58:58,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578798755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:58:58,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:58:58,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:58:58,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358181076] [2024-06-27 23:58:58,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:58:58,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:58:58,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:58:58,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:58:58,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:58:58,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2024-06-27 23:58:58,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 82 transitions, 643 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-27 23:58:58,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:58:58,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2024-06-27 23:58:58,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:59:00,778 INFO L124 PetriNetUnfolderBase]: 11908/16265 cut-off events. [2024-06-27 23:59:00,778 INFO L125 PetriNetUnfolderBase]: For 53633/53633 co-relation queries the response was YES. [2024-06-27 23:59:00,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58952 conditions, 16265 events. 11908/16265 cut-off events. For 53633/53633 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 86939 event pairs, 7306 based on Foata normal form. 6/16267 useless extension candidates. Maximal degree in co-relation 58925. Up to 16118 conditions per place. [2024-06-27 23:59:00,875 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 80 selfloop transitions, 15 changer transitions 0/100 dead transitions. [2024-06-27 23:59:00,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 100 transitions, 893 flow [2024-06-27 23:59:00,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:59:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:59:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-06-27 23:59:00,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2024-06-27 23:59:00,877 INFO L175 Difference]: Start difference. First operand has 76 places, 82 transitions, 643 flow. Second operand 5 states and 120 transitions. [2024-06-27 23:59:00,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 100 transitions, 893 flow [2024-06-27 23:59:00,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 100 transitions, 794 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-27 23:59:00,895 INFO L231 Difference]: Finished difference. Result has 77 places, 84 transitions, 611 flow [2024-06-27 23:59:00,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=611, PETRI_PLACES=77, PETRI_TRANSITIONS=84} [2024-06-27 23:59:00,897 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2024-06-27 23:59:00,898 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 84 transitions, 611 flow [2024-06-27 23:59:00,898 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-27 23:59:00,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:59:00,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:59:00,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:59:00,898 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-27 23:59:00,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:59:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash -933510408, now seen corresponding path program 1 times [2024-06-27 23:59:00,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:59:00,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070196606] [2024-06-27 23:59:00,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:59:00,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:59:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:59:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:59:02,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:59:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070196606] [2024-06-27 23:59:02,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070196606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:59:02,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:59:02,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:59:02,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770567152] [2024-06-27 23:59:02,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:59:02,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:59:02,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:59:02,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:59:02,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:59:02,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2024-06-27 23:59:02,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 84 transitions, 611 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-27 23:59:02,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:59:02,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2024-06-27 23:59:02,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:59:04,870 INFO L124 PetriNetUnfolderBase]: 12307/16799 cut-off events. [2024-06-27 23:59:04,870 INFO L125 PetriNetUnfolderBase]: For 58020/58044 co-relation queries the response was YES. [2024-06-27 23:59:04,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62215 conditions, 16799 events. 12307/16799 cut-off events. For 58020/58044 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 88870 event pairs, 5183 based on Foata normal form. 33/16830 useless extension candidates. Maximal degree in co-relation 62185. Up to 16087 conditions per place. [2024-06-27 23:59:04,958 INFO L140 encePairwiseOnDemand]: 34/51 looper letters, 100 selfloop transitions, 59 changer transitions 0/164 dead transitions. [2024-06-27 23:59:04,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 164 transitions, 1427 flow [2024-06-27 23:59:04,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:59:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:59:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-06-27 23:59:04,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2024-06-27 23:59:04,960 INFO L175 Difference]: Start difference. First operand has 77 places, 84 transitions, 611 flow. Second operand 7 states and 182 transitions. [2024-06-27 23:59:04,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 164 transitions, 1427 flow [2024-06-27 23:59:04,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 164 transitions, 1385 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 23:59:04,990 INFO L231 Difference]: Finished difference. Result has 83 places, 125 transitions, 1111 flow [2024-06-27 23:59:04,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1111, PETRI_PLACES=83, PETRI_TRANSITIONS=125} [2024-06-27 23:59:04,990 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2024-06-27 23:59:04,991 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 125 transitions, 1111 flow [2024-06-27 23:59:04,991 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-27 23:59:04,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:59:04,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:59:04,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:59:04,991 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-27 23:59:04,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:59:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1694994892, now seen corresponding path program 2 times [2024-06-27 23:59:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:59:04,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24953784] [2024-06-27 23:59:04,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:59:04,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:59:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:59:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:59:06,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:59:06,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24953784] [2024-06-27 23:59:06,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24953784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:59:06,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:59:06,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:59:06,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143538028] [2024-06-27 23:59:06,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:59:06,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:59:06,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:59:06,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:59:06,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:59:06,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2024-06-27 23:59:06,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 125 transitions, 1111 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-27 23:59:06,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:59:06,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2024-06-27 23:59:06,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:59:08,633 INFO L124 PetriNetUnfolderBase]: 12608/17293 cut-off events. [2024-06-27 23:59:08,634 INFO L125 PetriNetUnfolderBase]: For 87074/87074 co-relation queries the response was YES. [2024-06-27 23:59:08,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72270 conditions, 17293 events. 12608/17293 cut-off events. For 87074/87074 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 93046 event pairs, 6721 based on Foata normal form. 20/17308 useless extension candidates. Maximal degree in co-relation 72237. Up to 16726 conditions per place. [2024-06-27 23:59:08,740 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 141 selfloop transitions, 46 changer transitions 0/192 dead transitions. [2024-06-27 23:59:08,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 192 transitions, 2087 flow [2024-06-27 23:59:08,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:59:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:59:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-06-27 23:59:08,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4934640522875817 [2024-06-27 23:59:08,743 INFO L175 Difference]: Start difference. First operand has 83 places, 125 transitions, 1111 flow. Second operand 6 states and 151 transitions. [2024-06-27 23:59:08,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 192 transitions, 2087 flow [2024-06-27 23:59:08,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 192 transitions, 2030 flow, removed 23 selfloop flow, removed 2 redundant places. [2024-06-27 23:59:08,806 INFO L231 Difference]: Finished difference. Result has 88 places, 156 transitions, 1647 flow [2024-06-27 23:59:08,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1647, PETRI_PLACES=88, PETRI_TRANSITIONS=156} [2024-06-27 23:59:08,807 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 34 predicate places. [2024-06-27 23:59:08,807 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 156 transitions, 1647 flow [2024-06-27 23:59:08,807 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-27 23:59:08,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:59:08,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:59:08,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:59:08,808 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-27 23:59:08,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:59:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1635775370, now seen corresponding path program 3 times [2024-06-27 23:59:08,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:59:08,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762659446] [2024-06-27 23:59:08,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:59:08,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:59:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:59:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:59:10,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:59:10,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762659446] [2024-06-27 23:59:10,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762659446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:59:10,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:59:10,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:59:10,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040718204] [2024-06-27 23:59:10,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:59:10,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:59:10,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:59:10,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:59:10,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:59:10,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2024-06-27 23:59:10,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 156 transitions, 1647 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-27 23:59:10,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:59:10,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2024-06-27 23:59:10,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:59:12,382 INFO L124 PetriNetUnfolderBase]: 12539/17195 cut-off events. [2024-06-27 23:59:12,383 INFO L125 PetriNetUnfolderBase]: For 98402/98402 co-relation queries the response was YES. [2024-06-27 23:59:12,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73681 conditions, 17195 events. 12539/17195 cut-off events. For 98402/98402 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 92328 event pairs, 6736 based on Foata normal form. 10/17201 useless extension candidates. Maximal degree in co-relation 73645. Up to 16934 conditions per place. [2024-06-27 23:59:12,467 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 159 selfloop transitions, 19 changer transitions 0/183 dead transitions. [2024-06-27 23:59:12,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 183 transitions, 2113 flow [2024-06-27 23:59:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:59:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:59:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-06-27 23:59:12,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46405228758169936 [2024-06-27 23:59:12,471 INFO L175 Difference]: Start difference. First operand has 88 places, 156 transitions, 1647 flow. Second operand 6 states and 142 transitions. [2024-06-27 23:59:12,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 183 transitions, 2113 flow [2024-06-27 23:59:12,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 183 transitions, 2084 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-06-27 23:59:12,562 INFO L231 Difference]: Finished difference. Result has 93 places, 157 transitions, 1688 flow [2024-06-27 23:59:12,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1618, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1688, PETRI_PLACES=93, PETRI_TRANSITIONS=157} [2024-06-27 23:59:12,570 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places. [2024-06-27 23:59:12,584 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 157 transitions, 1688 flow [2024-06-27 23:59:12,584 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-27 23:59:12,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:59:12,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:59:12,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:59:12,585 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-27 23:59:12,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:59:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash 27451200, now seen corresponding path program 1 times [2024-06-27 23:59:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:59:12,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268403634] [2024-06-27 23:59:12,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:59:12,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:59:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:59:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:59:15,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:59:15,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268403634] [2024-06-27 23:59:15,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268403634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:59:15,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:59:15,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:59:15,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991764667] [2024-06-27 23:59:15,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:59:15,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:59:15,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:59:15,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:59:15,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:59:15,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-06-27 23:59:15,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 157 transitions, 1688 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:15,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:59:15,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-06-27 23:59:15,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:59:18,309 INFO L124 PetriNetUnfolderBase]: 15336/20897 cut-off events. [2024-06-27 23:59:18,309 INFO L125 PetriNetUnfolderBase]: For 128189/128189 co-relation queries the response was YES. [2024-06-27 23:59:18,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89218 conditions, 20897 events. 15336/20897 cut-off events. For 128189/128189 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 110260 event pairs, 8362 based on Foata normal form. 6/20902 useless extension candidates. Maximal degree in co-relation 89179. Up to 20635 conditions per place. [2024-06-27 23:59:18,446 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 168 selfloop transitions, 24 changer transitions 0/196 dead transitions. [2024-06-27 23:59:18,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 196 transitions, 2255 flow [2024-06-27 23:59:18,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:59:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:59:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-27 23:59:18,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41421568627450983 [2024-06-27 23:59:18,448 INFO L175 Difference]: Start difference. First operand has 93 places, 157 transitions, 1688 flow. Second operand 8 states and 169 transitions. [2024-06-27 23:59:18,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 196 transitions, 2255 flow [2024-06-27 23:59:18,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 196 transitions, 2203 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 23:59:18,565 INFO L231 Difference]: Finished difference. Result has 98 places, 166 transitions, 1806 flow [2024-06-27 23:59:18,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1806, PETRI_PLACES=98, PETRI_TRANSITIONS=166} [2024-06-27 23:59:18,565 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 44 predicate places. [2024-06-27 23:59:18,565 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 166 transitions, 1806 flow [2024-06-27 23:59:18,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:18,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:59:18,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:59:18,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:59:18,566 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:59:18,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:59:18,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1322025611, now seen corresponding path program 1 times [2024-06-27 23:59:18,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:59:18,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758038375] [2024-06-27 23:59:18,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:59:18,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:59:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:59:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:59:20,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:59:20,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758038375] [2024-06-27 23:59:20,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758038375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:59:20,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:59:20,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:59:20,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176855011] [2024-06-27 23:59:20,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:59:20,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:59:20,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:59:20,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:59:20,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:59:20,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-06-27 23:59:20,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 166 transitions, 1806 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:20,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:59:20,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-06-27 23:59:20,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:59:22,743 INFO L124 PetriNetUnfolderBase]: 15329/20888 cut-off events. [2024-06-27 23:59:22,744 INFO L125 PetriNetUnfolderBase]: For 150942/150942 co-relation queries the response was YES. [2024-06-27 23:59:22,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93813 conditions, 20888 events. 15329/20888 cut-off events. For 150942/150942 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 110194 event pairs, 8475 based on Foata normal form. 2/20889 useless extension candidates. Maximal degree in co-relation 93773. Up to 20703 conditions per place. [2024-06-27 23:59:22,907 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 167 selfloop transitions, 12 changer transitions 0/183 dead transitions. [2024-06-27 23:59:22,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 183 transitions, 2250 flow [2024-06-27 23:59:22,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:59:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:59:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-06-27 23:59:22,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43529411764705883 [2024-06-27 23:59:22,909 INFO L175 Difference]: Start difference. First operand has 98 places, 166 transitions, 1806 flow. Second operand 5 states and 111 transitions. [2024-06-27 23:59:22,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 183 transitions, 2250 flow [2024-06-27 23:59:23,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 183 transitions, 2178 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 23:59:23,058 INFO L231 Difference]: Finished difference. Result has 98 places, 170 transitions, 1817 flow [2024-06-27 23:59:23,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1817, PETRI_PLACES=98, PETRI_TRANSITIONS=170} [2024-06-27 23:59:23,059 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 44 predicate places. [2024-06-27 23:59:23,059 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 170 transitions, 1817 flow [2024-06-27 23:59:23,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:23,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:59:23,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:59:23,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:59:23,060 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-27 23:59:23,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:59:23,060 INFO L85 PathProgramCache]: Analyzing trace with hash 165923199, now seen corresponding path program 1 times [2024-06-27 23:59:23,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:59:23,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879872151] [2024-06-27 23:59:23,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:59:23,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:59:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:59:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:59:24,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:59:24,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879872151] [2024-06-27 23:59:24,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879872151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:59:24,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:59:24,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:59:24,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146542665] [2024-06-27 23:59:24,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:59:24,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:59:24,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:59:24,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:59:24,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:59:25,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-06-27 23:59:25,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 170 transitions, 1817 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:25,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:59:25,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-06-27 23:59:25,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:59:27,748 INFO L124 PetriNetUnfolderBase]: 15085/20575 cut-off events. [2024-06-27 23:59:27,748 INFO L125 PetriNetUnfolderBase]: For 168766/168887 co-relation queries the response was YES. [2024-06-27 23:59:27,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97857 conditions, 20575 events. 15085/20575 cut-off events. For 168766/168887 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 110328 event pairs, 6147 based on Foata normal form. 97/20627 useless extension candidates. Maximal degree in co-relation 97815. Up to 19311 conditions per place. [2024-06-27 23:59:27,925 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 117 selfloop transitions, 106 changer transitions 0/229 dead transitions. [2024-06-27 23:59:27,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 229 transitions, 2689 flow [2024-06-27 23:59:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:59:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:59:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 189 transitions. [2024-06-27 23:59:27,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2024-06-27 23:59:27,927 INFO L175 Difference]: Start difference. First operand has 98 places, 170 transitions, 1817 flow. Second operand 7 states and 189 transitions. [2024-06-27 23:59:27,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 229 transitions, 2689 flow [2024-06-27 23:59:28,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 229 transitions, 2656 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 23:59:28,090 INFO L231 Difference]: Finished difference. Result has 102 places, 178 transitions, 2107 flow [2024-06-27 23:59:28,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1784, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2107, PETRI_PLACES=102, PETRI_TRANSITIONS=178} [2024-06-27 23:59:28,091 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 48 predicate places. [2024-06-27 23:59:28,091 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 178 transitions, 2107 flow [2024-06-27 23:59:28,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:28,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:59:28,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:59:28,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:59:28,091 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-27 23:59:28,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:59:28,092 INFO L85 PathProgramCache]: Analyzing trace with hash 169617159, now seen corresponding path program 2 times [2024-06-27 23:59:28,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:59:28,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529569467] [2024-06-27 23:59:28,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:59:28,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:59:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:59:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:59:29,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:59:29,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529569467] [2024-06-27 23:59:29,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529569467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:59:29,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:59:29,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:59:29,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31821211] [2024-06-27 23:59:29,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:59:29,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:59:29,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:59:29,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:59:29,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:59:30,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-06-27 23:59:30,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 178 transitions, 2107 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:30,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:59:30,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-06-27 23:59:30,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:59:32,809 INFO L124 PetriNetUnfolderBase]: 14959/20414 cut-off events. [2024-06-27 23:59:32,809 INFO L125 PetriNetUnfolderBase]: For 187554/187637 co-relation queries the response was YES. [2024-06-27 23:59:32,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99291 conditions, 20414 events. 14959/20414 cut-off events. For 187554/187637 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 109652 event pairs, 6267 based on Foata normal form. 77/20448 useless extension candidates. Maximal degree in co-relation 99247. Up to 19484 conditions per place. [2024-06-27 23:59:32,996 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 132 selfloop transitions, 91 changer transitions 0/229 dead transitions. [2024-06-27 23:59:32,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 229 transitions, 2905 flow [2024-06-27 23:59:32,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:59:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:59:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2024-06-27 23:59:32,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5210084033613446 [2024-06-27 23:59:32,998 INFO L175 Difference]: Start difference. First operand has 102 places, 178 transitions, 2107 flow. Second operand 7 states and 186 transitions. [2024-06-27 23:59:32,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 229 transitions, 2905 flow [2024-06-27 23:59:33,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 229 transitions, 2643 flow, removed 48 selfloop flow, removed 4 redundant places. [2024-06-27 23:59:33,169 INFO L231 Difference]: Finished difference. Result has 105 places, 178 transitions, 2047 flow [2024-06-27 23:59:33,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2047, PETRI_PLACES=105, PETRI_TRANSITIONS=178} [2024-06-27 23:59:33,170 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 51 predicate places. [2024-06-27 23:59:33,170 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 178 transitions, 2047 flow [2024-06-27 23:59:33,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:33,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:59:33,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:59:33,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:59:33,171 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-27 23:59:33,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:59:33,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1266640417, now seen corresponding path program 1 times [2024-06-27 23:59:33,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:59:33,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690744652] [2024-06-27 23:59:33,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:59:33,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:59:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:59:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:59:35,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:59:35,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690744652] [2024-06-27 23:59:35,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690744652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:59:35,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:59:35,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:59:35,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142631934] [2024-06-27 23:59:35,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:59:35,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:59:35,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:59:35,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:59:35,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:59:35,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-06-27 23:59:35,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 178 transitions, 2047 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:35,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:59:35,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-06-27 23:59:35,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:59:38,942 INFO L124 PetriNetUnfolderBase]: 15480/21011 cut-off events. [2024-06-27 23:59:38,942 INFO L125 PetriNetUnfolderBase]: For 206238/206300 co-relation queries the response was YES. [2024-06-27 23:59:38,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103064 conditions, 21011 events. 15480/21011 cut-off events. For 206238/206300 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 108948 event pairs, 6464 based on Foata normal form. 60/21070 useless extension candidates. Maximal degree in co-relation 103019. Up to 20117 conditions per place. [2024-06-27 23:59:39,079 INFO L140 encePairwiseOnDemand]: 34/51 looper letters, 155 selfloop transitions, 103 changer transitions 0/262 dead transitions. [2024-06-27 23:59:39,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 262 transitions, 3306 flow [2024-06-27 23:59:39,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:59:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:59:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-06-27 23:59:39,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47549019607843135 [2024-06-27 23:59:39,090 INFO L175 Difference]: Start difference. First operand has 105 places, 178 transitions, 2047 flow. Second operand 8 states and 194 transitions. [2024-06-27 23:59:39,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 262 transitions, 3306 flow [2024-06-27 23:59:39,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 262 transitions, 3049 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-27 23:59:39,284 INFO L231 Difference]: Finished difference. Result has 110 places, 211 transitions, 2585 flow [2024-06-27 23:59:39,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2585, PETRI_PLACES=110, PETRI_TRANSITIONS=211} [2024-06-27 23:59:39,285 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 56 predicate places. [2024-06-27 23:59:39,286 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 211 transitions, 2585 flow [2024-06-27 23:59:39,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:39,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:59:39,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:59:39,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:59:39,286 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-27 23:59:39,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:59:39,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1729807691, now seen corresponding path program 2 times [2024-06-27 23:59:39,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:59:39,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519996053] [2024-06-27 23:59:39,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:59:39,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:59:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:59:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:59:41,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:59:41,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519996053] [2024-06-27 23:59:41,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519996053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:59:41,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:59:41,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:59:41,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732988810] [2024-06-27 23:59:41,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:59:41,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:59:41,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:59:41,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:59:41,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:59:41,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-06-27 23:59:41,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 211 transitions, 2585 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:41,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:59:41,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-06-27 23:59:41,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:59:44,562 INFO L124 PetriNetUnfolderBase]: 15597/21264 cut-off events. [2024-06-27 23:59:44,562 INFO L125 PetriNetUnfolderBase]: For 239400/239400 co-relation queries the response was YES. [2024-06-27 23:59:44,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107108 conditions, 21264 events. 15597/21264 cut-off events. For 239400/239400 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 112129 event pairs, 8341 based on Foata normal form. 3/21266 useless extension candidates. Maximal degree in co-relation 107060. Up to 20927 conditions per place. [2024-06-27 23:59:44,720 INFO L140 encePairwiseOnDemand]: 35/51 looper letters, 223 selfloop transitions, 36 changer transitions 0/263 dead transitions. [2024-06-27 23:59:44,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 263 transitions, 3457 flow [2024-06-27 23:59:44,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:59:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:59:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2024-06-27 23:59:44,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41612200435729846 [2024-06-27 23:59:44,725 INFO L175 Difference]: Start difference. First operand has 110 places, 211 transitions, 2585 flow. Second operand 9 states and 191 transitions. [2024-06-27 23:59:44,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 263 transitions, 3457 flow [2024-06-27 23:59:44,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 263 transitions, 3291 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-27 23:59:44,937 INFO L231 Difference]: Finished difference. Result has 115 places, 221 transitions, 2711 flow [2024-06-27 23:59:44,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2428, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2711, PETRI_PLACES=115, PETRI_TRANSITIONS=221} [2024-06-27 23:59:44,938 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 61 predicate places. [2024-06-27 23:59:44,938 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 221 transitions, 2711 flow [2024-06-27 23:59:44,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:44,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:59:44,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:59:44,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:59:44,939 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-27 23:59:44,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:59:44,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1966881003, now seen corresponding path program 1 times [2024-06-27 23:59:44,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:59:44,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766187683] [2024-06-27 23:59:44,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:59:44,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:59:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:59:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:59:47,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:59:47,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766187683] [2024-06-27 23:59:47,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766187683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:59:47,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:59:47,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:59:47,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251858809] [2024-06-27 23:59:47,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:59:47,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:59:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:59:47,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:59:47,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:59:47,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-06-27 23:59:47,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 221 transitions, 2711 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:47,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:59:47,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-06-27 23:59:47,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:59:50,312 INFO L124 PetriNetUnfolderBase]: 15603/21258 cut-off events. [2024-06-27 23:59:50,312 INFO L125 PetriNetUnfolderBase]: For 257965/257965 co-relation queries the response was YES. [2024-06-27 23:59:50,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108145 conditions, 21258 events. 15603/21258 cut-off events. For 257965/257965 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 111410 event pairs, 8303 based on Foata normal form. 6/21263 useless extension candidates. Maximal degree in co-relation 108096. Up to 21022 conditions per place. [2024-06-27 23:59:50,446 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 228 selfloop transitions, 24 changer transitions 0/256 dead transitions. [2024-06-27 23:59:50,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 256 transitions, 3469 flow [2024-06-27 23:59:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:59:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:59:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-06-27 23:59:50,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4477124183006536 [2024-06-27 23:59:50,447 INFO L175 Difference]: Start difference. First operand has 115 places, 221 transitions, 2711 flow. Second operand 6 states and 137 transitions. [2024-06-27 23:59:50,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 256 transitions, 3469 flow [2024-06-27 23:59:50,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 256 transitions, 3223 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-27 23:59:50,689 INFO L231 Difference]: Finished difference. Result has 113 places, 235 transitions, 2685 flow [2024-06-27 23:59:50,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2465, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2685, PETRI_PLACES=113, PETRI_TRANSITIONS=235} [2024-06-27 23:59:50,690 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 59 predicate places. [2024-06-27 23:59:50,690 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 235 transitions, 2685 flow [2024-06-27 23:59:50,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:50,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:59:50,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:59:50,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:59:50,692 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-27 23:59:50,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:59:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash -916605727, now seen corresponding path program 1 times [2024-06-27 23:59:50,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:59:50,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048105497] [2024-06-27 23:59:50,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:59:50,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:59:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:59:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:59:52,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:59:52,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048105497] [2024-06-27 23:59:52,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048105497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:59:52,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:59:52,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:59:52,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915090229] [2024-06-27 23:59:52,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:59:52,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:59:52,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:59:52,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:59:52,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:59:53,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-06-27 23:59:53,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 235 transitions, 2685 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:53,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:59:53,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-06-27 23:59:53,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:59:56,501 INFO L124 PetriNetUnfolderBase]: 15448/21221 cut-off events. [2024-06-27 23:59:56,502 INFO L125 PetriNetUnfolderBase]: For 294152/294274 co-relation queries the response was YES. [2024-06-27 23:59:56,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114858 conditions, 21221 events. 15448/21221 cut-off events. For 294152/294274 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 115097 event pairs, 4678 based on Foata normal form. 94/21271 useless extension candidates. Maximal degree in co-relation 114807. Up to 19004 conditions per place. [2024-06-27 23:59:56,651 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 161 selfloop transitions, 132 changer transitions 0/300 dead transitions. [2024-06-27 23:59:56,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 300 transitions, 3699 flow [2024-06-27 23:59:56,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:59:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:59:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions. [2024-06-27 23:59:56,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5220588235294118 [2024-06-27 23:59:56,654 INFO L175 Difference]: Start difference. First operand has 113 places, 235 transitions, 2685 flow. Second operand 8 states and 213 transitions. [2024-06-27 23:59:56,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 300 transitions, 3699 flow [2024-06-27 23:59:56,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 300 transitions, 3672 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-06-27 23:59:56,948 INFO L231 Difference]: Finished difference. Result has 121 places, 241 transitions, 3049 flow [2024-06-27 23:59:56,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2658, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3049, PETRI_PLACES=121, PETRI_TRANSITIONS=241} [2024-06-27 23:59:56,954 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 67 predicate places. [2024-06-27 23:59:56,954 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 241 transitions, 3049 flow [2024-06-27 23:59:56,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:56,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:59:56,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:59:56,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 23:59:56,955 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-27 23:59:56,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:59:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash 72895157, now seen corresponding path program 2 times [2024-06-27 23:59:56,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:59:56,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536707318] [2024-06-27 23:59:56,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:59:56,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:59:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:59:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:59:59,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:59:59,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536707318] [2024-06-27 23:59:59,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536707318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:59:59,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:59:59,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:59:59,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787113271] [2024-06-27 23:59:59,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:59:59,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:59:59,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:59:59,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:59:59,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:59:59,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-06-27 23:59:59,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 241 transitions, 3049 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:59:59,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:59:59,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-06-27 23:59:59,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:00:02,983 INFO L124 PetriNetUnfolderBase]: 15620/21488 cut-off events. [2024-06-28 00:00:02,983 INFO L125 PetriNetUnfolderBase]: For 337447/337565 co-relation queries the response was YES. [2024-06-28 00:00:03,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120806 conditions, 21488 events. 15620/21488 cut-off events. For 337447/337565 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 117151 event pairs, 5983 based on Foata normal form. 104/21550 useless extension candidates. Maximal degree in co-relation 120751. Up to 19877 conditions per place. [2024-06-28 00:00:03,225 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 163 selfloop transitions, 129 changer transitions 0/299 dead transitions. [2024-06-28 00:00:03,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 299 transitions, 3925 flow [2024-06-28 00:00:03,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:00:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:00:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-06-28 00:00:03,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2024-06-28 00:00:03,229 INFO L175 Difference]: Start difference. First operand has 121 places, 241 transitions, 3049 flow. Second operand 8 states and 208 transitions. [2024-06-28 00:00:03,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 299 transitions, 3925 flow [2024-06-28 00:00:03,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 299 transitions, 3796 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-28 00:00:03,747 INFO L231 Difference]: Finished difference. Result has 126 places, 243 transitions, 3239 flow [2024-06-28 00:00:03,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2922, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3239, PETRI_PLACES=126, PETRI_TRANSITIONS=243} [2024-06-28 00:00:03,748 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 72 predicate places. [2024-06-28 00:00:03,748 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 243 transitions, 3239 flow [2024-06-28 00:00:03,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:00:03,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:00:03,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:00:03,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 00:00:03,749 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-28 00:00:03,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:00:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash 963165557, now seen corresponding path program 3 times [2024-06-28 00:00:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:00:03,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810713289] [2024-06-28 00:00:03,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:00:03,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:00:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:00:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:00:06,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:00:06,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810713289] [2024-06-28 00:00:06,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810713289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:00:06,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:00:06,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:00:06,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933293323] [2024-06-28 00:00:06,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:00:06,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:00:06,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:00:06,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:00:06,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:00:06,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-06-28 00:00:06,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 243 transitions, 3239 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:00:06,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:00:06,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-06-28 00:00:06,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:00:11,736 INFO L124 PetriNetUnfolderBase]: 15541/21376 cut-off events. [2024-06-28 00:00:11,736 INFO L125 PetriNetUnfolderBase]: For 358485/358579 co-relation queries the response was YES. [2024-06-28 00:00:11,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122031 conditions, 21376 events. 15541/21376 cut-off events. For 358485/358579 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 116006 event pairs, 6047 based on Foata normal form. 95/21442 useless extension candidates. Maximal degree in co-relation 121974. Up to 20019 conditions per place. [2024-06-28 00:00:11,956 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 173 selfloop transitions, 121 changer transitions 0/301 dead transitions. [2024-06-28 00:00:11,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 301 transitions, 4103 flow [2024-06-28 00:00:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:00:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:00:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-06-28 00:00:11,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024509803921569 [2024-06-28 00:00:11,960 INFO L175 Difference]: Start difference. First operand has 126 places, 243 transitions, 3239 flow. Second operand 8 states and 205 transitions. [2024-06-28 00:00:11,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 301 transitions, 4103 flow [2024-06-28 00:00:12,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 301 transitions, 3807 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-28 00:00:12,857 INFO L231 Difference]: Finished difference. Result has 128 places, 243 transitions, 3197 flow [2024-06-28 00:00:12,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2943, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3197, PETRI_PLACES=128, PETRI_TRANSITIONS=243} [2024-06-28 00:00:12,858 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 74 predicate places. [2024-06-28 00:00:12,858 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 243 transitions, 3197 flow [2024-06-28 00:00:12,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:00:12,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:00:12,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:00:12,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 00:00:12,859 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:00:12,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:00:12,860 INFO L85 PathProgramCache]: Analyzing trace with hash -244158281, now seen corresponding path program 1 times [2024-06-28 00:00:12,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:00:12,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60124101] [2024-06-28 00:00:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:00:12,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:00:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:00:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:00:16,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:00:16,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60124101] [2024-06-28 00:00:16,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60124101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:00:16,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:00:16,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:00:16,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142759302] [2024-06-28 00:00:16,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:00:16,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:00:16,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:00:16,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:00:16,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:00:16,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-06-28 00:00:16,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 243 transitions, 3197 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:00:16,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:00:16,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-06-28 00:00:16,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:00:21,636 INFO L124 PetriNetUnfolderBase]: 16214/22095 cut-off events. [2024-06-28 00:00:21,636 INFO L125 PetriNetUnfolderBase]: For 380932/380994 co-relation queries the response was YES. [2024-06-28 00:00:21,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126139 conditions, 22095 events. 16214/22095 cut-off events. For 380932/380994 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 116269 event pairs, 6217 based on Foata normal form. 62/22156 useless extension candidates. Maximal degree in co-relation 126081. Up to 21003 conditions per place. [2024-06-28 00:00:21,849 INFO L140 encePairwiseOnDemand]: 35/51 looper letters, 188 selfloop transitions, 115 changer transitions 0/307 dead transitions. [2024-06-28 00:00:21,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 307 transitions, 4145 flow [2024-06-28 00:00:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:00:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:00:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-06-28 00:00:21,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049019607843137 [2024-06-28 00:00:21,853 INFO L175 Difference]: Start difference. First operand has 128 places, 243 transitions, 3197 flow. Second operand 8 states and 206 transitions. [2024-06-28 00:00:21,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 307 transitions, 4145 flow [2024-06-28 00:00:22,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 307 transitions, 3899 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-28 00:00:22,675 INFO L231 Difference]: Finished difference. Result has 130 places, 247 transitions, 3259 flow [2024-06-28 00:00:22,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2953, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3259, PETRI_PLACES=130, PETRI_TRANSITIONS=247} [2024-06-28 00:00:22,676 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 76 predicate places. [2024-06-28 00:00:22,676 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 247 transitions, 3259 flow [2024-06-28 00:00:22,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:00:22,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:00:22,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:00:22,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 00:00:22,678 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:00:22,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:00:22,678 INFO L85 PathProgramCache]: Analyzing trace with hash -738328438, now seen corresponding path program 1 times [2024-06-28 00:00:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:00:22,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725842497] [2024-06-28 00:00:22,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:00:22,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:00:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:00:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:00:24,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:00:24,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725842497] [2024-06-28 00:00:24,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725842497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:00:24,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:00:24,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:00:24,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118963389] [2024-06-28 00:00:24,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:00:24,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:00:24,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:00:24,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:00:24,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:00:24,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-06-28 00:00:24,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 247 transitions, 3259 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:00:24,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:00:24,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-06-28 00:00:24,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand