./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix037_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/mix037_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/mix037_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix037_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:44:32,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:44:33,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:44:33,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:44:33,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:44:33,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:44:33,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:44:33,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:44:33,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:44:33,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:44:33,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:44:33,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:44:33,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:44:33,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:44:33,073 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:44:33,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:44:33,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:44:33,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:44:33,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:44:33,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:44:33,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:44:33,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:44:33,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:44:33,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:44:33,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:44:33,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:44:33,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:44:33,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:44:33,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:44:33,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:44:33,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:44:33,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:44:33,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:44:33,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:44:33,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:44:33,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:44:33,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:44:33,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:44:33,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:44:33,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:44:33,079 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:44:33,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:44:33,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:44:33,080 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:44:33,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:44:33,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:44:33,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:44:33,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:44:33,298 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:44:33,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:44:34,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:44:34,414 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:44:34,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:44:34,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d93d54e/215bbccf67d44a5f9560d6bb930d7019/FLAG034c90feb [2024-06-27 23:44:34,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d93d54e/215bbccf67d44a5f9560d6bb930d7019 [2024-06-27 23:44:34,796 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:44:34,797 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:44:34,797 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/mix037_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 23:44:34,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:44:34,860 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:44:34,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:44:34,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:44:34,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:44:34,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:44:34" (1/2) ... [2024-06-27 23:44:34,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781ff55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:44:34, skipping insertion in model container [2024-06-27 23:44:34,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:44:34" (1/2) ... [2024-06-27 23:44:34,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6444924d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:44:34, skipping insertion in model container [2024-06-27 23:44:34,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:44:34" (2/2) ... [2024-06-27 23:44:34,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781ff55a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:44:34, skipping insertion in model container [2024-06-27 23:44:34,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:44:34" (2/2) ... [2024-06-27 23:44:34,867 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:44:34,890 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:44:34,890 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:44:34,891 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:44:34,891 INFO L97 edCorrectnessWitness]: Location invariant before [L879-L879] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:44:34,891 INFO L97 edCorrectnessWitness]: Location invariant before [L878-L878] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:44:34,892 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:44:34,892 INFO L106 edCorrectnessWitness]: ghost_update [L872-L872] multithreaded = 1; [2024-06-27 23:44:34,932 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:44:35,303 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:44:35,314 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:44:35,532 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:44:35,579 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:44:35,580 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:44:35 WrapperNode [2024-06-27 23:44:35,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:44:35,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:44:35,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:44:35,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:44:35,586 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:44:35" (1/1) ... [2024-06-27 23:44:35,609 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:44:35" (1/1) ... [2024-06-27 23:44:35,669 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 140 [2024-06-27 23:44:35,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:44:35,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:44:35,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:44:35,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:44:35,679 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:44:35" (1/1) ... [2024-06-27 23:44:35,679 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:44:35" (1/1) ... [2024-06-27 23:44:35,696 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:44:35" (1/1) ... [2024-06-27 23:44:35,730 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:44:35,731 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:44:35" (1/1) ... [2024-06-27 23:44:35,731 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:44:35" (1/1) ... [2024-06-27 23:44:35,749 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:44:35" (1/1) ... [2024-06-27 23:44:35,751 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:44:35" (1/1) ... [2024-06-27 23:44:35,756 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:44:35" (1/1) ... [2024-06-27 23:44:35,760 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:44:35" (1/1) ... [2024-06-27 23:44:35,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:44:35,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:44:35,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:44:35,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:44:35,782 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:44:35" (1/1) ... [2024-06-27 23:44:35,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:44:35,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:44:35,826 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:44:35,876 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:44:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:44:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:44:35,890 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:44:35,890 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:44:35,890 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:44:35,890 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:44:35,890 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:44:35,891 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:44:35,891 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 23:44:35,891 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 23:44:35,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:44:35,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:44:35,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:44:35,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:44:35,893 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:44:36,021 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:44:36,023 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:44:36,557 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:44:36,558 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:44:36,732 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:44:36,732 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:44:36,733 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:44:36 BoogieIcfgContainer [2024-06-27 23:44:36,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:44:36,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:44:36,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:44:36,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:44:36,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:44:34" (1/4) ... [2024-06-27 23:44:36,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e5975d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:44:36, skipping insertion in model container [2024-06-27 23:44:36,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:44:34" (2/4) ... [2024-06-27 23:44:36,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e5975d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:44:36, skipping insertion in model container [2024-06-27 23:44:36,740 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:44:35" (3/4) ... [2024-06-27 23:44:36,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e5975d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:44:36, skipping insertion in model container [2024-06-27 23:44:36,741 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:44:36" (4/4) ... [2024-06-27 23:44:36,742 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:44:36,756 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:44:36,756 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 23:44:36,756 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:44:36,839 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:44:36,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 122 flow [2024-06-27 23:44:36,903 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2024-06-27 23:44:36,904 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:44:36,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 0/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 23:44:36,906 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 53 transitions, 122 flow [2024-06-27 23:44:36,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 43 transitions, 98 flow [2024-06-27 23:44:36,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:44:36,968 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;@665d6353, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:44:36,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 23:44:36,972 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:44:36,972 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 23:44:36,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:44:36,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:44:36,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:44:36,974 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:44:36,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:44:36,993 INFO L85 PathProgramCache]: Analyzing trace with hash 407834173, now seen corresponding path program 1 times [2024-06-27 23:44:37,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:44:37,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297895868] [2024-06-27 23:44:37,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:44:37,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:44:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:44:38,767 INFO 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:44:38,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:44:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297895868] [2024-06-27 23:44:38,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297895868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:44:38,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:44:38,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:44:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432226608] [2024-06-27 23:44:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:44:38,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:44:38,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:44:38,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:44:38,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:44:38,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-06-27 23:44:38,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:44:38,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:44:38,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-06-27 23:44:38,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:44:40,917 INFO L124 PetriNetUnfolderBase]: 10982/15338 cut-off events. [2024-06-27 23:44:40,917 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-06-27 23:44:40,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30591 conditions, 15338 events. 10982/15338 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 84983 event pairs, 8614 based on Foata normal form. 1/15003 useless extension candidates. Maximal degree in co-relation 30578. Up to 14862 conditions per place. [2024-06-27 23:44:40,994 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 44 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-06-27 23:44:40,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 233 flow [2024-06-27 23:44:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:44:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:44:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-06-27 23:44:41,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6163522012578616 [2024-06-27 23:44:41,004 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 98 flow. Second operand 3 states and 98 transitions. [2024-06-27 23:44:41,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 233 flow [2024-06-27 23:44:41,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 226 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 23:44:41,009 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 133 flow [2024-06-27 23:44:41,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-06-27 23:44:41,012 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-06-27 23:44:41,012 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 133 flow [2024-06-27 23:44:41,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:44:41,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:44:41,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:44:41,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:44:41,013 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:44:41,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:44:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1086673948, now seen corresponding path program 1 times [2024-06-27 23:44:41,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:44:41,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855097602] [2024-06-27 23:44:41,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:44:41,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:44:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:44:42,264 INFO 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:44:42,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:44:42,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855097602] [2024-06-27 23:44:42,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855097602] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:44:42,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:44:42,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:44:42,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186939239] [2024-06-27 23:44:42,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:44:42,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:44:42,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:44:42,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:44:42,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:44:42,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-06-27 23:44:42,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:44:42,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:44:42,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-06-27 23:44:42,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:44:44,114 INFO L124 PetriNetUnfolderBase]: 10972/15332 cut-off events. [2024-06-27 23:44:44,115 INFO L125 PetriNetUnfolderBase]: For 2791/2791 co-relation queries the response was YES. [2024-06-27 23:44:44,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34431 conditions, 15332 events. 10972/15332 cut-off events. For 2791/2791 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 84879 event pairs, 7834 based on Foata normal form. 4/15183 useless extension candidates. Maximal degree in co-relation 34419. Up to 14827 conditions per place. [2024-06-27 23:44:44,170 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 54 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2024-06-27 23:44:44,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 325 flow [2024-06-27 23:44:44,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:44:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:44:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-06-27 23:44:44,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5990566037735849 [2024-06-27 23:44:44,172 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 133 flow. Second operand 4 states and 127 transitions. [2024-06-27 23:44:44,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 325 flow [2024-06-27 23:44:44,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:44:44,175 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 181 flow [2024-06-27 23:44:44,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-27 23:44:44,175 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2024-06-27 23:44:44,176 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 181 flow [2024-06-27 23:44:44,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:44:44,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:44:44,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:44:44,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:44:44,177 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:44:44,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:44:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash -672844118, now seen corresponding path program 1 times [2024-06-27 23:44:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:44:44,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77023452] [2024-06-27 23:44:44,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:44:44,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:44:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:44:45,443 INFO 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:44:45,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:44:45,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77023452] [2024-06-27 23:44:45,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77023452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:44:45,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:44:45,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:44:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491876815] [2024-06-27 23:44:45,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:44:45,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:44:45,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:44:45,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:44:45,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:44:45,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-06-27 23:44:45,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:44:45,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:44:45,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-06-27 23:44:45,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:44:47,430 INFO L124 PetriNetUnfolderBase]: 11080/15544 cut-off events. [2024-06-27 23:44:47,430 INFO L125 PetriNetUnfolderBase]: For 8256/8256 co-relation queries the response was YES. [2024-06-27 23:44:47,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38738 conditions, 15544 events. 11080/15544 cut-off events. For 8256/8256 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 87035 event pairs, 6374 based on Foata normal form. 10/15409 useless extension candidates. Maximal degree in co-relation 38724. Up to 14800 conditions per place. [2024-06-27 23:44:47,502 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 74 selfloop transitions, 21 changer transitions 0/103 dead transitions. [2024-06-27 23:44:47,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 549 flow [2024-06-27 23:44:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:44:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:44:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-06-27 23:44:47,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6339622641509434 [2024-06-27 23:44:47,504 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 181 flow. Second operand 5 states and 168 transitions. [2024-06-27 23:44:47,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 549 flow [2024-06-27 23:44:47,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 103 transitions, 530 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 23:44:47,508 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 314 flow [2024-06-27 23:44:47,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2024-06-27 23:44:47,510 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2024-06-27 23:44:47,510 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 314 flow [2024-06-27 23:44:47,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:44:47,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:44:47,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:44:47,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:44:47,511 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:44:47,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:44:47,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1253900205, now seen corresponding path program 1 times [2024-06-27 23:44:47,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:44:47,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755224903] [2024-06-27 23:44:47,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:44:47,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:44:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:44:49,189 INFO 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:44:49,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:44:49,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755224903] [2024-06-27 23:44:49,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755224903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:44:49,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:44:49,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:44:49,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69712217] [2024-06-27 23:44:49,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:44:49,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:44:49,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:44:49,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:44:49,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:44:49,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-06-27 23:44:49,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:44:49,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:44:49,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-06-27 23:44:49,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:44:51,151 INFO L124 PetriNetUnfolderBase]: 11126/15591 cut-off events. [2024-06-27 23:44:51,152 INFO L125 PetriNetUnfolderBase]: For 19919/19919 co-relation queries the response was YES. [2024-06-27 23:44:51,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45890 conditions, 15591 events. 11126/15591 cut-off events. For 19919/19919 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 86513 event pairs, 5544 based on Foata normal form. 10/15456 useless extension candidates. Maximal degree in co-relation 45873. Up to 14796 conditions per place. [2024-06-27 23:44:51,223 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 85 selfloop transitions, 26 changer transitions 0/119 dead transitions. [2024-06-27 23:44:51,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 119 transitions, 730 flow [2024-06-27 23:44:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:44:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:44:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2024-06-27 23:44:51,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6257861635220126 [2024-06-27 23:44:51,225 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 314 flow. Second operand 6 states and 199 transitions. [2024-06-27 23:44:51,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 119 transitions, 730 flow [2024-06-27 23:44:51,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 718 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-27 23:44:51,234 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 408 flow [2024-06-27 23:44:51,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2024-06-27 23:44:51,235 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2024-06-27 23:44:51,235 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 408 flow [2024-06-27 23:44:51,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:44:51,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:44:51,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:44:51,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:44:51,236 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:44:51,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:44:51,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1936924905, now seen corresponding path program 1 times [2024-06-27 23:44:51,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:44:51,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442937026] [2024-06-27 23:44:51,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:44:51,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:44:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:44:53,079 INFO 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:44:53,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:44:53,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442937026] [2024-06-27 23:44:53,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442937026] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:44:53,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:44:53,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:44:53,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898984717] [2024-06-27 23:44:53,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:44:53,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:44:53,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:44:53,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:44:53,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:44:53,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-06-27 23:44:53,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 408 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:44:53,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:44:53,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-06-27 23:44:53,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:44:55,320 INFO L124 PetriNetUnfolderBase]: 11313/15882 cut-off events. [2024-06-27 23:44:55,320 INFO L125 PetriNetUnfolderBase]: For 32100/32100 co-relation queries the response was YES. [2024-06-27 23:44:55,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51756 conditions, 15882 events. 11313/15882 cut-off events. For 32100/32100 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 89099 event pairs, 4656 based on Foata normal form. 38/15775 useless extension candidates. Maximal degree in co-relation 51736. Up to 14797 conditions per place. [2024-06-27 23:44:55,388 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 96 selfloop transitions, 29 changer transitions 0/133 dead transitions. [2024-06-27 23:44:55,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 133 transitions, 890 flow [2024-06-27 23:44:55,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:44:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:44:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2024-06-27 23:44:55,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6145552560646901 [2024-06-27 23:44:55,390 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 408 flow. Second operand 7 states and 228 transitions. [2024-06-27 23:44:55,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 133 transitions, 890 flow [2024-06-27 23:44:55,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 133 transitions, 824 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 23:44:55,399 INFO L231 Difference]: Finished difference. Result has 71 places, 72 transitions, 437 flow [2024-06-27 23:44:55,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=437, PETRI_PLACES=71, PETRI_TRANSITIONS=72} [2024-06-27 23:44:55,400 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 15 predicate places. [2024-06-27 23:44:55,400 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 72 transitions, 437 flow [2024-06-27 23:44:55,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:44:55,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:44:55,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:44:55,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:44:55,401 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:44:55,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:44:55,402 INFO L85 PathProgramCache]: Analyzing trace with hash 676441086, now seen corresponding path program 1 times [2024-06-27 23:44:55,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:44:55,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060202026] [2024-06-27 23:44:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:44:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:44:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:44:57,100 INFO 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:44:57,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:44:57,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060202026] [2024-06-27 23:44:57,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060202026] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:44:57,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:44:57,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:44:57,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729116309] [2024-06-27 23:44:57,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:44:57,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:44:57,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:44:57,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:44:57,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:44:57,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:44:57,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 72 transitions, 437 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:44:57,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:44:57,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:44:57,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:44:59,441 INFO L124 PetriNetUnfolderBase]: 11295/15865 cut-off events. [2024-06-27 23:44:59,441 INFO L125 PetriNetUnfolderBase]: For 42966/42966 co-relation queries the response was YES. [2024-06-27 23:44:59,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54837 conditions, 15865 events. 11295/15865 cut-off events. For 42966/42966 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 88424 event pairs, 5463 based on Foata normal form. 6/15722 useless extension candidates. Maximal degree in co-relation 54815. Up to 15295 conditions per place. [2024-06-27 23:44:59,557 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 72 selfloop transitions, 15 changer transitions 0/94 dead transitions. [2024-06-27 23:44:59,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 94 transitions, 703 flow [2024-06-27 23:44:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:44:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:44:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-06-27 23:44:59,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49056603773584906 [2024-06-27 23:44:59,558 INFO L175 Difference]: Start difference. First operand has 71 places, 72 transitions, 437 flow. Second operand 5 states and 130 transitions. [2024-06-27 23:44:59,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 94 transitions, 703 flow [2024-06-27 23:44:59,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 94 transitions, 630 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 23:44:59,574 INFO L231 Difference]: Finished difference. Result has 72 places, 78 transitions, 471 flow [2024-06-27 23:44:59,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=471, PETRI_PLACES=72, PETRI_TRANSITIONS=78} [2024-06-27 23:44:59,575 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2024-06-27 23:44:59,575 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 78 transitions, 471 flow [2024-06-27 23:44:59,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:44:59,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:44:59,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:44:59,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:44:59,576 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:44:59,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:44:59,576 INFO L85 PathProgramCache]: Analyzing trace with hash 826868091, now seen corresponding path program 1 times [2024-06-27 23:44:59,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:44:59,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936272170] [2024-06-27 23:44:59,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:44:59,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:44:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:45:01,124 INFO 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:45:01,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:45:01,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936272170] [2024-06-27 23:45:01,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936272170] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:45:01,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:45:01,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:45:01,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191001626] [2024-06-27 23:45:01,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:45:01,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:45:01,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:45:01,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:45:01,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:45:01,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:45:01,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 78 transitions, 471 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:45:01,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:45:01,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:45:01,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:45:03,174 INFO L124 PetriNetUnfolderBase]: 11444/16056 cut-off events. [2024-06-27 23:45:03,175 INFO L125 PetriNetUnfolderBase]: For 56480/56480 co-relation queries the response was YES. [2024-06-27 23:45:03,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58783 conditions, 16056 events. 11444/16056 cut-off events. For 56480/56480 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 88890 event pairs, 4651 based on Foata normal form. 6/15907 useless extension candidates. Maximal degree in co-relation 58758. Up to 15407 conditions per place. [2024-06-27 23:45:03,263 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 89 selfloop transitions, 26 changer transitions 0/122 dead transitions. [2024-06-27 23:45:03,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 122 transitions, 921 flow [2024-06-27 23:45:03,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:45:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:45:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-06-27 23:45:03,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062893081761006 [2024-06-27 23:45:03,265 INFO L175 Difference]: Start difference. First operand has 72 places, 78 transitions, 471 flow. Second operand 6 states and 161 transitions. [2024-06-27 23:45:03,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 122 transitions, 921 flow [2024-06-27 23:45:03,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 122 transitions, 877 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-27 23:45:03,278 INFO L231 Difference]: Finished difference. Result has 77 places, 93 transitions, 627 flow [2024-06-27 23:45:03,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=627, PETRI_PLACES=77, PETRI_TRANSITIONS=93} [2024-06-27 23:45:03,279 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2024-06-27 23:45:03,279 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 93 transitions, 627 flow [2024-06-27 23:45:03,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:45:03,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:45:03,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:45:03,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:45:03,280 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:45:03,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:45:03,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1519860381, now seen corresponding path program 2 times [2024-06-27 23:45:03,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:45:03,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969998750] [2024-06-27 23:45:03,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:45:03,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:45:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:45:04,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:45:04,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:45:04,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969998750] [2024-06-27 23:45:04,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969998750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:45:04,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:45:04,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:45:04,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027396048] [2024-06-27 23:45:04,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:45:04,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:45:04,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:45:04,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:45:04,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:45:04,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:45:04,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 93 transitions, 627 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:45:04,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:45:04,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:45:04,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:45:06,998 INFO L124 PetriNetUnfolderBase]: 11451/16088 cut-off events. [2024-06-27 23:45:06,998 INFO L125 PetriNetUnfolderBase]: For 65706/65706 co-relation queries the response was YES. [2024-06-27 23:45:07,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61221 conditions, 16088 events. 11451/16088 cut-off events. For 65706/65706 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 89640 event pairs, 5201 based on Foata normal form. 6/15941 useless extension candidates. Maximal degree in co-relation 61193. Up to 15494 conditions per place. [2024-06-27 23:45:07,071 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 96 selfloop transitions, 18 changer transitions 0/121 dead transitions. [2024-06-27 23:45:07,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 121 transitions, 959 flow [2024-06-27 23:45:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:45:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:45:07,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-06-27 23:45:07,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4501347708894879 [2024-06-27 23:45:07,073 INFO L175 Difference]: Start difference. First operand has 77 places, 93 transitions, 627 flow. Second operand 7 states and 167 transitions. [2024-06-27 23:45:07,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 121 transitions, 959 flow [2024-06-27 23:45:07,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 121 transitions, 927 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-27 23:45:07,094 INFO L231 Difference]: Finished difference. Result has 82 places, 97 transitions, 691 flow [2024-06-27 23:45:07,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=691, PETRI_PLACES=82, PETRI_TRANSITIONS=97} [2024-06-27 23:45:07,095 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 26 predicate places. [2024-06-27 23:45:07,095 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 97 transitions, 691 flow [2024-06-27 23:45:07,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:45:07,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:45:07,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:45:07,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:45:07,096 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:45:07,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:45:07,097 INFO L85 PathProgramCache]: Analyzing trace with hash 344406399, now seen corresponding path program 3 times [2024-06-27 23:45:07,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:45:07,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332106853] [2024-06-27 23:45:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:45:07,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:45:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:45:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:45:08,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:45:08,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332106853] [2024-06-27 23:45:08,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332106853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:45:08,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:45:08,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:45:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807333456] [2024-06-27 23:45:08,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:45:08,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:45:08,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:45:08,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:45:08,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:45:08,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:45:08,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 97 transitions, 691 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:45:08,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:45:08,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:45:08,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:45:11,188 INFO L124 PetriNetUnfolderBase]: 11556/16267 cut-off events. [2024-06-27 23:45:11,188 INFO L125 PetriNetUnfolderBase]: For 75564/75564 co-relation queries the response was YES. [2024-06-27 23:45:11,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63300 conditions, 16267 events. 11556/16267 cut-off events. For 75564/75564 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 90633 event pairs, 5213 based on Foata normal form. 6/16128 useless extension candidates. Maximal degree in co-relation 63270. Up to 15403 conditions per place. [2024-06-27 23:45:11,290 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 99 selfloop transitions, 58 changer transitions 0/164 dead transitions. [2024-06-27 23:45:11,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 164 transitions, 1393 flow [2024-06-27 23:45:11,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:45:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:45:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2024-06-27 23:45:11,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013477088948787 [2024-06-27 23:45:11,292 INFO L175 Difference]: Start difference. First operand has 82 places, 97 transitions, 691 flow. Second operand 7 states and 186 transitions. [2024-06-27 23:45:11,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 164 transitions, 1393 flow [2024-06-27 23:45:11,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 164 transitions, 1325 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-27 23:45:11,332 INFO L231 Difference]: Finished difference. Result has 86 places, 129 transitions, 1103 flow [2024-06-27 23:45:11,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1103, PETRI_PLACES=86, PETRI_TRANSITIONS=129} [2024-06-27 23:45:11,332 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 30 predicate places. [2024-06-27 23:45:11,333 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 129 transitions, 1103 flow [2024-06-27 23:45:11,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:45:11,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:45:11,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:45:11,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:45:11,335 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:45:11,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:45:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash -128720919, now seen corresponding path program 1 times [2024-06-27 23:45:11,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:45:11,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928853283] [2024-06-27 23:45:11,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:45:11,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:45:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:45:14,081 INFO 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:45:14,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:45:14,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928853283] [2024-06-27 23:45:14,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928853283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:45:14,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:45:14,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:45:14,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735732227] [2024-06-27 23:45:14,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:45:14,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:45:14,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:45:14,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:45:14,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:45:14,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:45:14,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 129 transitions, 1103 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:45:14,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:45:14,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:45:14,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:45:17,062 INFO L124 PetriNetUnfolderBase]: 14157/19792 cut-off events. [2024-06-27 23:45:17,062 INFO L125 PetriNetUnfolderBase]: For 106111/106111 co-relation queries the response was YES. [2024-06-27 23:45:17,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78809 conditions, 19792 events. 14157/19792 cut-off events. For 106111/106111 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 110200 event pairs, 6498 based on Foata normal form. 6/19617 useless extension candidates. Maximal degree in co-relation 78778. Up to 19054 conditions per place. [2024-06-27 23:45:17,190 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 138 selfloop transitions, 24 changer transitions 0/168 dead transitions. [2024-06-27 23:45:17,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 168 transitions, 1598 flow [2024-06-27 23:45:17,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:45:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:45:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2024-06-27 23:45:17,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4363207547169811 [2024-06-27 23:45:17,192 INFO L175 Difference]: Start difference. First operand has 86 places, 129 transitions, 1103 flow. Second operand 8 states and 185 transitions. [2024-06-27 23:45:17,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 168 transitions, 1598 flow [2024-06-27 23:45:17,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 168 transitions, 1562 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-27 23:45:17,262 INFO L231 Difference]: Finished difference. Result has 93 places, 138 transitions, 1225 flow [2024-06-27 23:45:17,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1225, PETRI_PLACES=93, PETRI_TRANSITIONS=138} [2024-06-27 23:45:17,263 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 37 predicate places. [2024-06-27 23:45:17,263 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 138 transitions, 1225 flow [2024-06-27 23:45:17,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:45:17,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:45:17,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:45:17,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:45:17,264 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:45:17,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:45:17,264 INFO L85 PathProgramCache]: Analyzing trace with hash -826601037, now seen corresponding path program 1 times [2024-06-27 23:45:17,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:45:17,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767079848] [2024-06-27 23:45:17,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:45:17,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:45:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:45:19,303 INFO 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:45:19,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:45:19,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767079848] [2024-06-27 23:45:19,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767079848] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:45:19,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:45:19,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:45:19,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986597906] [2024-06-27 23:45:19,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:45:19,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:45:19,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:45:19,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:45:19,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:45:19,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:45:19,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 138 transitions, 1225 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:45:19,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:45:19,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:45:19,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:45:22,023 INFO L124 PetriNetUnfolderBase]: 14143/19892 cut-off events. [2024-06-27 23:45:22,023 INFO L125 PetriNetUnfolderBase]: For 125762/125762 co-relation queries the response was YES. [2024-06-27 23:45:22,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83419 conditions, 19892 events. 14143/19892 cut-off events. For 125762/125762 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 111567 event pairs, 6580 based on Foata normal form. 4/19876 useless extension candidates. Maximal degree in co-relation 83385. Up to 19104 conditions per place. [2024-06-27 23:45:22,165 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 138 selfloop transitions, 12 changer transitions 0/156 dead transitions. [2024-06-27 23:45:22,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 156 transitions, 1613 flow [2024-06-27 23:45:22,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:45:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:45:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-06-27 23:45:22,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42138364779874216 [2024-06-27 23:45:22,166 INFO L175 Difference]: Start difference. First operand has 93 places, 138 transitions, 1225 flow. Second operand 6 states and 134 transitions. [2024-06-27 23:45:22,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 156 transitions, 1613 flow [2024-06-27 23:45:22,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 156 transitions, 1541 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 23:45:22,289 INFO L231 Difference]: Finished difference. Result has 94 places, 142 transitions, 1234 flow [2024-06-27 23:45:22,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1234, PETRI_PLACES=94, PETRI_TRANSITIONS=142} [2024-06-27 23:45:22,289 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 38 predicate places. [2024-06-27 23:45:22,289 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 142 transitions, 1234 flow [2024-06-27 23:45:22,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:45:22,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:45:22,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:45:22,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:45:22,290 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:45:22,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:45:22,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2025239444, now seen corresponding path program 1 times [2024-06-27 23:45:22,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:45:22,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958826772] [2024-06-27 23:45:22,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:45:22,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:45:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:45:24,429 INFO 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:45:24,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:45:24,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958826772] [2024-06-27 23:45:24,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958826772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:45:24,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:45:24,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:45:24,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036853693] [2024-06-27 23:45:24,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:45:24,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:45:24,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:45:24,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:45:24,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:45:24,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:45:24,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 142 transitions, 1234 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:45:24,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:45:24,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:45:24,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:45:28,216 INFO L124 PetriNetUnfolderBase]: 16909/23446 cut-off events. [2024-06-27 23:45:28,216 INFO L125 PetriNetUnfolderBase]: For 179926/179940 co-relation queries the response was YES. [2024-06-27 23:45:28,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103952 conditions, 23446 events. 16909/23446 cut-off events. For 179926/179940 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 131671 event pairs, 7424 based on Foata normal form. 10/23351 useless extension candidates. Maximal degree in co-relation 103917. Up to 22167 conditions per place. [2024-06-27 23:45:28,356 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 137 selfloop transitions, 61 changer transitions 0/205 dead transitions. [2024-06-27 23:45:28,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 205 transitions, 2122 flow [2024-06-27 23:45:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:45:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:45:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2024-06-27 23:45:28,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013477088948787 [2024-06-27 23:45:28,358 INFO L175 Difference]: Start difference. First operand has 94 places, 142 transitions, 1234 flow. Second operand 7 states and 186 transitions. [2024-06-27 23:45:28,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 205 transitions, 2122 flow [2024-06-27 23:45:28,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 205 transitions, 2071 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-27 23:45:28,459 INFO L231 Difference]: Finished difference. Result has 99 places, 163 transitions, 1599 flow [2024-06-27 23:45:28,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1599, PETRI_PLACES=99, PETRI_TRANSITIONS=163} [2024-06-27 23:45:28,460 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 43 predicate places. [2024-06-27 23:45:28,460 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 163 transitions, 1599 flow [2024-06-27 23:45:28,460 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:45:28,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:45:28,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:45:28,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:45:28,461 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:45:28,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:45:28,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2025149234, now seen corresponding path program 2 times [2024-06-27 23:45:28,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:45:28,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892989383] [2024-06-27 23:45:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:45:28,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:45:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:45:30,551 INFO 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:45:30,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:45:30,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892989383] [2024-06-27 23:45:30,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892989383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:45:30,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:45:30,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:45:30,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151202476] [2024-06-27 23:45:30,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:45:30,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:45:30,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:45:30,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:45:30,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:45:30,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:45:30,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 163 transitions, 1599 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:45:30,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:45:30,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:45:30,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:45:34,143 INFO L124 PetriNetUnfolderBase]: 14113/19883 cut-off events. [2024-06-27 23:45:34,143 INFO L125 PetriNetUnfolderBase]: For 180533/180545 co-relation queries the response was YES. [2024-06-27 23:45:34,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94097 conditions, 19883 events. 14113/19883 cut-off events. For 180533/180545 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 113873 event pairs, 5973 based on Foata normal form. 12/19801 useless extension candidates. Maximal degree in co-relation 94059. Up to 18556 conditions per place. [2024-06-27 23:45:34,276 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 136 selfloop transitions, 66 changer transitions 0/210 dead transitions. [2024-06-27 23:45:34,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 210 transitions, 2369 flow [2024-06-27 23:45:34,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:45:34,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:45:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-06-27 23:45:34,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4834905660377358 [2024-06-27 23:45:34,289 INFO L175 Difference]: Start difference. First operand has 99 places, 163 transitions, 1599 flow. Second operand 8 states and 205 transitions. [2024-06-27 23:45:34,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 210 transitions, 2369 flow [2024-06-27 23:45:34,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 210 transitions, 2285 flow, removed 34 selfloop flow, removed 2 redundant places. [2024-06-27 23:45:34,418 INFO L231 Difference]: Finished difference. Result has 107 places, 168 transitions, 1793 flow [2024-06-27 23:45:34,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1793, PETRI_PLACES=107, PETRI_TRANSITIONS=168} [2024-06-27 23:45:34,419 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 51 predicate places. [2024-06-27 23:45:34,419 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 168 transitions, 1793 flow [2024-06-27 23:45:34,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:45:34,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:45:34,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:45:34,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:45:34,419 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:45:34,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:45:34,420 INFO L85 PathProgramCache]: Analyzing trace with hash 100663308, now seen corresponding path program 1 times [2024-06-27 23:45:34,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:45:34,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380032634] [2024-06-27 23:45:34,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:45:34,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:45:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:45:36,581 INFO 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:45:36,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:45:36,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380032634] [2024-06-27 23:45:36,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380032634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:45:36,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:45:36,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:45:36,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573220145] [2024-06-27 23:45:36,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:45:36,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:45:36,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:45:36,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:45:36,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:45:36,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:45:36,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 168 transitions, 1793 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:45:36,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:45:36,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:45:36,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:45:39,735 INFO L124 PetriNetUnfolderBase]: 14430/20267 cut-off events. [2024-06-27 23:45:39,736 INFO L125 PetriNetUnfolderBase]: For 210547/210550 co-relation queries the response was YES. [2024-06-27 23:45:39,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99577 conditions, 20267 events. 14430/20267 cut-off events. For 210547/210550 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 113455 event pairs, 6196 based on Foata normal form. 8/20247 useless extension candidates. Maximal degree in co-relation 99535. Up to 19009 conditions per place. [2024-06-27 23:45:39,899 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 144 selfloop transitions, 67 changer transitions 0/217 dead transitions. [2024-06-27 23:45:39,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 217 transitions, 2560 flow [2024-06-27 23:45:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:45:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:45:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-06-27 23:45:39,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455188679245283 [2024-06-27 23:45:39,901 INFO L175 Difference]: Start difference. First operand has 107 places, 168 transitions, 1793 flow. Second operand 8 states and 193 transitions. [2024-06-27 23:45:39,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 217 transitions, 2560 flow [2024-06-27 23:45:40,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 217 transitions, 2460 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-27 23:45:40,137 INFO L231 Difference]: Finished difference. Result has 112 places, 180 transitions, 2065 flow [2024-06-27 23:45:40,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1699, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2065, PETRI_PLACES=112, PETRI_TRANSITIONS=180} [2024-06-27 23:45:40,138 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 56 predicate places. [2024-06-27 23:45:40,138 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 180 transitions, 2065 flow [2024-06-27 23:45:40,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:45:40,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:45:40,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:45:40,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:45:40,138 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:45:40,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:45:40,139 INFO L85 PathProgramCache]: Analyzing trace with hash 304610428, now seen corresponding path program 2 times [2024-06-27 23:45:40,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:45:40,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822256033] [2024-06-27 23:45:40,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:45:40,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:45:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:45:42,094 INFO 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:45:42,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:45:42,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822256033] [2024-06-27 23:45:42,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822256033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:45:42,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:45:42,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:45:42,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141527279] [2024-06-27 23:45:42,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:45:42,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:45:42,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:45:42,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:45:42,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:45:42,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:45:42,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 180 transitions, 2065 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:45:42,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:45:42,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:45:42,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:45:45,695 INFO L124 PetriNetUnfolderBase]: 14461/20303 cut-off events. [2024-06-27 23:45:45,696 INFO L125 PetriNetUnfolderBase]: For 232374/232374 co-relation queries the response was YES. [2024-06-27 23:45:45,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102318 conditions, 20303 events. 14461/20303 cut-off events. For 232374/232374 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 113663 event pairs, 6245 based on Foata normal form. 3/20281 useless extension candidates. Maximal degree in co-relation 102274. Up to 19465 conditions per place. [2024-06-27 23:45:45,839 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 186 selfloop transitions, 34 changer transitions 0/226 dead transitions. [2024-06-27 23:45:45,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 226 transitions, 2835 flow [2024-06-27 23:45:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:45:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:45:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-06-27 23:45:45,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46630727762803237 [2024-06-27 23:45:45,841 INFO L175 Difference]: Start difference. First operand has 112 places, 180 transitions, 2065 flow. Second operand 7 states and 173 transitions. [2024-06-27 23:45:45,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 226 transitions, 2835 flow [2024-06-27 23:45:46,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 226 transitions, 2676 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 23:45:46,052 INFO L231 Difference]: Finished difference. Result has 114 places, 195 transitions, 2240 flow [2024-06-27 23:45:46,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1920, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2240, PETRI_PLACES=114, PETRI_TRANSITIONS=195} [2024-06-27 23:45:46,053 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 58 predicate places. [2024-06-27 23:45:46,053 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 195 transitions, 2240 flow [2024-06-27 23:45:46,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:45:46,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:45:46,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:45:46,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:45:46,054 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:45:46,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:45:46,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1741148794, now seen corresponding path program 3 times [2024-06-27 23:45:46,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:45:46,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416949488] [2024-06-27 23:45:46,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:45:46,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:45:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:45:48,418 INFO 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:45:48,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:45:48,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416949488] [2024-06-27 23:45:48,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416949488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:45:48,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:45:48,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:45:48,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377130059] [2024-06-27 23:45:48,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:45:48,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:45:48,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:45:48,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:45:48,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:45:48,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-27 23:45:48,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 195 transitions, 2240 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:48,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:45:48,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-27 23:45:48,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:45:51,685 INFO L124 PetriNetUnfolderBase]: 13993/19766 cut-off events. [2024-06-27 23:45:51,685 INFO L125 PetriNetUnfolderBase]: For 253628/253692 co-relation queries the response was YES. [2024-06-27 23:45:51,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102706 conditions, 19766 events. 13993/19766 cut-off events. For 253628/253692 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 113889 event pairs, 5704 based on Foata normal form. 43/19734 useless extension candidates. Maximal degree in co-relation 102660. Up to 17946 conditions per place. [2024-06-27 23:45:51,846 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 120 selfloop transitions, 116 changer transitions 0/246 dead transitions. [2024-06-27 23:45:51,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 246 transitions, 3164 flow [2024-06-27 23:45:51,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:45:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:45:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2024-06-27 23:45:51,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5471698113207547 [2024-06-27 23:45:51,847 INFO L175 Difference]: Start difference. First operand has 114 places, 195 transitions, 2240 flow. Second operand 7 states and 203 transitions. [2024-06-27 23:45:51,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 246 transitions, 3164 flow [2024-06-27 23:45:52,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 246 transitions, 3095 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-27 23:45:52,113 INFO L231 Difference]: Finished difference. Result has 118 places, 203 transitions, 2547 flow [2024-06-27 23:45:52,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2171, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2547, PETRI_PLACES=118, PETRI_TRANSITIONS=203} [2024-06-27 23:45:52,114 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 62 predicate places. [2024-06-27 23:45:52,114 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 203 transitions, 2547 flow [2024-06-27 23:45:52,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:52,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:45:52,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:45:52,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:45:52,114 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:45:52,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:45:52,115 INFO L85 PathProgramCache]: Analyzing trace with hash 104210698, now seen corresponding path program 4 times [2024-06-27 23:45:52,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:45:52,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669943929] [2024-06-27 23:45:52,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:45:52,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:45:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:45:54,527 INFO 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:45:54,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:45:54,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669943929] [2024-06-27 23:45:54,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669943929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:45:54,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:45:54,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:45:54,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726424959] [2024-06-27 23:45:54,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:45:54,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:45:54,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:45:54,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:45:54,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:45:54,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-27 23:45:54,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 203 transitions, 2547 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:54,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:45:54,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-27 23:45:54,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:45:57,818 INFO L124 PetriNetUnfolderBase]: 13987/19769 cut-off events. [2024-06-27 23:45:57,818 INFO L125 PetriNetUnfolderBase]: For 293131/293182 co-relation queries the response was YES. [2024-06-27 23:45:57,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107680 conditions, 19769 events. 13987/19769 cut-off events. For 293131/293182 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 113916 event pairs, 5779 based on Foata normal form. 41/19727 useless extension candidates. Maximal degree in co-relation 107632. Up to 18201 conditions per place. [2024-06-27 23:45:58,237 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 127 selfloop transitions, 111 changer transitions 0/248 dead transitions. [2024-06-27 23:45:58,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 248 transitions, 3427 flow [2024-06-27 23:45:58,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:45:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:45:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2024-06-27 23:45:58,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390835579514824 [2024-06-27 23:45:58,246 INFO L175 Difference]: Start difference. First operand has 118 places, 203 transitions, 2547 flow. Second operand 7 states and 200 transitions. [2024-06-27 23:45:58,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 248 transitions, 3427 flow [2024-06-27 23:45:58,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 248 transitions, 3231 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-27 23:45:58,501 INFO L231 Difference]: Finished difference. Result has 121 places, 207 transitions, 2684 flow [2024-06-27 23:45:58,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2375, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2684, PETRI_PLACES=121, PETRI_TRANSITIONS=207} [2024-06-27 23:45:58,502 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 65 predicate places. [2024-06-27 23:45:58,502 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 207 transitions, 2684 flow [2024-06-27 23:45:58,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:58,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:45:58,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:45:58,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 23:45:58,502 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:45:58,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:45:58,503 INFO L85 PathProgramCache]: Analyzing trace with hash 239770764, now seen corresponding path program 3 times [2024-06-27 23:45:58,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:45:58,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154680087] [2024-06-27 23:45:58,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:45:58,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:45:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:46:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:46:00,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:46:00,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154680087] [2024-06-27 23:46:00,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154680087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:46:00,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:46:00,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:46:00,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242102202] [2024-06-27 23:46:00,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:46:00,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:46:00,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:46:00,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:46:00,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:46:00,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:46:00,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 207 transitions, 2684 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:46:00,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:46:00,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:46:00,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:46:04,507 INFO L124 PetriNetUnfolderBase]: 14579/20420 cut-off events. [2024-06-27 23:46:04,507 INFO L125 PetriNetUnfolderBase]: For 279563/279614 co-relation queries the response was YES. [2024-06-27 23:46:04,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109436 conditions, 20420 events. 14579/20420 cut-off events. For 279563/279614 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 114129 event pairs, 6070 based on Foata normal form. 44/20436 useless extension candidates. Maximal degree in co-relation 109387. Up to 18923 conditions per place. [2024-06-27 23:46:04,644 INFO L140 encePairwiseOnDemand]: 37/53 looper letters, 158 selfloop transitions, 114 changer transitions 0/278 dead transitions. [2024-06-27 23:46:04,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 278 transitions, 3824 flow [2024-06-27 23:46:04,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:46:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:46:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2024-06-27 23:46:04,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5336927223719676 [2024-06-27 23:46:04,646 INFO L175 Difference]: Start difference. First operand has 121 places, 207 transitions, 2684 flow. Second operand 7 states and 198 transitions. [2024-06-27 23:46:04,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 278 transitions, 3824 flow [2024-06-27 23:46:05,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 278 transitions, 3479 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-27 23:46:05,026 INFO L231 Difference]: Finished difference. Result has 124 places, 231 transitions, 3015 flow [2024-06-27 23:46:05,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2390, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3015, PETRI_PLACES=124, PETRI_TRANSITIONS=231} [2024-06-27 23:46:05,026 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 68 predicate places. [2024-06-27 23:46:05,026 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 231 transitions, 3015 flow [2024-06-27 23:46:05,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:46:05,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:46:05,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:46:05,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 23:46:05,027 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-27 23:46:05,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:46:05,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1642027550, now seen corresponding path program 1 times [2024-06-27 23:46:05,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:46:05,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426931756] [2024-06-27 23:46:05,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:46:05,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:46:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:46:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:46:07,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:46:07,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426931756] [2024-06-27 23:46:07,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426931756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:46:07,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:46:07,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:46:07,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645625532] [2024-06-27 23:46:07,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:46:07,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:46:07,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:46:07,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:46:07,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:46:07,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:46:07,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 231 transitions, 3015 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:46:07,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:46:07,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:46:07,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:46:11,668 INFO L124 PetriNetUnfolderBase]: 14786/20777 cut-off events. [2024-06-27 23:46:11,668 INFO L125 PetriNetUnfolderBase]: For 295757/295797 co-relation queries the response was YES. [2024-06-27 23:46:11,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112957 conditions, 20777 events. 14786/20777 cut-off events. For 295757/295797 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 119671 event pairs, 5880 based on Foata normal form. 34/20701 useless extension candidates. Maximal degree in co-relation 112907. Up to 18739 conditions per place. [2024-06-27 23:46:11,810 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 202 selfloop transitions, 93 changer transitions 0/307 dead transitions. [2024-06-27 23:46:11,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 307 transitions, 4337 flow [2024-06-27 23:46:11,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:46:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:46:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2024-06-27 23:46:11,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5330188679245284 [2024-06-27 23:46:11,820 INFO L175 Difference]: Start difference. First operand has 124 places, 231 transitions, 3015 flow. Second operand 8 states and 226 transitions. [2024-06-27 23:46:11,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 307 transitions, 4337 flow [2024-06-27 23:46:12,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 307 transitions, 4173 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-27 23:46:12,100 INFO L231 Difference]: Finished difference. Result has 131 places, 246 transitions, 3296 flow [2024-06-27 23:46:12,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2851, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3296, PETRI_PLACES=131, PETRI_TRANSITIONS=246} [2024-06-27 23:46:12,101 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 75 predicate places. [2024-06-27 23:46:12,101 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 246 transitions, 3296 flow [2024-06-27 23:46:12,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:46:12,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:46:12,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:46:12,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 23:46:12,102 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-27 23:46:12,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:46:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1642088000, now seen corresponding path program 2 times [2024-06-27 23:46:12,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:46:12,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815304611] [2024-06-27 23:46:12,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:46:12,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:46:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:46:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:46:14,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:46:14,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815304611] [2024-06-27 23:46:14,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815304611] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:46:14,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:46:14,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:46:14,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563801592] [2024-06-27 23:46:14,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:46:14,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:46:14,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:46:14,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:46:14,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:46:14,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:46:14,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 246 transitions, 3296 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:46:14,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:46:14,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:46:14,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:46:18,590 INFO L124 PetriNetUnfolderBase]: 14958/21119 cut-off events. [2024-06-27 23:46:18,591 INFO L125 PetriNetUnfolderBase]: For 337849/337889 co-relation queries the response was YES. [2024-06-27 23:46:18,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118373 conditions, 21119 events. 14958/21119 cut-off events. For 337849/337889 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 122411 event pairs, 6013 based on Foata normal form. 44/21013 useless extension candidates. Maximal degree in co-relation 118319. Up to 19569 conditions per place. [2024-06-27 23:46:18,880 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 201 selfloop transitions, 89 changer transitions 0/302 dead transitions. [2024-06-27 23:46:18,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 302 transitions, 4362 flow [2024-06-27 23:46:18,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:46:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:46:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 220 transitions. [2024-06-27 23:46:18,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188679245283019 [2024-06-27 23:46:18,883 INFO L175 Difference]: Start difference. First operand has 131 places, 246 transitions, 3296 flow. Second operand 8 states and 220 transitions. [2024-06-27 23:46:18,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 302 transitions, 4362 flow [2024-06-27 23:46:19,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 302 transitions, 4322 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-27 23:46:19,199 INFO L231 Difference]: Finished difference. Result has 137 places, 248 transitions, 3496 flow [2024-06-27 23:46:19,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3256, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3496, PETRI_PLACES=137, PETRI_TRANSITIONS=248} [2024-06-27 23:46:19,199 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 81 predicate places. [2024-06-27 23:46:19,199 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 248 transitions, 3496 flow [2024-06-27 23:46:19,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:46:19,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:46:19,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:46:19,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 23:46:19,200 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:46:19,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:46:19,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1475819440, now seen corresponding path program 3 times [2024-06-27 23:46:19,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:46:19,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897849929] [2024-06-27 23:46:19,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:46:19,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:46:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat