./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe027_power.opt.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/safe027_power.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe027_power.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 02:10:24,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:10:24,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:10:24,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:10:24,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:10:24,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:10:24,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:10:24,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:10:24,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:10:24,646 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:10:24,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:10:24,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:10:24,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:10:24,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:10:24,650 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:10:24,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:10:24,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:10:24,650 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:10:24,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:10:24,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:10:24,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:10:24,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:10:24,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:10:24,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:10:24,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:10:24,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:10:24,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:10:24,653 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:10:24,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:10:24,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:10:24,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:10:24,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:10:24,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:10:24,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:10:24,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:10:24,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:10:24,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:10:24,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:10:24,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:10:24,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:10:24,658 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:10:24,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:10:24,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:10:24,658 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 [2024-06-28 02:10:24,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:10:24,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:10:24,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:10:24,989 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:10:24,989 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:10:24,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2024-06-28 02:10:26,183 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:10:26,433 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:10:26,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2024-06-28 02:10:26,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6ff12eb/38a9f1d997a24c88bd164afa3b359fb9/FLAG41c2fb5f6 [2024-06-28 02:10:26,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6ff12eb/38a9f1d997a24c88bd164afa3b359fb9 [2024-06-28 02:10:26,464 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:10:26,465 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:10:26,466 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-nonrel/safe027_power.opt.yml/witness.yml [2024-06-28 02:10:26,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:10:26,733 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:10:26,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:10:26,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:10:26,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:10:26,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:10:26" (1/2) ... [2024-06-28 02:10:26,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e996e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:10:26, skipping insertion in model container [2024-06-28 02:10:26,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:10:26" (1/2) ... [2024-06-28 02:10:26,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@62cdcb8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:10:26, skipping insertion in model container [2024-06-28 02:10:26,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:10:26" (2/2) ... [2024-06-28 02:10:26,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e996e2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:10:26, skipping insertion in model container [2024-06-28 02:10:26,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:10:26" (2/2) ... [2024-06-28 02:10:26,747 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:10:26,969 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:10:26,970 INFO L97 edCorrectnessWitness]: Location invariant before [L889-L889] (((((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd4 == (_Bool)0) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p2_EAX$flush_delayed == (_Bool)0) && __unbuffered_p2_EAX$mem_tmp == 0) && __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p2_EAX$w_buff0 == 0) && __unbuffered_p2_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p2_EAX$w_buff1 == 0) && __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1)))) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) [2024-06-28 02:10:26,970 INFO L97 edCorrectnessWitness]: Location invariant before [L891-L891] (((((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd4 == (_Bool)0) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p2_EAX$flush_delayed == (_Bool)0) && __unbuffered_p2_EAX$mem_tmp == 0) && __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p2_EAX$w_buff0 == 0) && __unbuffered_p2_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p2_EAX$w_buff1 == 0) && __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1)))) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) [2024-06-28 02:10:26,971 INFO L97 edCorrectnessWitness]: Location invariant before [L892-L892] (((((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd4 == (_Bool)0) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p2_EAX$flush_delayed == (_Bool)0) && __unbuffered_p2_EAX$mem_tmp == 0) && __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p2_EAX$w_buff0 == 0) && __unbuffered_p2_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p2_EAX$w_buff1 == 0) && __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1)))) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) [2024-06-28 02:10:26,971 INFO L97 edCorrectnessWitness]: Location invariant before [L887-L887] (((((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd4 == (_Bool)0) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p2_EAX$flush_delayed == (_Bool)0) && __unbuffered_p2_EAX$mem_tmp == 0) && __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p2_EAX$w_buff0 == 0) && __unbuffered_p2_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p2_EAX$w_buff1 == 0) && __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1)))) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) [2024-06-28 02:10:26,971 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:10:26,972 INFO L106 edCorrectnessWitness]: ghost_update [L885-L885] multithreaded = 1; [2024-06-28 02:10:27,017 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:10:27,191 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i[994,1007] [2024-06-28 02:10:27,375 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:10:27,389 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 02:10:27,426 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i[994,1007] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:10:27,566 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:10:27,599 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:10:27,604 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:10:27 WrapperNode [2024-06-28 02:10:27,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:10:27,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:10:27,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:10:27,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:10:27,613 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 28.06 02:10:27" (1/1) ... [2024-06-28 02:10:27,661 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 28.06 02:10:27" (1/1) ... [2024-06-28 02:10:27,708 INFO L138 Inliner]: procedures = 176, calls = 104, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 286 [2024-06-28 02:10:27,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:10:27,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:10:27,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:10:27,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:10:27,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:10:27" (1/1) ... [2024-06-28 02:10:27,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:10:27" (1/1) ... [2024-06-28 02:10:27,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:10:27" (1/1) ... [2024-06-28 02:10:27,756 INFO L175 MemorySlicer]: Split 58 memory accesses to 2 slices as follows [2, 56]. 97 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 8 writes are split as follows [0, 8]. [2024-06-28 02:10:27,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:10:27" (1/1) ... [2024-06-28 02:10:27,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:10:27" (1/1) ... [2024-06-28 02:10:27,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:10:27" (1/1) ... [2024-06-28 02:10:27,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:10:27" (1/1) ... [2024-06-28 02:10:27,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:10:27" (1/1) ... [2024-06-28 02:10:27,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:10:27" (1/1) ... [2024-06-28 02:10:27,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:10:27,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:10:27,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:10:27,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:10:27,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:10:27" (1/1) ... [2024-06-28 02:10:27,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:10:27,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:10:27,858 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-28 02:10:27,920 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-28 02:10:27,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 02:10:27,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 02:10:27,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 02:10:27,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 02:10:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:10:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:10:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 02:10:27,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 02:10:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 02:10:27,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 02:10:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 02:10:27,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 02:10:27,949 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 02:10:27,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 02:10:27,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:10:27,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 02:10:27,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:10:27,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:10:27,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:10:27,954 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 02:10:28,104 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:10:28,106 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:10:28,744 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:10:28,744 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:10:29,349 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:10:29,349 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 02:10:29,350 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:10:29 BoogieIcfgContainer [2024-06-28 02:10:29,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:10:29,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:10:29,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:10:29,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:10:29,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:10:26" (1/4) ... [2024-06-28 02:10:29,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73038531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:10:29, skipping insertion in model container [2024-06-28 02:10:29,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:10:26" (2/4) ... [2024-06-28 02:10:29,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73038531 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:10:29, skipping insertion in model container [2024-06-28 02:10:29,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:10:27" (3/4) ... [2024-06-28 02:10:29,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73038531 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:10:29, skipping insertion in model container [2024-06-28 02:10:29,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:10:29" (4/4) ... [2024-06-28 02:10:29,358 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2024-06-28 02:10:29,375 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:10:29,375 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-28 02:10:29,376 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:10:29,460 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 02:10:29,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 58 transitions, 132 flow [2024-06-28 02:10:29,540 INFO L124 PetriNetUnfolderBase]: 1/54 cut-off events. [2024-06-28 02:10:29,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:10:29,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 54 events. 1/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-06-28 02:10:29,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 58 transitions, 132 flow [2024-06-28 02:10:29,548 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 54 transitions, 120 flow [2024-06-28 02:10:29,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:10:29,561 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;@513bc332, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:10:29,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-28 02:10:29,567 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:10:29,567 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 02:10:29,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:10:29,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:10:29,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:10:29,569 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:10:29,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:10:29,574 INFO L85 PathProgramCache]: Analyzing trace with hash 971417196, now seen corresponding path program 1 times [2024-06-28 02:10:29,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:10:29,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088419809] [2024-06-28 02:10:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:10:29,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:10:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:10:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:10:31,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:10:31,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088419809] [2024-06-28 02:10:31,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088419809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:10:31,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:10:31,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:10:31,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732457205] [2024-06-28 02:10:31,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:10:31,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:10:31,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:10:31,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:10:31,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:10:32,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-28 02:10:32,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 120 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-28 02:10:32,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:10:32,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-28 02:10:32,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:10:38,110 INFO L124 PetriNetUnfolderBase]: 20110/28893 cut-off events. [2024-06-28 02:10:38,110 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2024-06-28 02:10:38,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56040 conditions, 28893 events. 20110/28893 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 191147 event pairs, 12082 based on Foata normal form. 600/27034 useless extension candidates. Maximal degree in co-relation 56027. Up to 26790 conditions per place. [2024-06-28 02:10:38,307 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 59 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2024-06-28 02:10:38,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 307 flow [2024-06-28 02:10:38,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:10:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:10:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-06-28 02:10:38,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-28 02:10:38,321 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 116 transitions. [2024-06-28 02:10:38,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 307 flow [2024-06-28 02:10:38,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 77 transitions, 300 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 02:10:38,335 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 167 flow [2024-06-28 02:10:38,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-06-28 02:10:38,340 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2024-06-28 02:10:38,340 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 167 flow [2024-06-28 02:10:38,340 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-28 02:10:38,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:10:38,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:10:38,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:10:38,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:10:38,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:10:38,343 INFO L85 PathProgramCache]: Analyzing trace with hash 32421013, now seen corresponding path program 1 times [2024-06-28 02:10:38,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:10:38,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971641178] [2024-06-28 02:10:38,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:10:38,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:10:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:10:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:10:38,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:10:38,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971641178] [2024-06-28 02:10:38,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971641178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:10:38,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:10:38,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:10:38,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663912107] [2024-06-28 02:10:38,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:10:38,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:10:38,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:10:38,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:10:38,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:10:38,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-06-28 02:10:38,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:10:38,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:10:38,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-06-28 02:10:38,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:10:41,037 INFO L124 PetriNetUnfolderBase]: 7354/11657 cut-off events. [2024-06-28 02:10:41,037 INFO L125 PetriNetUnfolderBase]: For 1673/1708 co-relation queries the response was YES. [2024-06-28 02:10:41,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24383 conditions, 11657 events. 7354/11657 cut-off events. For 1673/1708 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 83645 event pairs, 3219 based on Foata normal form. 0/11007 useless extension candidates. Maximal degree in co-relation 24371. Up to 7925 conditions per place. [2024-06-28 02:10:41,110 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 62 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2024-06-28 02:10:41,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 83 transitions, 354 flow [2024-06-28 02:10:41,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:10:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:10:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-06-28 02:10:41,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2024-06-28 02:10:41,118 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 167 flow. Second operand 3 states and 123 transitions. [2024-06-28 02:10:41,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 83 transitions, 354 flow [2024-06-28 02:10:41,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 83 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:10:41,124 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 158 flow [2024-06-28 02:10:41,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2024-06-28 02:10:41,132 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2024-06-28 02:10:41,136 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 158 flow [2024-06-28 02:10:41,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:10:41,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:10:41,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:10:41,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:10:41,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:10:41,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:10:41,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1219108614, now seen corresponding path program 1 times [2024-06-28 02:10:41,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:10:41,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712593958] [2024-06-28 02:10:41,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:10:41,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:10:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:10:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:10:44,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:10:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712593958] [2024-06-28 02:10:44,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712593958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:10:44,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:10:44,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:10:44,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187295412] [2024-06-28 02:10:44,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:10:44,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:10:44,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:10:44,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:10:44,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:10:44,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2024-06-28 02:10:44,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:10:44,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:10:44,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2024-06-28 02:10:44,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:10:48,757 INFO L124 PetriNetUnfolderBase]: 21050/30210 cut-off events. [2024-06-28 02:10:48,757 INFO L125 PetriNetUnfolderBase]: For 7251/7251 co-relation queries the response was YES. [2024-06-28 02:10:48,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66750 conditions, 30210 events. 21050/30210 cut-off events. For 7251/7251 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 192846 event pairs, 10267 based on Foata normal form. 8/29588 useless extension candidates. Maximal degree in co-relation 66737. Up to 27898 conditions per place. [2024-06-28 02:10:48,935 INFO L140 encePairwiseOnDemand]: 48/58 looper letters, 72 selfloop transitions, 10 changer transitions 1/93 dead transitions. [2024-06-28 02:10:48,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 93 transitions, 414 flow [2024-06-28 02:10:48,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:10:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:10:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2024-06-28 02:10:48,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6163793103448276 [2024-06-28 02:10:48,940 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 158 flow. Second operand 4 states and 143 transitions. [2024-06-28 02:10:48,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 93 transitions, 414 flow [2024-06-28 02:10:48,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 93 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 02:10:48,947 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 201 flow [2024-06-28 02:10:48,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2024-06-28 02:10:48,949 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2024-06-28 02:10:48,949 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 201 flow [2024-06-28 02:10:48,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:10:48,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:10:48,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:10:48,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:10:48,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:10:48,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:10:48,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1091228686, now seen corresponding path program 1 times [2024-06-28 02:10:48,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:10:48,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203658334] [2024-06-28 02:10:48,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:10:48,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:10:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:10:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:10:51,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:10:51,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203658334] [2024-06-28 02:10:51,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203658334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:10:51,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:10:51,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:10:51,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508165428] [2024-06-28 02:10:51,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:10:51,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:10:51,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:10:51,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:10:51,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:10:51,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2024-06-28 02:10:51,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:10:51,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:10:51,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2024-06-28 02:10:51,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:10:54,644 INFO L124 PetriNetUnfolderBase]: 15024/21873 cut-off events. [2024-06-28 02:10:54,644 INFO L125 PetriNetUnfolderBase]: For 9216/9216 co-relation queries the response was YES. [2024-06-28 02:10:54,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51682 conditions, 21873 events. 15024/21873 cut-off events. For 9216/9216 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 142096 event pairs, 8465 based on Foata normal form. 6/21376 useless extension candidates. Maximal degree in co-relation 51667. Up to 20071 conditions per place. [2024-06-28 02:10:54,810 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 77 selfloop transitions, 12 changer transitions 0/99 dead transitions. [2024-06-28 02:10:54,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 99 transitions, 495 flow [2024-06-28 02:10:54,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:10:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:10:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-06-28 02:10:54,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5275862068965518 [2024-06-28 02:10:54,813 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 201 flow. Second operand 5 states and 153 transitions. [2024-06-28 02:10:54,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 99 transitions, 495 flow [2024-06-28 02:10:54,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 99 transitions, 466 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-28 02:10:54,818 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 280 flow [2024-06-28 02:10:54,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2024-06-28 02:10:54,820 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2024-06-28 02:10:54,821 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 280 flow [2024-06-28 02:10:54,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:10:54,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:10:54,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:10:54,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:10:54,822 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:10:54,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:10:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash -512877943, now seen corresponding path program 1 times [2024-06-28 02:10:54,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:10:54,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567683] [2024-06-28 02:10:54,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:10:54,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:10:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:10:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:10:57,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:10:57,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567683] [2024-06-28 02:10:57,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:10:57,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:10:57,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:10:57,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945144331] [2024-06-28 02:10:57,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:10:57,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:10:57,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:10:57,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:10:57,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:10:57,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2024-06-28 02:10:57,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:10:57,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:10:57,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2024-06-28 02:10:57,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:00,831 INFO L124 PetriNetUnfolderBase]: 15015/21876 cut-off events. [2024-06-28 02:11:00,831 INFO L125 PetriNetUnfolderBase]: For 19402/19402 co-relation queries the response was YES. [2024-06-28 02:11:00,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58671 conditions, 21876 events. 15015/21876 cut-off events. For 19402/19402 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 142051 event pairs, 8178 based on Foata normal form. 3/21376 useless extension candidates. Maximal degree in co-relation 58653. Up to 20056 conditions per place. [2024-06-28 02:11:00,920 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 95 selfloop transitions, 25 changer transitions 0/130 dead transitions. [2024-06-28 02:11:00,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 130 transitions, 742 flow [2024-06-28 02:11:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:11:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:11:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2024-06-28 02:11:00,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5316091954022989 [2024-06-28 02:11:00,923 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 280 flow. Second operand 6 states and 185 transitions. [2024-06-28 02:11:00,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 130 transitions, 742 flow [2024-06-28 02:11:00,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 130 transitions, 700 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-28 02:11:00,930 INFO L231 Difference]: Finished difference. Result has 75 places, 88 transitions, 470 flow [2024-06-28 02:11:00,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=470, PETRI_PLACES=75, PETRI_TRANSITIONS=88} [2024-06-28 02:11:00,931 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2024-06-28 02:11:00,932 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 88 transitions, 470 flow [2024-06-28 02:11:00,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:00,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:00,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:00,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:11:00,932 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:11:00,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1280655811, now seen corresponding path program 1 times [2024-06-28 02:11:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:00,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068379315] [2024-06-28 02:11:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:00,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:03,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:03,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068379315] [2024-06-28 02:11:03,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068379315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:03,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:03,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:03,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197817669] [2024-06-28 02:11:03,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:03,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:03,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:03,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:03,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:03,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2024-06-28 02:11:04,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 88 transitions, 470 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:04,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:04,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2024-06-28 02:11:04,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:07,370 INFO L124 PetriNetUnfolderBase]: 15000/21841 cut-off events. [2024-06-28 02:11:07,370 INFO L125 PetriNetUnfolderBase]: For 32075/32075 co-relation queries the response was YES. [2024-06-28 02:11:07,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64831 conditions, 21841 events. 15000/21841 cut-off events. For 32075/32075 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 141600 event pairs, 7867 based on Foata normal form. 6/21344 useless extension candidates. Maximal degree in co-relation 64809. Up to 19981 conditions per place. [2024-06-28 02:11:07,526 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 109 selfloop transitions, 29 changer transitions 0/148 dead transitions. [2024-06-28 02:11:07,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 148 transitions, 918 flow [2024-06-28 02:11:07,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 217 transitions. [2024-06-28 02:11:07,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-06-28 02:11:07,528 INFO L175 Difference]: Start difference. First operand has 75 places, 88 transitions, 470 flow. Second operand 7 states and 217 transitions. [2024-06-28 02:11:07,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 148 transitions, 918 flow [2024-06-28 02:11:07,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 148 transitions, 886 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-06-28 02:11:07,552 INFO L231 Difference]: Finished difference. Result has 81 places, 92 transitions, 551 flow [2024-06-28 02:11:07,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=551, PETRI_PLACES=81, PETRI_TRANSITIONS=92} [2024-06-28 02:11:07,553 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2024-06-28 02:11:07,553 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 92 transitions, 551 flow [2024-06-28 02:11:07,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:07,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:07,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:07,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:11:07,554 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:11:07,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:07,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1940491009, now seen corresponding path program 1 times [2024-06-28 02:11:07,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:07,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206869678] [2024-06-28 02:11:07,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:07,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:10,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:10,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206869678] [2024-06-28 02:11:10,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206869678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:10,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:10,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:10,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484741873] [2024-06-28 02:11:10,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:10,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:10,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:10,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:10,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:10,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 58 [2024-06-28 02:11:10,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 92 transitions, 551 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-28 02:11:10,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:10,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 58 [2024-06-28 02:11:10,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:14,183 INFO L124 PetriNetUnfolderBase]: 19027/27548 cut-off events. [2024-06-28 02:11:14,183 INFO L125 PetriNetUnfolderBase]: For 54788/54788 co-relation queries the response was YES. [2024-06-28 02:11:14,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85206 conditions, 27548 events. 19027/27548 cut-off events. For 54788/54788 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 176503 event pairs, 8889 based on Foata normal form. 3/26921 useless extension candidates. Maximal degree in co-relation 85181. Up to 25185 conditions per place. [2024-06-28 02:11:14,401 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 88 selfloop transitions, 32 changer transitions 0/129 dead transitions. [2024-06-28 02:11:14,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 129 transitions, 917 flow [2024-06-28 02:11:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:11:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:11:14,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-06-28 02:11:14,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5275862068965518 [2024-06-28 02:11:14,403 INFO L175 Difference]: Start difference. First operand has 81 places, 92 transitions, 551 flow. Second operand 5 states and 153 transitions. [2024-06-28 02:11:14,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 129 transitions, 917 flow [2024-06-28 02:11:14,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 129 transitions, 838 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-28 02:11:14,436 INFO L231 Difference]: Finished difference. Result has 81 places, 97 transitions, 621 flow [2024-06-28 02:11:14,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=621, PETRI_PLACES=81, PETRI_TRANSITIONS=97} [2024-06-28 02:11:14,437 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2024-06-28 02:11:14,437 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 97 transitions, 621 flow [2024-06-28 02:11:14,437 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-28 02:11:14,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:14,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:14,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:11:14,438 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:11:14,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:14,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1377293764, now seen corresponding path program 1 times [2024-06-28 02:11:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:14,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551235340] [2024-06-28 02:11:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:14,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:17,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:17,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551235340] [2024-06-28 02:11:17,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551235340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:17,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:17,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:17,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931789715] [2024-06-28 02:11:17,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:17,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:17,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:17,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:17,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:17,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 58 [2024-06-28 02:11:17,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 97 transitions, 621 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:17,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:17,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 58 [2024-06-28 02:11:17,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:22,146 INFO L124 PetriNetUnfolderBase]: 19083/27633 cut-off events. [2024-06-28 02:11:22,146 INFO L125 PetriNetUnfolderBase]: For 76204/76204 co-relation queries the response was YES. [2024-06-28 02:11:22,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91318 conditions, 27633 events. 19083/27633 cut-off events. For 76204/76204 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 177110 event pairs, 8602 based on Foata normal form. 3/27006 useless extension candidates. Maximal degree in co-relation 91292. Up to 25159 conditions per place. [2024-06-28 02:11:22,311 INFO L140 encePairwiseOnDemand]: 44/58 looper letters, 119 selfloop transitions, 35 changer transitions 0/163 dead transitions. [2024-06-28 02:11:22,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 163 transitions, 1233 flow [2024-06-28 02:11:22,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:11:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:11:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2024-06-28 02:11:22,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5316091954022989 [2024-06-28 02:11:22,312 INFO L175 Difference]: Start difference. First operand has 81 places, 97 transitions, 621 flow. Second operand 6 states and 185 transitions. [2024-06-28 02:11:22,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 163 transitions, 1233 flow [2024-06-28 02:11:22,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 163 transitions, 1112 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:22,461 INFO L231 Difference]: Finished difference. Result has 86 places, 117 transitions, 844 flow [2024-06-28 02:11:22,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=844, PETRI_PLACES=86, PETRI_TRANSITIONS=117} [2024-06-28 02:11:22,462 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 20 predicate places. [2024-06-28 02:11:22,462 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 117 transitions, 844 flow [2024-06-28 02:11:22,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:22,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:22,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:22,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:11:22,463 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:11:22,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:22,464 INFO L85 PathProgramCache]: Analyzing trace with hash 611254604, now seen corresponding path program 2 times [2024-06-28 02:11:22,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:22,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095491634] [2024-06-28 02:11:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:22,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:25,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:25,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095491634] [2024-06-28 02:11:25,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095491634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:25,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:25,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:25,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146804823] [2024-06-28 02:11:25,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:25,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:25,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:25,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:25,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:25,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 58 [2024-06-28 02:11:25,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 117 transitions, 844 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:25,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:25,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 58 [2024-06-28 02:11:25,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:30,327 INFO L124 PetriNetUnfolderBase]: 19122/27792 cut-off events. [2024-06-28 02:11:30,328 INFO L125 PetriNetUnfolderBase]: For 75902/75916 co-relation queries the response was YES. [2024-06-28 02:11:30,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91569 conditions, 27792 events. 19122/27792 cut-off events. For 75902/75916 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 179993 event pairs, 8684 based on Foata normal form. 15/27179 useless extension candidates. Maximal degree in co-relation 91540. Up to 25256 conditions per place. [2024-06-28 02:11:30,523 INFO L140 encePairwiseOnDemand]: 44/58 looper letters, 158 selfloop transitions, 32 changer transitions 0/199 dead transitions. [2024-06-28 02:11:30,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 199 transitions, 1528 flow [2024-06-28 02:11:30,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 245 transitions. [2024-06-28 02:11:30,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280172413793104 [2024-06-28 02:11:30,525 INFO L175 Difference]: Start difference. First operand has 86 places, 117 transitions, 844 flow. Second operand 8 states and 245 transitions. [2024-06-28 02:11:30,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 199 transitions, 1528 flow [2024-06-28 02:11:30,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 199 transitions, 1436 flow, removed 28 selfloop flow, removed 2 redundant places. [2024-06-28 02:11:30,595 INFO L231 Difference]: Finished difference. Result has 94 places, 128 transitions, 992 flow [2024-06-28 02:11:30,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=992, PETRI_PLACES=94, PETRI_TRANSITIONS=128} [2024-06-28 02:11:30,596 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 28 predicate places. [2024-06-28 02:11:30,597 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 128 transitions, 992 flow [2024-06-28 02:11:30,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:30,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:30,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:30,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 02:11:30,598 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:11:30,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:30,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1156736032, now seen corresponding path program 1 times [2024-06-28 02:11:30,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:30,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855941512] [2024-06-28 02:11:30,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:30,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:33,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-28 02:11:33,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:33,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855941512] [2024-06-28 02:11:33,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855941512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:33,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:33,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:11:33,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876426691] [2024-06-28 02:11:33,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:33,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:11:33,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:33,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:11:33,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:11:33,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2024-06-28 02:11:33,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 128 transitions, 992 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:33,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:33,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2024-06-28 02:11:33,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:36,870 INFO L124 PetriNetUnfolderBase]: 15054/21905 cut-off events. [2024-06-28 02:11:36,870 INFO L125 PetriNetUnfolderBase]: For 83769/83769 co-relation queries the response was YES. [2024-06-28 02:11:36,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79330 conditions, 21905 events. 15054/21905 cut-off events. For 83769/83769 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 141089 event pairs, 7481 based on Foata normal form. 8/21408 useless extension candidates. Maximal degree in co-relation 79297. Up to 20004 conditions per place. [2024-06-28 02:11:37,081 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 133 selfloop transitions, 24 changer transitions 0/167 dead transitions. [2024-06-28 02:11:37,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 167 transitions, 1488 flow [2024-06-28 02:11:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:11:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:11:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-06-28 02:11:37,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5275862068965518 [2024-06-28 02:11:37,084 INFO L175 Difference]: Start difference. First operand has 94 places, 128 transitions, 992 flow. Second operand 5 states and 153 transitions. [2024-06-28 02:11:37,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 167 transitions, 1488 flow [2024-06-28 02:11:37,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 167 transitions, 1390 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-28 02:11:37,160 INFO L231 Difference]: Finished difference. Result has 96 places, 136 transitions, 1066 flow [2024-06-28 02:11:37,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1066, PETRI_PLACES=96, PETRI_TRANSITIONS=136} [2024-06-28 02:11:37,162 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 30 predicate places. [2024-06-28 02:11:37,162 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 136 transitions, 1066 flow [2024-06-28 02:11:37,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:37,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:37,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:37,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 02:11:37,163 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:11:37,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:37,164 INFO L85 PathProgramCache]: Analyzing trace with hash -330711336, now seen corresponding path program 1 times [2024-06-28 02:11:37,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:37,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890116148] [2024-06-28 02:11:37,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:37,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:39,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:39,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890116148] [2024-06-28 02:11:39,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890116148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:39,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:39,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:39,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957987557] [2024-06-28 02:11:39,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:39,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:39,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:39,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:39,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:39,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 58 [2024-06-28 02:11:39,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 136 transitions, 1066 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:39,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:39,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 58 [2024-06-28 02:11:39,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:44,529 INFO L124 PetriNetUnfolderBase]: 19154/27730 cut-off events. [2024-06-28 02:11:44,530 INFO L125 PetriNetUnfolderBase]: For 127613/127613 co-relation queries the response was YES. [2024-06-28 02:11:44,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104068 conditions, 27730 events. 19154/27730 cut-off events. For 127613/127613 co-relation queries the response was YES. Maximal size of possible extension queue 991. Compared 177046 event pairs, 6929 based on Foata normal form. 6/27106 useless extension candidates. Maximal degree in co-relation 104033. Up to 25354 conditions per place. [2024-06-28 02:11:44,758 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 160 selfloop transitions, 19 changer transitions 0/188 dead transitions. [2024-06-28 02:11:44,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 188 transitions, 1604 flow [2024-06-28 02:11:44,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:11:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:11:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-06-28 02:11:44,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2024-06-28 02:11:44,760 INFO L175 Difference]: Start difference. First operand has 96 places, 136 transitions, 1066 flow. Second operand 6 states and 180 transitions. [2024-06-28 02:11:44,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 188 transitions, 1604 flow [2024-06-28 02:11:44,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 188 transitions, 1578 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-06-28 02:11:44,873 INFO L231 Difference]: Finished difference. Result has 102 places, 144 transitions, 1184 flow [2024-06-28 02:11:44,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1184, PETRI_PLACES=102, PETRI_TRANSITIONS=144} [2024-06-28 02:11:44,874 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 36 predicate places. [2024-06-28 02:11:44,874 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 144 transitions, 1184 flow [2024-06-28 02:11:44,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:44,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:44,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:44,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 02:11:44,875 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:11:44,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash -253569368, now seen corresponding path program 2 times [2024-06-28 02:11:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:44,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544178555] [2024-06-28 02:11:44,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:44,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:47,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:47,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544178555] [2024-06-28 02:11:47,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544178555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:47,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:47,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:47,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424366163] [2024-06-28 02:11:47,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:47,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:47,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:47,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:47,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:47,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 58 [2024-06-28 02:11:47,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 144 transitions, 1184 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:47,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:47,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 58 [2024-06-28 02:11:47,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:52,842 INFO L124 PetriNetUnfolderBase]: 19146/27745 cut-off events. [2024-06-28 02:11:52,842 INFO L125 PetriNetUnfolderBase]: For 154244/154244 co-relation queries the response was YES. [2024-06-28 02:11:52,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109500 conditions, 27745 events. 19146/27745 cut-off events. For 154244/154244 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 178131 event pairs, 7890 based on Foata normal form. 6/27121 useless extension candidates. Maximal degree in co-relation 109461. Up to 25287 conditions per place. [2024-06-28 02:11:53,015 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 155 selfloop transitions, 29 changer transitions 0/193 dead transitions. [2024-06-28 02:11:53,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 193 transitions, 1732 flow [2024-06-28 02:11:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:11:53,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:11:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2024-06-28 02:11:53,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258620689655172 [2024-06-28 02:11:53,017 INFO L175 Difference]: Start difference. First operand has 102 places, 144 transitions, 1184 flow. Second operand 6 states and 183 transitions. [2024-06-28 02:11:53,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 193 transitions, 1732 flow [2024-06-28 02:11:53,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 193 transitions, 1652 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:53,131 INFO L231 Difference]: Finished difference. Result has 105 places, 148 transitions, 1246 flow [2024-06-28 02:11:53,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1246, PETRI_PLACES=105, PETRI_TRANSITIONS=148} [2024-06-28 02:11:53,132 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 39 predicate places. [2024-06-28 02:11:53,132 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 148 transitions, 1246 flow [2024-06-28 02:11:53,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:53,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:53,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:53,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 02:11:53,133 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:11:53,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:53,134 INFO L85 PathProgramCache]: Analyzing trace with hash -253563416, now seen corresponding path program 1 times [2024-06-28 02:11:53,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:53,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700462450] [2024-06-28 02:11:53,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:53,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:56,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:56,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700462450] [2024-06-28 02:11:56,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700462450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:56,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:56,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:11:56,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986263582] [2024-06-28 02:11:56,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:56,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:11:56,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:56,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:11:56,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:11:56,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 58 [2024-06-28 02:11:56,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 148 transitions, 1246 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:56,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:56,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 58 [2024-06-28 02:11:56,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:01,848 INFO L124 PetriNetUnfolderBase]: 19428/28193 cut-off events. [2024-06-28 02:12:01,848 INFO L125 PetriNetUnfolderBase]: For 192241/192241 co-relation queries the response was YES. [2024-06-28 02:12:01,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116401 conditions, 28193 events. 19428/28193 cut-off events. For 192241/192241 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 181199 event pairs, 7091 based on Foata normal form. 24/27587 useless extension candidates. Maximal degree in co-relation 116361. Up to 25099 conditions per place. [2024-06-28 02:12:02,037 INFO L140 encePairwiseOnDemand]: 44/58 looper letters, 159 selfloop transitions, 50 changer transitions 0/218 dead transitions. [2024-06-28 02:12:02,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 218 transitions, 1924 flow [2024-06-28 02:12:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:12:02,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:12:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2024-06-28 02:12:02,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5443349753694581 [2024-06-28 02:12:02,039 INFO L175 Difference]: Start difference. First operand has 105 places, 148 transitions, 1246 flow. Second operand 7 states and 221 transitions. [2024-06-28 02:12:02,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 218 transitions, 1924 flow [2024-06-28 02:12:02,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 218 transitions, 1816 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-28 02:12:02,191 INFO L231 Difference]: Finished difference. Result has 108 places, 155 transitions, 1357 flow [2024-06-28 02:12:02,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1357, PETRI_PLACES=108, PETRI_TRANSITIONS=155} [2024-06-28 02:12:02,191 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 42 predicate places. [2024-06-28 02:12:02,192 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 155 transitions, 1357 flow [2024-06-28 02:12:02,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:02,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:02,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:02,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 02:12:02,192 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:12:02,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:02,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1769033840, now seen corresponding path program 2 times [2024-06-28 02:12:02,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:02,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443201148] [2024-06-28 02:12:02,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:02,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:05,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:05,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443201148] [2024-06-28 02:12:05,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443201148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:05,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:05,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:05,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86104335] [2024-06-28 02:12:05,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:05,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:05,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:05,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:05,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:05,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 58 [2024-06-28 02:12:05,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 155 transitions, 1357 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:05,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:05,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 58 [2024-06-28 02:12:05,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand