./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/safe003_power.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/safe003_power.opt.i ./goblint.2024-05-07_14-17-48.files/protection/safe003_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-wip.fs.witness-ghost-b44c828-m [2024-05-12 13:34:44,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 13:34:44,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 13:34:44,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 13:34:44,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 13:34:44,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 13:34:44,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 13:34:44,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 13:34:44,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 13:34:44,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 13:34:44,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 13:34:44,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 13:34:44,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 13:34:44,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 13:34:44,337 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 13:34:44,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 13:34:44,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 13:34:44,337 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 13:34:44,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 13:34:44,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 13:34:44,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 13:34:44,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 13:34:44,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 13:34:44,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 13:34:44,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 13:34:44,340 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 13:34:44,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 13:34:44,340 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 13:34:44,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 13:34:44,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 13:34:44,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 13:34:44,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 13:34:44,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:34:44,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 13:34:44,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 13:34:44,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 13:34:44,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 13:34:44,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 13:34:44,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 13:34:44,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 13:34:44,344 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 13:34:44,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 13:34:44,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 13:34:44,345 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-05-12 13:34:44,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 13:34:44,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 13:34:44,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 13:34:44,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 13:34:44,645 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 13:34:44,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2024-05-12 13:34:45,834 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 13:34:46,095 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 13:34:46,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2024-05-12 13:34:46,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c04f1abed/2ccc5126c24643b98d08123c407fbe05/FLAG7d093b967 [2024-05-12 13:34:46,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c04f1abed/2ccc5126c24643b98d08123c407fbe05 [2024-05-12 13:34:46,133 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 13:34:46,133 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 13:34:46,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/safe003_power.opt.yml/witness.yml [2024-05-12 13:34:46,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 13:34:46,401 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 13:34:46,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 13:34:46,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 13:34:46,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 13:34:46,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:34:46" (1/2) ... [2024-05-12 13:34:46,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a10d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:34:46, skipping insertion in model container [2024-05-12 13:34:46,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:34:46" (1/2) ... [2024-05-12 13:34:46,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@d848af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:34:46, skipping insertion in model container [2024-05-12 13:34:46,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:34:46" (2/2) ... [2024-05-12 13:34:46,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a10d61 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:34:46, skipping insertion in model container [2024-05-12 13:34:46,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:34:46" (2/2) ... [2024-05-12 13:34:46,412 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 13:34:46,555 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 13:34:46,557 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p1_EAX$read_delayed_var && *__unbuffered_p1_EAX$read_delayed_var <= 1) && __unbuffered_p1_EAX$read_delayed_var == & x) && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0) [2024-05-12 13:34:46,557 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p1_EAX$read_delayed_var && *__unbuffered_p1_EAX$read_delayed_var <= 1) && __unbuffered_p1_EAX$read_delayed_var == & x) && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0) [2024-05-12 13:34:46,557 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p1_EAX$read_delayed_var && *__unbuffered_p1_EAX$read_delayed_var <= 1) && __unbuffered_p1_EAX$read_delayed_var == & x) && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0) [2024-05-12 13:34:46,558 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 13:34:46,558 INFO L106 edCorrectnessWitness]: ghost_update [L854-L854] multithreaded = 1; [2024-05-12 13:34:46,601 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 13:34:46,790 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i[951,964] [2024-05-12 13:34:46,999 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:34:47,015 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 13:34:47,059 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i[951,964] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 13:34:47,162 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:34:47,205 INFO L206 MainTranslator]: Completed translation [2024-05-12 13:34:47,205 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:34:47 WrapperNode [2024-05-12 13:34:47,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 13:34:47,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 13:34:47,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 13:34:47,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 13:34:47,213 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 12.05 01:34:47" (1/1) ... [2024-05-12 13:34:47,229 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 12.05 01:34:47" (1/1) ... [2024-05-12 13:34:47,264 INFO L138 Inliner]: procedures = 176, calls = 97, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 258 [2024-05-12 13:34:47,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 13:34:47,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 13:34:47,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 13:34:47,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 13:34:47,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:34:47" (1/1) ... [2024-05-12 13:34:47,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:34:47" (1/1) ... [2024-05-12 13:34:47,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:34:47" (1/1) ... [2024-05-12 13:34:47,337 INFO L175 MemorySlicer]: Split 47 memory accesses to 5 slices as follows [2, 1, 1, 1, 42]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 0, 1]. The 9 writes are split as follows [0, 1, 1, 1, 6]. [2024-05-12 13:34:47,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:34:47" (1/1) ... [2024-05-12 13:34:47,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:34:47" (1/1) ... [2024-05-12 13:34:47,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:34:47" (1/1) ... [2024-05-12 13:34:47,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:34:47" (1/1) ... [2024-05-12 13:34:47,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:34:47" (1/1) ... [2024-05-12 13:34:47,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:34:47" (1/1) ... [2024-05-12 13:34:47,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 13:34:47,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 13:34:47,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 13:34:47,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 13:34:47,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:34:47" (1/1) ... [2024-05-12 13:34:47,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:34:47,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:34:47,403 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-05-12 13:34:47,414 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-05-12 13:34:47,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 13:34:47,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 13:34:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 13:34:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 13:34:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-05-12 13:34:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 13:34:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 13:34:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 13:34:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 13:34:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-05-12 13:34:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 13:34:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 13:34:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 13:34:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 13:34:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 13:34:47,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 13:34:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 13:34:47,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 13:34:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 13:34:47,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 13:34:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 13:34:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 13:34:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 13:34:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 13:34:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-05-12 13:34:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 13:34:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 13:34:47,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 13:34:47,454 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 13:34:47,635 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 13:34:47,637 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 13:34:48,233 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 13:34:48,233 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 13:34:48,722 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 13:34:48,723 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 13:34:48,723 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:34:48 BoogieIcfgContainer [2024-05-12 13:34:48,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 13:34:48,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 13:34:48,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 13:34:48,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 13:34:48,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 01:34:46" (1/4) ... [2024-05-12 13:34:48,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774ba01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:34:48, skipping insertion in model container [2024-05-12 13:34:48,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:34:46" (2/4) ... [2024-05-12 13:34:48,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774ba01e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:34:48, skipping insertion in model container [2024-05-12 13:34:48,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:34:47" (3/4) ... [2024-05-12 13:34:48,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774ba01e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:34:48, skipping insertion in model container [2024-05-12 13:34:48,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:34:48" (4/4) ... [2024-05-12 13:34:48,731 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2024-05-12 13:34:48,748 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 13:34:48,748 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 13:34:48,748 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 13:34:48,817 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 13:34:48,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-05-12 13:34:48,898 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-05-12 13:34:48,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:34:48,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-05-12 13:34:48,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-05-12 13:34:48,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 44 transitions, 97 flow [2024-05-12 13:34:48,917 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 13:34:48,924 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;@76a6ff35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 13:34:48,925 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 13:34:48,930 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 13:34:48,930 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 13:34:48,931 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:34:48,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:34:48,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 13:34:48,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:34:48,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:34:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash -127418045, now seen corresponding path program 1 times [2024-05-12 13:34:48,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:34:48,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542478868] [2024-05-12 13:34:48,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:34:48,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:34:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:34:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:34:51,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:34:51,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542478868] [2024-05-12 13:34:51,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542478868] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:34:51,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:34:51,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 13:34:51,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505117447] [2024-05-12 13:34:51,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:34:51,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 13:34:51,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:34:51,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 13:34:51,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 13:34:51,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:34:51,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:34:51,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:34:51,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:34:51,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:34:53,256 INFO L124 PetriNetUnfolderBase]: 3759/5939 cut-off events. [2024-05-12 13:34:53,257 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-05-12 13:34:53,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11471 conditions, 5939 events. 3759/5939 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 35568 event pairs, 2530 based on Foata normal form. 168/5685 useless extension candidates. Maximal degree in co-relation 11456. Up to 5402 conditions per place. [2024-05-12 13:34:53,298 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 42 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2024-05-12 13:34:53,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 235 flow [2024-05-12 13:34:53,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 13:34:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 13:34:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-05-12 13:34:53,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5531914893617021 [2024-05-12 13:34:53,312 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 97 flow. Second operand 4 states and 104 transitions. [2024-05-12 13:34:53,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 235 flow [2024-05-12 13:34:53,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 13:34:53,322 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 146 flow [2024-05-12 13:34:53,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-05-12 13:34:53,326 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2024-05-12 13:34:53,327 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 146 flow [2024-05-12 13:34:53,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:34:53,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:34:53,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:34:53,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 13:34:53,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:34:53,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:34:53,329 INFO L85 PathProgramCache]: Analyzing trace with hash 345020215, now seen corresponding path program 1 times [2024-05-12 13:34:53,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:34:53,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371696762] [2024-05-12 13:34:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:34:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:34:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:34:53,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:34:53,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:34:53,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371696762] [2024-05-12 13:34:53,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371696762] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:34:53,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:34:53,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 13:34:53,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539312141] [2024-05-12 13:34:53,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:34:53,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:34:53,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:34:53,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:34:53,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 13:34:53,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 13:34:53,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:34:53,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:34:53,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 13:34:53,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:34:54,012 INFO L124 PetriNetUnfolderBase]: 1473/2529 cut-off events. [2024-05-12 13:34:54,013 INFO L125 PetriNetUnfolderBase]: For 261/263 co-relation queries the response was YES. [2024-05-12 13:34:54,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5142 conditions, 2529 events. 1473/2529 cut-off events. For 261/263 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 16818 event pairs, 417 based on Foata normal form. 0/2390 useless extension candidates. Maximal degree in co-relation 5126. Up to 1540 conditions per place. [2024-05-12 13:34:54,033 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 46 selfloop transitions, 2 changer transitions 1/68 dead transitions. [2024-05-12 13:34:54,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 292 flow [2024-05-12 13:34:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:34:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:34:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-05-12 13:34:54,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7304964539007093 [2024-05-12 13:34:54,043 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 146 flow. Second operand 3 states and 103 transitions. [2024-05-12 13:34:54,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 292 flow [2024-05-12 13:34:54,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 292 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-05-12 13:34:54,046 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 148 flow [2024-05-12 13:34:54,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-05-12 13:34:54,047 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2024-05-12 13:34:54,047 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 148 flow [2024-05-12 13:34:54,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:34:54,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:34:54,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:34:54,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 13:34:54,048 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:34:54,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:34:54,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2105364194, now seen corresponding path program 1 times [2024-05-12 13:34:54,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:34:54,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329810029] [2024-05-12 13:34:54,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:34:54,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:34:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:34:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:34:56,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:34:56,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329810029] [2024-05-12 13:34:56,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329810029] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:34:56,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:34:56,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:34:56,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875032396] [2024-05-12 13:34:56,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:34:56,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 13:34:56,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:34:56,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 13:34:56,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 13:34:56,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 13:34:56,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:34:56,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:34:56,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 13:34:56,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:34:57,673 INFO L124 PetriNetUnfolderBase]: 4845/7581 cut-off events. [2024-05-12 13:34:57,674 INFO L125 PetriNetUnfolderBase]: For 1191/1191 co-relation queries the response was YES. [2024-05-12 13:34:57,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16260 conditions, 7581 events. 4845/7581 cut-off events. For 1191/1191 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 44644 event pairs, 2886 based on Foata normal form. 0/7356 useless extension candidates. Maximal degree in co-relation 16242. Up to 6885 conditions per place. [2024-05-12 13:34:57,719 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 47 selfloop transitions, 15 changer transitions 1/71 dead transitions. [2024-05-12 13:34:57,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 349 flow [2024-05-12 13:34:57,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:34:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:34:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-05-12 13:34:57,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723404255319149 [2024-05-12 13:34:57,724 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 148 flow. Second operand 5 states and 111 transitions. [2024-05-12 13:34:57,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 349 flow [2024-05-12 13:34:57,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:34:57,730 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 243 flow [2024-05-12 13:34:57,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2024-05-12 13:34:57,731 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-05-12 13:34:57,731 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 243 flow [2024-05-12 13:34:57,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:34:57,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:34:57,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:34:57,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 13:34:57,732 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:34:57,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:34:57,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2105692484, now seen corresponding path program 2 times [2024-05-12 13:34:57,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:34:57,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599593280] [2024-05-12 13:34:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:34:57,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:34:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:34:59,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:34:59,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:34:59,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599593280] [2024-05-12 13:34:59,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599593280] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:34:59,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:34:59,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:34:59,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171056142] [2024-05-12 13:34:59,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:34:59,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 13:34:59,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:34:59,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 13:34:59,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 13:34:59,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 13:34:59,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:34:59,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:34:59,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 13:34:59,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:01,054 INFO L124 PetriNetUnfolderBase]: 4304/6819 cut-off events. [2024-05-12 13:35:01,055 INFO L125 PetriNetUnfolderBase]: For 1974/1974 co-relation queries the response was YES. [2024-05-12 13:35:01,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15471 conditions, 6819 events. 4304/6819 cut-off events. For 1974/1974 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 40263 event pairs, 2424 based on Foata normal form. 1/6602 useless extension candidates. Maximal degree in co-relation 15451. Up to 6128 conditions per place. [2024-05-12 13:35:01,099 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 57 selfloop transitions, 14 changer transitions 0/79 dead transitions. [2024-05-12 13:35:01,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 439 flow [2024-05-12 13:35:01,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:35:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:35:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-05-12 13:35:01,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5148936170212766 [2024-05-12 13:35:01,102 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 243 flow. Second operand 5 states and 121 transitions. [2024-05-12 13:35:01,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 439 flow [2024-05-12 13:35:01,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 79 transitions, 437 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-05-12 13:35:01,106 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 292 flow [2024-05-12 13:35:01,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2024-05-12 13:35:01,108 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2024-05-12 13:35:01,108 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 292 flow [2024-05-12 13:35:01,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:01,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:01,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:01,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 13:35:01,109 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:35:01,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash 851613379, now seen corresponding path program 1 times [2024-05-12 13:35:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:01,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656782799] [2024-05-12 13:35:01,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:01,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656782799] [2024-05-12 13:35:03,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656782799] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:03,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:03,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:35:03,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830970875] [2024-05-12 13:35:03,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:03,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:35:03,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:03,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:35:03,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:35:03,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 13:35:03,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:03,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:03,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 13:35:03,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:04,442 INFO L124 PetriNetUnfolderBase]: 4306/6827 cut-off events. [2024-05-12 13:35:04,443 INFO L125 PetriNetUnfolderBase]: For 1986/1992 co-relation queries the response was YES. [2024-05-12 13:35:04,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15601 conditions, 6827 events. 4306/6827 cut-off events. For 1986/1992 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 40246 event pairs, 2637 based on Foata normal form. 6/6613 useless extension candidates. Maximal degree in co-relation 15577. Up to 6133 conditions per place. [2024-05-12 13:35:04,477 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 54 selfloop transitions, 17 changer transitions 0/79 dead transitions. [2024-05-12 13:35:04,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 79 transitions, 516 flow [2024-05-12 13:35:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:35:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:35:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-05-12 13:35:04,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4326241134751773 [2024-05-12 13:35:04,479 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 292 flow. Second operand 6 states and 122 transitions. [2024-05-12 13:35:04,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 79 transitions, 516 flow [2024-05-12 13:35:04,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 79 transitions, 485 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-05-12 13:35:04,482 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 380 flow [2024-05-12 13:35:04,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2024-05-12 13:35:04,483 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2024-05-12 13:35:04,484 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 380 flow [2024-05-12 13:35:04,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:04,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:04,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:04,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 13:35:04,484 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:35:04,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:04,485 INFO L85 PathProgramCache]: Analyzing trace with hash 851959339, now seen corresponding path program 2 times [2024-05-12 13:35:04,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:04,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293202459] [2024-05-12 13:35:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:04,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:06,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:06,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293202459] [2024-05-12 13:35:06,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293202459] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:06,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:06,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:35:06,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984677038] [2024-05-12 13:35:06,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:06,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:35:06,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:06,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:35:06,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:35:06,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 13:35:06,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:06,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:06,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 13:35:06,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:07,652 INFO L124 PetriNetUnfolderBase]: 4308/6827 cut-off events. [2024-05-12 13:35:07,653 INFO L125 PetriNetUnfolderBase]: For 2531/2531 co-relation queries the response was YES. [2024-05-12 13:35:07,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16185 conditions, 6827 events. 4308/6827 cut-off events. For 2531/2531 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 40167 event pairs, 2633 based on Foata normal form. 2/6611 useless extension candidates. Maximal degree in co-relation 16158. Up to 6137 conditions per place. [2024-05-12 13:35:07,690 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 66 selfloop transitions, 16 changer transitions 0/90 dead transitions. [2024-05-12 13:35:07,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 611 flow [2024-05-12 13:35:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:35:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:35:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-05-12 13:35:07,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4716312056737589 [2024-05-12 13:35:07,692 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 380 flow. Second operand 6 states and 133 transitions. [2024-05-12 13:35:07,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 611 flow [2024-05-12 13:35:07,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 587 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 13:35:07,699 INFO L231 Difference]: Finished difference. Result has 74 places, 73 transitions, 430 flow [2024-05-12 13:35:07,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=430, PETRI_PLACES=74, PETRI_TRANSITIONS=73} [2024-05-12 13:35:07,702 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2024-05-12 13:35:07,702 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 430 flow [2024-05-12 13:35:07,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:07,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:07,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:07,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 13:35:07,703 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:35:07,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:07,703 INFO L85 PathProgramCache]: Analyzing trace with hash 851972359, now seen corresponding path program 3 times [2024-05-12 13:35:07,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:07,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637956712] [2024-05-12 13:35:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:07,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:09,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:09,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637956712] [2024-05-12 13:35:09,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637956712] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:09,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:09,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:35:09,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303601962] [2024-05-12 13:35:09,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:09,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:35:09,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:09,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:35:09,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:35:09,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 13:35:09,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 430 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:09,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:09,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 13:35:09,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:10,843 INFO L124 PetriNetUnfolderBase]: 4311/6831 cut-off events. [2024-05-12 13:35:10,844 INFO L125 PetriNetUnfolderBase]: For 3279/3279 co-relation queries the response was YES. [2024-05-12 13:35:10,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16556 conditions, 6831 events. 4311/6831 cut-off events. For 3279/3279 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 40164 event pairs, 2284 based on Foata normal form. 2/6615 useless extension candidates. Maximal degree in co-relation 16526. Up to 6117 conditions per place. [2024-05-12 13:35:10,879 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 80 selfloop transitions, 21 changer transitions 0/109 dead transitions. [2024-05-12 13:35:10,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 109 transitions, 763 flow [2024-05-12 13:35:10,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:35:10,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:35:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-05-12 13:35:10,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48328267477203646 [2024-05-12 13:35:10,881 INFO L175 Difference]: Start difference. First operand has 74 places, 73 transitions, 430 flow. Second operand 7 states and 159 transitions. [2024-05-12 13:35:10,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 109 transitions, 763 flow [2024-05-12 13:35:10,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 109 transitions, 734 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-05-12 13:35:10,887 INFO L231 Difference]: Finished difference. Result has 81 places, 82 transitions, 535 flow [2024-05-12 13:35:10,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=535, PETRI_PLACES=81, PETRI_TRANSITIONS=82} [2024-05-12 13:35:10,889 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 28 predicate places. [2024-05-12 13:35:10,889 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 82 transitions, 535 flow [2024-05-12 13:35:10,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:10,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:10,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:10,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 13:35:10,890 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:35:10,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:10,890 INFO L85 PathProgramCache]: Analyzing trace with hash 840997634, now seen corresponding path program 1 times [2024-05-12 13:35:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:10,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327601674] [2024-05-12 13:35:10,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:10,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:12,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:12,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327601674] [2024-05-12 13:35:12,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327601674] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:12,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:12,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:35:12,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38324190] [2024-05-12 13:35:12,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:12,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:35:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:12,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:35:12,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:35:12,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:35:12,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 535 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:12,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:12,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:35:12,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:13,755 INFO L124 PetriNetUnfolderBase]: 3158/5160 cut-off events. [2024-05-12 13:35:13,755 INFO L125 PetriNetUnfolderBase]: For 4836/4937 co-relation queries the response was YES. [2024-05-12 13:35:13,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13624 conditions, 5160 events. 3158/5160 cut-off events. For 4836/4937 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 31174 event pairs, 1642 based on Foata normal form. 4/4775 useless extension candidates. Maximal degree in co-relation 13590. Up to 4524 conditions per place. [2024-05-12 13:35:13,783 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 63 selfloop transitions, 16 changer transitions 0/94 dead transitions. [2024-05-12 13:35:13,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 94 transitions, 748 flow [2024-05-12 13:35:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:35:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:35:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-05-12 13:35:13,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2024-05-12 13:35:13,785 INFO L175 Difference]: Start difference. First operand has 81 places, 82 transitions, 535 flow. Second operand 5 states and 115 transitions. [2024-05-12 13:35:13,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 94 transitions, 748 flow [2024-05-12 13:35:13,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 94 transitions, 697 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-05-12 13:35:13,792 INFO L231 Difference]: Finished difference. Result has 85 places, 86 transitions, 572 flow [2024-05-12 13:35:13,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=572, PETRI_PLACES=85, PETRI_TRANSITIONS=86} [2024-05-12 13:35:13,793 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2024-05-12 13:35:13,793 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 86 transitions, 572 flow [2024-05-12 13:35:13,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:13,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:13,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:13,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 13:35:13,794 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:35:13,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:13,794 INFO L85 PathProgramCache]: Analyzing trace with hash 641355109, now seen corresponding path program 1 times [2024-05-12 13:35:13,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:13,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953683301] [2024-05-12 13:35:13,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:13,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:16,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:16,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953683301] [2024-05-12 13:35:16,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953683301] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:16,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:16,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:35:16,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095006094] [2024-05-12 13:35:16,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:16,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:35:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:16,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:35:16,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:35:16,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 13:35:16,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 86 transitions, 572 flow. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:16,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:16,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 13:35:16,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:17,427 INFO L124 PetriNetUnfolderBase]: 4310/6830 cut-off events. [2024-05-12 13:35:17,428 INFO L125 PetriNetUnfolderBase]: For 6242/6275 co-relation queries the response was YES. [2024-05-12 13:35:17,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18145 conditions, 6830 events. 4310/6830 cut-off events. For 6242/6275 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 40162 event pairs, 1937 based on Foata normal form. 1/6614 useless extension candidates. Maximal degree in co-relation 18107. Up to 6083 conditions per place. [2024-05-12 13:35:17,470 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 84 selfloop transitions, 39 changer transitions 0/131 dead transitions. [2024-05-12 13:35:17,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 131 transitions, 1006 flow [2024-05-12 13:35:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:35:17,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:35:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 13:35:17,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258358662613982 [2024-05-12 13:35:17,472 INFO L175 Difference]: Start difference. First operand has 85 places, 86 transitions, 572 flow. Second operand 7 states and 173 transitions. [2024-05-12 13:35:17,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 131 transitions, 1006 flow [2024-05-12 13:35:17,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 131 transitions, 991 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:35:17,481 INFO L231 Difference]: Finished difference. Result has 92 places, 97 transitions, 763 flow [2024-05-12 13:35:17,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=763, PETRI_PLACES=92, PETRI_TRANSITIONS=97} [2024-05-12 13:35:17,482 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 39 predicate places. [2024-05-12 13:35:17,482 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 97 transitions, 763 flow [2024-05-12 13:35:17,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:17,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:17,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:17,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 13:35:17,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:35:17,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash 745357571, now seen corresponding path program 1 times [2024-05-12 13:35:17,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:17,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907583818] [2024-05-12 13:35:17,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:17,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:19,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:19,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907583818] [2024-05-12 13:35:19,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907583818] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:19,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:19,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:35:19,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144200262] [2024-05-12 13:35:19,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:19,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:35:19,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:19,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:35:19,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:35:19,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 13:35:19,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 97 transitions, 763 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:19,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:19,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 13:35:19,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:20,952 INFO L124 PetriNetUnfolderBase]: 4369/6922 cut-off events. [2024-05-12 13:35:20,952 INFO L125 PetriNetUnfolderBase]: For 10116/10118 co-relation queries the response was YES. [2024-05-12 13:35:20,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19894 conditions, 6922 events. 4369/6922 cut-off events. For 10116/10118 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 40658 event pairs, 2005 based on Foata normal form. 0/6670 useless extension candidates. Maximal degree in co-relation 19853. Up to 6229 conditions per place. [2024-05-12 13:35:20,996 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 82 selfloop transitions, 25 changer transitions 0/115 dead transitions. [2024-05-12 13:35:20,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 115 transitions, 1051 flow [2024-05-12 13:35:20,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:35:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:35:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-05-12 13:35:20,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475177304964539 [2024-05-12 13:35:20,999 INFO L175 Difference]: Start difference. First operand has 92 places, 97 transitions, 763 flow. Second operand 6 states and 134 transitions. [2024-05-12 13:35:20,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 115 transitions, 1051 flow [2024-05-12 13:35:21,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 115 transitions, 977 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-05-12 13:35:21,022 INFO L231 Difference]: Finished difference. Result has 97 places, 101 transitions, 798 flow [2024-05-12 13:35:21,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=798, PETRI_PLACES=97, PETRI_TRANSITIONS=101} [2024-05-12 13:35:21,024 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 44 predicate places. [2024-05-12 13:35:21,025 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 101 transitions, 798 flow [2024-05-12 13:35:21,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:21,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:21,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:21,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 13:35:21,025 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:35:21,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1938238494, now seen corresponding path program 1 times [2024-05-12 13:35:21,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:21,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618858859] [2024-05-12 13:35:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:23,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:23,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618858859] [2024-05-12 13:35:23,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618858859] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:23,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:23,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:35:23,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074652894] [2024-05-12 13:35:23,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:23,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:35:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:23,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:35:23,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:35:23,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 13:35:23,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 101 transitions, 798 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:23,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:23,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 13:35:23,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:24,602 INFO L124 PetriNetUnfolderBase]: 4313/6844 cut-off events. [2024-05-12 13:35:24,602 INFO L125 PetriNetUnfolderBase]: For 10595/10690 co-relation queries the response was YES. [2024-05-12 13:35:24,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19749 conditions, 6844 events. 4313/6844 cut-off events. For 10595/10690 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 40266 event pairs, 1969 based on Foata normal form. 14/6640 useless extension candidates. Maximal degree in co-relation 19704. Up to 6142 conditions per place. [2024-05-12 13:35:24,631 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 81 selfloop transitions, 22 changer transitions 0/111 dead transitions. [2024-05-12 13:35:24,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 111 transitions, 1051 flow [2024-05-12 13:35:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:35:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:35:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-05-12 13:35:24,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41033434650455924 [2024-05-12 13:35:24,634 INFO L175 Difference]: Start difference. First operand has 97 places, 101 transitions, 798 flow. Second operand 7 states and 135 transitions. [2024-05-12 13:35:24,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 111 transitions, 1051 flow [2024-05-12 13:35:24,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 111 transitions, 1016 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 13:35:24,656 INFO L231 Difference]: Finished difference. Result has 101 places, 102 transitions, 827 flow [2024-05-12 13:35:24,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=827, PETRI_PLACES=101, PETRI_TRANSITIONS=102} [2024-05-12 13:35:24,657 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 48 predicate places. [2024-05-12 13:35:24,657 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 102 transitions, 827 flow [2024-05-12 13:35:24,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:24,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:24,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:24,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 13:35:24,658 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:35:24,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:24,658 INFO L85 PathProgramCache]: Analyzing trace with hash 744940001, now seen corresponding path program 2 times [2024-05-12 13:35:24,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:24,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767863825] [2024-05-12 13:35:24,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:24,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:26,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:26,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767863825] [2024-05-12 13:35:26,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767863825] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:26,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:26,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:35:26,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076604900] [2024-05-12 13:35:26,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:26,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:35:26,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:26,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:35:26,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:35:26,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 13:35:26,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 102 transitions, 827 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:26,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:26,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 13:35:26,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:27,832 INFO L124 PetriNetUnfolderBase]: 4368/6925 cut-off events. [2024-05-12 13:35:27,833 INFO L125 PetriNetUnfolderBase]: For 10703/10722 co-relation queries the response was YES. [2024-05-12 13:35:27,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20035 conditions, 6925 events. 4368/6925 cut-off events. For 10703/10722 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 40706 event pairs, 2004 based on Foata normal form. 14/6687 useless extension candidates. Maximal degree in co-relation 19990. Up to 6230 conditions per place. [2024-05-12 13:35:27,862 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 76 selfloop transitions, 27 changer transitions 0/111 dead transitions. [2024-05-12 13:35:27,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 111 transitions, 1087 flow [2024-05-12 13:35:27,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:35:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:35:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-05-12 13:35:27,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4326241134751773 [2024-05-12 13:35:27,863 INFO L175 Difference]: Start difference. First operand has 101 places, 102 transitions, 827 flow. Second operand 6 states and 122 transitions. [2024-05-12 13:35:27,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 111 transitions, 1087 flow [2024-05-12 13:35:27,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 111 transitions, 1029 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 13:35:27,883 INFO L231 Difference]: Finished difference. Result has 102 places, 105 transitions, 869 flow [2024-05-12 13:35:27,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=869, PETRI_PLACES=102, PETRI_TRANSITIONS=105} [2024-05-12 13:35:27,884 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 49 predicate places. [2024-05-12 13:35:27,884 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 105 transitions, 869 flow [2024-05-12 13:35:27,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:35:27,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:27,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:27,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 13:35:27,885 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:35:27,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:27,885 INFO L85 PathProgramCache]: Analyzing trace with hash 744946945, now seen corresponding path program 1 times [2024-05-12 13:35:27,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:27,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138097791] [2024-05-12 13:35:27,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:27,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:35:27,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 13:35:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:35:27,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 13:35:27,979 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 13:35:27,979 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 9 remaining) [2024-05-12 13:35:27,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-05-12 13:35:27,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 9 remaining) [2024-05-12 13:35:27,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-05-12 13:35:27,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2024-05-12 13:35:27,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-05-12 13:35:27,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2024-05-12 13:35:27,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2024-05-12 13:35:27,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-05-12 13:35:27,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 13:35:27,983 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:27,995 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 13:35:27,995 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 13:35:28,048 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,049 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,049 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,049 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,049 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,049 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,049 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,049 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,054 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,055 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,055 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,055 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,055 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,055 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,055 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,055 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:28,061 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-05-12 13:35:28,074 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-05-12 13:35:28,077 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-05-12 13:35:28,078 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 01:35:28 BasicIcfg [2024-05-12 13:35:28,078 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 13:35:28,078 INFO L158 Benchmark]: Toolchain (without parser) took 41677.44ms. Allocated memory was 153.1MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 114.4MB in the beginning and 1.0GB in the end (delta: -930.6MB). Peak memory consumption was 244.7MB. Max. memory is 16.1GB. [2024-05-12 13:35:28,078 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:35:28,079 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 153.1MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:35:28,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 803.92ms. Allocated memory is still 153.1MB. Free memory was 114.4MB in the beginning and 64.9MB in the end (delta: 49.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-05-12 13:35:28,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.57ms. Allocated memory is still 153.1MB. Free memory was 64.9MB in the beginning and 61.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-05-12 13:35:28,079 INFO L158 Benchmark]: Boogie Preprocessor took 96.78ms. Allocated memory is still 153.1MB. Free memory was 61.3MB in the beginning and 118.5MB in the end (delta: -57.2MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-05-12 13:35:28,080 INFO L158 Benchmark]: RCFGBuilder took 1360.61ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 118.5MB in the beginning and 140.8MB in the end (delta: -22.3MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2024-05-12 13:35:28,080 INFO L158 Benchmark]: TraceAbstraction took 39352.64ms. Allocated memory was 222.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 140.8MB in the beginning and 1.0GB in the end (delta: -904.2MB). Peak memory consumption was 198.9MB. Max. memory is 16.1GB. [2024-05-12 13:35:28,081 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.18ms. Allocated memory is still 153.1MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 803.92ms. Allocated memory is still 153.1MB. Free memory was 114.4MB in the beginning and 64.9MB in the end (delta: 49.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.57ms. Allocated memory is still 153.1MB. Free memory was 64.9MB in the beginning and 61.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.78ms. Allocated memory is still 153.1MB. Free memory was 61.3MB in the beginning and 118.5MB in the end (delta: -57.2MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1360.61ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 118.5MB in the beginning and 140.8MB in the end (delta: -22.3MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. * TraceAbstraction took 39352.64ms. Allocated memory was 222.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 140.8MB in the beginning and 1.0GB in the end (delta: -904.2MB). Peak memory consumption was 198.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 858]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 int __unbuffered_p2_EBX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1852; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1852={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L854] 0 //@ ghost multithreaded = 1; [L854] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1852={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1853; [L856] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p1_EAX$w_buff0 == 0)) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p1_EAX$read_delayed_var) && (*__unbuffered_p1_EAX$read_delayed_var <= 1)) && (__unbuffered_p1_EAX$read_delayed_var == &x)) && ((*__unbuffered_p1_EAX$read_delayed_var == 0) || (*__unbuffered_p1_EAX$read_delayed_var == 1)))))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 2)) && (__unbuffered_p2_EBX <= 127)) && (((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1)) || (__unbuffered_p2_EBX == 2))))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p1_EAX$flush_delayed == (_Bool) 0))); [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L856] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1852={6:0}, t1853={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L857] 0 pthread_t t1854; [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L858] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p1_EAX$w_buff0 == 0)) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p1_EAX$read_delayed_var) && (*__unbuffered_p1_EAX$read_delayed_var <= 1)) && (__unbuffered_p1_EAX$read_delayed_var == &x)) && ((*__unbuffered_p1_EAX$read_delayed_var == 0) || (*__unbuffered_p1_EAX$read_delayed_var == 1)))))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 2)) && (__unbuffered_p2_EBX <= 127)) && (((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1)) || (__unbuffered_p2_EBX == 2))))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p1_EAX$flush_delayed == (_Bool) 0))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1852={6:0}, t1853={7:0}, t1854={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 72 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 39.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 494 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2354 IncrementalHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 65 mSDtfsCounter, 2354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=869occurred in iteration=12, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 21.7s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 9853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-05-12 13:35:28,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE